The topological heuristic in vehicle routing problem (VRP)
DOI:
https://doi.org/10.15587/2313-8416.2015.44381Keywords:
routing, VRP, cluster routing, CluVRP, traveling salesman problem, heuristics, topology, graph theory, "cores and tails"Abstract
The creation of a mathematical model of the topology of the road network to solve vehicle routing problem (VRP) is presented in the paper. We propose heuristic of "cores and tails" as a way to reduce the dimensions and to compose topological-based sets of points into a single group. It is described four stages of creating a model. The prospects of further improvement of the algorithm with the transition to parallel filling routes are outlined
References
Applegate, D. L., Bixby, R. M., Chvátal, V., Cook, W. J. (2007). The Traveling Salesman Problem: a computational study. Princeton University Press, 608.
Dantzig, G. B., Ramser, J .H. (1959). The Truck Dispatching Problem. Management Science, 6 (1), 80–91. doi: 10.1287/mnsc.6.1.80
Baldacci, R., Christofides, N., Mingozzi, A. (2007). An exact algorithm for the vehicle routing prob-lem based on the set partitioning formulation with additional cuts. Mathematical Programming, 115 (2), 351–385. doi: 10.1007/s10107-007-0178-5
Ellabib, I., Otman, A. B., Calamai, P. (2002). An Experimental Study of a Simple Ant Colony System for the Vehicle Routing Problem with Time Windows. Lecture Notes in Computer Science, 2463, 53–64. doi: 10.1007/3-540-45724-0_5
Bianchessi, N., Righini (2007). Heuristic algorithms for the vehicle routing problem with simultane-ous pick-up and delivery. Computers & Operations Research, 34, 578–594. doi: 10.1016/j.cor.2005.03.014
Bräysy, O., Martínez, E., Nagata, Y., Soler, D. (2011). The mixed capacitated general routing problem with turn penalties. Expert Systems with Applications, 38 (10), 12954–12966. doi: 10.1016/j.eswa.2011.04.092
Sevaux, M., S¨orensen, K. (2008). Hamiltonian paths in large clustered routing problems. Proceed-ings of the EU/MEeting 2008 workshop on Metaheuristics for Logistics and Vehicle Routing. Troyes, France.
Battarra, M., Erdo˘gan, G., Vigo, D. (2014). The clustered vehicle routing problem. Operations Re-search, 62, 58–71.
Vidal, T., Battarra, M., Subramanian, A., Erdogˇan, G. (2015). Hybrid metaheuristics for the Clustered Vehicle Routing Problem. Computers & Operations Research, 58, 87–99. doi: 10.1016/j.cor.2014.10.019
Feed, T., Leiserson, C., Rivest, R., Stein, K. (2005). Chapter 16: Greedy algorithms. .Introduction to Algorithms (ed. 2nd). Moscow: Williams,1296.
Sanders, P., Schultes, D. (2007). Engineering Highway Hierarchies. 9th Workshop on Algorithm Engineering and Experiments, SIAM. Mehlhorn, 36–45. doi: 10.1137/1.9781611972870.4
Sharir, M. (1981). A strong connectivity algorithm and its applications to data flow analysis. Computers and Mathematics with Applications, 7 (1), 67–72. doi: 10.1016/0898-1221(81)90008-0
Tarjan, R. E. (1972). Depth-first search and linear graph algorithms. SIAM Journal on Computing, 1 (2), 146–160. doi: 10.1137/0201010
Gabow, H. N. (2000). Path-based depth-first search for strong and biconnected components. Information Processing Letters, 74 (3-4), 107–114. doi: 10.1016/s0020-0190(00)00051-x
Downloads
Published
Issue
Section
License
Copyright (c) 2015 Іван Михайлович Найдьонов
This work is licensed under a Creative Commons Attribution 4.0 International License.
Our journal abides by the Creative Commons CC BY copyright rights and permissions for open access journals.
Authors, who are published in this journal, agree to the following conditions:
1. The authors reserve the right to authorship of the work and pass the first publication right of this work to the journal under the terms of a Creative Commons CC BY, which allows others to freely distribute the published research with the obligatory reference to the authors of the original work and the first publication of the work in this journal.
2. The authors have the right to conclude separate supplement agreements that relate to non-exclusive work distribution in the form in which it has been published by the journal (for example, to upload the work to the online storage of the journal or publish it as part of a monograph), provided that the reference to the first publication of the work in this journal is included.
