A Partitioning Algorithm for Solving Capacitated Arc Routing Problem in Ways of Ranking First Cutting Second

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.

[1]  George B. Dantzig,et al.  The Truck Dispatching Problem , 1959 .

[2]  Nicos Christofides.  The optimum traversal of a graph , 1973 .

[3]  Bruce L. Golden,et al.  Computational experiments with algorithms for a class of routing problems , 1983, Comput. Oper. Res..

[4]  Li Xiang-yang.  Genetic algorithm for VRP , 2004 .

[5]  Alain Hertz,et al.  Recent Trends in Arc Routing , 2005 .

[6]  Richard F. Hartl,et al.  A variable neighborhood search for the capacitated arc routing problem with intermediate facilities , 2008, J. Heuristics.

[7]  Richard W. Eglese,et al.  A deterministic tabu search algorithm for the capacitated arc routing problem , 2008, Comput. Oper. Res..

[8]  N. Labadi,et al.  Tour splitting algorithms for vehicle routing problems , 2009 .

[9]  Baozhen Yao,et al.  Production , Manufacturing and Logistics An improved ant colony optimization for vehicle routing problem , 2008 .

[10]  Si Chen,et al.  Arc-Routing Models for Small-Package Local Routing , 2009, Transp. Sci..

[11]  Roberto Musmanno,et al.  An Adaptive Large Neighbourhood Search Heuristic for the Capacitated Arc-Routing Problem with Stochastic Demands , 2010, Transp. Sci..

[12]  John R. Current,et al.  An improved ant colony optimization based algorithm for the capacitated arc routing problem , 2010 .

[13]  Stefan Irnich,et al.  Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem , 2012, Oper. Res..

[14]  Tapabrata Ray,et al.  Application specific instance generator and a memetic algorithm for capacitated arc routing problems , 2014 .

[15]  Shan-Huen Huang,et al.  Using Ant Colony Optimization to solve Periodic Arc Routing Problem with Refill Points , 2014 .