Abstract
Capacitated Arc Routing Problem (CARP) is one of the hot issues of logistics research. Specifically, Ranking First Cutting Second (RFCS) could be used. This research proposed a novel partitioning algorithm - the Multi-Label algorithm which obtained better TSP paths meeting the backpack limit on the basis of a complete TSP return. In addition, by experimental verification on questions in the standard question database, the experimental results showed that compared with general partitioning algorithms, for the same complete TSP return, many TSP paths with the shortest total length could be obtained by the Multi-Label algorithm.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Dantzig, G., Ramser, J.: The truck dispatching problem. Management Science 6, 80–91 (1959)
Christofides, N.: The optimum traversal of a graph. Omega 1(6), 719–732 (1973)
Gloden, B.L., Wong, R.T.: The truck dispatching problem. Networks 6, 11 (1981)
Hirabayashi, R., Saruwatari, Y., Nishida, N.: Tour construction algorithm for the capacitated arc routing problem. Operations Research 1(48), 129–135 (2000)
Liu, M., Singh, H.K., Ray, T.: Application specific instance generator and a memetic algorithm for capacitated arc routing problems. Transportation Research Part C 43, 249–266 (2014)
Brandão, J., Eglese, R.: A deterministic tabu search algorithm for the capacitated arc routing problem. Computers & Operations Research 35, 1112–1126 (2008)
Christofides, N.: Computational experiments with algorithms for a class of routing problems. Computers and Operations Research 1(10), 47–59 (1983)
Santos, L., Coutinho-Rodrigues, J., Current, J.R.: An improved ant colony optimization based algorithm for the capacitated arc routing problem. Transportation Research Part B 44, 246–266 (2010)
Chen, S., Golden, B., Wong, R., Zhong, H.: Arc-Routing Models for Small-Package Local Routing. Transportation Science 1(43), 43–55 (2009)
Bode, C., Irnich, S.: Arc-routing Models For Small-package Local Routing. Operations Research 5(60), 1167–1182 (2012)
Hertz, A.: Recent trends in arc routing. Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications 1, 215–236 (2005)
Prins*, C., Labadi, N., Reghioui, M.: Tour splitting algorithms for vehicle routing problems. International Journal of Production Research 2(47), 507–535 (2009)
Bin, Y., Zhong-Zhen, Y., Baozhen, Y.: An improved ant colony optimization for vehicle routing problem. International Journal of Production Research 196, 171–176 (2009)
Xiang-yang, L.: Genetic algorithm for VRP. International Journal of Production Research 2(25)
Polacek, M., Doerner, K.E., Hartl, R.F., Maniezzo, V.: A variable neighborhood search for the capacitated arc routing problem with intermediate facilities. Journal of Heuristics 14(5), 405–423 (2008)
Laporte, G., Musmanno, R., Vocaturo, E.: An Adaptive Large Neighbourhood Search Heuristic for the Capacitated Arc-Routing Problem with Stochastic Demands. Transportafion Science 160(1), 139–153 (2009)
Huang, S.-H., Lin, T.-H.: Using An t Colony Optimization to solve Periodic Arc Routing Problem with Refill Points. Journal of Industrial and Production Engineering 31(7), 441–451 (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Zhang, W., Xing, L., Xi, T., He, L., Liu, J. (2015). A Partitioning Algorithm for Solving Capacitated Arc Routing Problem in Ways of Ranking First Cutting Second. In: Zhang, S., Wirsing, M., Zhang, Z. (eds) Knowledge Science, Engineering and Management. KSEM 2015. Lecture Notes in Computer Science(), vol 9403. Springer, Cham. https://doi.org/10.1007/978-3-319-25159-2_67
Download citation
DOI: https://doi.org/10.1007/978-3-319-25159-2_67
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-25158-5
Online ISBN: 978-3-319-25159-2
eBook Packages: Computer ScienceComputer Science (R0)