Books : Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries [An article from: Transportation Research Part C]
In association with Amazon.comAvailability: Available for download now
Format: HTML
Label: Elsevier
Manufacturer: Elsevier
Publication Date: June 01, 2006
Publisher: Elsevier
Sales Rank: 5188487
Studio: Elsevier
Editorial Review:
Product Description:
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.
Browse for similar items by category:
- Artificial Intelligence - Computer Science - Computers & Internet - Subjects - Books - Heuristic & Constrained Search
- C - Programming - Computers & Internet - Subjects - Books - General
- C - Programming - Computers & Internet - Subjects - Books - General AAS
- Format (feature_browse-bin) - Refinements - Books - HTML
