Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries |
| |
| Institution: | 1. Centre de recherche sur les transports, Université de Montréal, C.P. 6128, succursale Centre-ville, Montréal, Québec, Canada H3C 3J7;2. Département d’informatique et de recherche opérationnelle, Université de Montréal, C.P. 6128, succursale Centre-ville, Montréal, Québec, Canada H3C 3J7;3. Defence Research and Development Canada, Centre for Operational Research and Analysis, Ottawa, Ont., Canada K1A 0K2;1. Departament Estadística i Investigació Operativa, Universitat Politècnica de Catalunya, BarcelonaTech, Spain;2. Canada Research Chair in Distribution Management, HEC Montréal, Canada;1. Department of Civil and Environmental Engineering, University of Maryland, College Park, USA;2. IBM Research, Dublin, Ireland;3. IT Curves, Gaithersburg, USA |
| |
| Abstract: | This paper proposes neighborhood search heuristics to optimize the planned routes of vehicles in a context where new requests, with a pick-up and a delivery location, occur in real-time. Within this framework, new solutions are explored through a neighborhood structure based on ejection chains. Numerical results show the benefits of these procedures in a real-time context. The impact of a master–slave parallelization scheme, using an increasing number of processors, is also investigated. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
