This paper deals with the probabilistic multi-vehicle pickup and delivery problem. We develop an efficient neighborhood evaluation procedure which allows to reduce the computational complexity by two orders of magnitude with respect to a straightforward approach. The numerical experiments indicate that, if incorporated in a local search strategy, our neighborhood evaluation technique, provides very good results in terms of computation time reduction and equity of the workload distribution among the available vehicles.
Efficient Neighborhood Search for the Probabilistic Multi-vehicle Pickup and Delivery Problem / Beraldi, P; Ghiani, G; Musmanno, R; Vocaturo, F. - In: ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH. - ISSN 0217-5959. - 27:3(2010), pp. 301-314.
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
Titolo: | Efficient Neighborhood Search for the Probabilistic Multi-vehicle Pickup and Delivery Problem |
Autori: | |
Data di pubblicazione: | 2010 |
Rivista: | |
Citazione: | Efficient Neighborhood Search for the Probabilistic Multi-vehicle Pickup and Delivery Problem / Beraldi, P; Ghiani, G; Musmanno, R; Vocaturo, F. - In: ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH. - ISSN 0217-5959. - 27:3(2010), pp. 301-314. |
Handle: | http://hdl.handle.net/20.500.11770/127553 |
Appare nelle tipologie: | 1.1 Articolo in rivista |