The capacitated arc-routing problem with stochastic demands (CARPSD) is an extension of the well-known capacitated arc-routing problem (CARP) in which demands are stochastic. This leads to the possibility of route failures whenever the realized demand exceeds the vehicle capacity. This paper presents the CARPSD in the context of garbage collection. It describes an adaptive large-scale neighbourhood search heuristic for the problem. Computational results show the superiority of this algorithm over an alternative solution approach.
An adaptive large neighbourhood search heuristic for the capacitated arc-routing problem with stochastic demands / Laporte, G; Musmanno, R; Vocaturo, F. - In: TRANSPORTATION SCIENCE. - ISSN 0041-1655. - 44:1(2010), pp. 125-135.
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
Titolo: | An adaptive large neighbourhood search heuristic for the capacitated arc-routing problem with stochastic demands |
Autori: | |
Data di pubblicazione: | 2010 |
Rivista: | |
Citazione: | An adaptive large neighbourhood search heuristic for the capacitated arc-routing problem with stochastic demands / Laporte, G; Musmanno, R; Vocaturo, F. - In: TRANSPORTATION SCIENCE. - ISSN 0041-1655. - 44:1(2010), pp. 125-135. |
Handle: | http://hdl.handle.net/20.500.11770/153226 |
Appare nelle tipologie: | 1.1 Articolo in rivista |