Abstract
In this paper, we propose a generalized crossing local search method for solving vehicle routing problems. This method is a generalization of the string crossing method described in the literature. To evaluate the performance of the proposed method, extensive computational experiments on the proposed method applied to a set of benchmark problems are carried out. The results show that the proposed method, when coupled with metaheuristics such as simulated annealing, is comparable with other efficient heuristic methods proposed in the literature.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bodin LD, Golden BL, Assad AA and Ball MO (1983). Routing and scheduling of vehicles and crews: the state of the art. Comput Opns Res 10: 63–211.
Christofides N and Eilon S (1969). An algorithm for the vehicle dispatching problem. Opl Res Quart 20: 309–318.
Christofides N, Mingozzi A and Toth P (1979). The vehicle routing problem. In: Christofides N, Mingozzi A, Toth P and Sandi C (eds). Combinatorial Optimization. Wiley, Chichester, UK, pp 315–338.
Clarke G and Wright J (1964). Scheduling of vehicles from a central depot to a number of delivery points. Opns Res 12: 568–581.
Cordeau J-F, Gendreau M, Laporte G, Potvin J-Y and Semet F (2002). A guide to vehicle routing heuristics. J Opl Res Soc 53: 512–522.
Croes GA (1958). A method for solving traveling-salesman problems. Opns Res 6: 791–812.
Gendreau M, Hertz A and Laporte G (1994). A tabu search heuristic for the vehicle routing problem. Mngt Sci 40: 1276–1290.
Golden BL, Wasil EA, Kelly JP and Chao IM (1998). Metaheuristics in vehicle routing. In: Crainic TG and Laporte G (eds). Fleet Management and Logistics. Kluwer, Boston, USA, pp 33–56.
Kinderwater GAP and Savelsbergh MWP (1997). Vehicle routing: Handling edge exchanges. In: Aarts EHL and Lenstra JK (eds). Local Search in Combinatorial Optimization. Wiley, Chichester, UK, pp 337–360.
Lin S (1965). Computer solutions of the traveling salesman problem. Bell Syst Tech J 44: 2245–2269.
Lin S and Kernighan BW (1973). An effective heuristic algorithm for the traveling-salesman problem. Opns Res 21: 498–516.
Osman IH (1993). Meta-strategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann Opns Res 41: 421–451.
Osman IH and Salhi S (1996). Local search strategies for the vehicle fleet mix problem. In: Rayward-Smith VJ, Osman IH, Reeves CR and Smith GD (eds). Modern Heuristic Search Methods. Wiley, Chichester, UK, pp 131–153.
Pureza VM and França PM (1991). Vehicle routing problems via tabu search metaheuristic. Publication CRT-747. Centre de Recherché sur les Transports: Montréal.
Stewart WR (1987). Accelerated branch exchange heuristics for symmetric traveling salesman problems. Networks 17: 423–437.
Taillard ED (1993). Parallel iterative search methods for vehicle routing problems. Networks 23: 661–673.
Thompson PM and Psaraftis HN (1993). Cyclic transfer algorithms for multi-vehicle routing and scheduling problems. Opns Res 41: 935–946.
Toth P and Vigo D (2002). The vehicle routing problem. SIAM Monographs on Discrete Mathematics and Applications. SIAM: Philadelphia, USA.
Van Breedam AV (1995). Improvement heuristics for the vehicle routing problem based on simulated annealing. Eur J Opl Res 86: 480–490.
Zeng L, Ong HL and Ng KM (2005). An assignment-based local search method for solving vehicle routing problems. Asia-Pacific J Opl Res 22: 85–104.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zeng, L., Ong, H. & Ng, K. A generalized crossing local search method for solving vehicle routing problems. J Oper Res Soc 58, 528–532 (2007). https://doi.org/10.1057/palgrave.jors.2602171
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1057/palgrave.jors.2602171