Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries [An article from: Transportation Research Part C]

This digital document is a journal article from Transportation Research Part C, published by Elsevier in 2006. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.

Description:
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.