Efficient Local Search Limitation Strategies for Vehicle Routing Problems
書誌事項
- 公開日
- 2008-01-01
- DOI
-
- 10.1007/978-3-540-78604-7_5
- 公開者
- Springer Berlin Heidelberg
説明
In this paper we examine five different strategies for limiting the local search neighborhoods in the context of vehicle routing problems. The vehicle routing problem deals with the assignment of a set of transportation orders to a fleet of vehicles, and the sequencing of stops for each vehicle to minimize transportation costs. The examined strategies are applied to three standard neighborhoods and implemented in a recently suggested powerful memetic algorithm. Experimental results on 26 well-known benchmark problems indicate significant speedups of almost 80% without worsening the solution quality. On the contrary, in 12 cases new best solutions were obtained.