The Periodic Capacitated Arc Routing Problem linear programming model, metaheuristic and lower bounds

The Periodic Capacitated Arc Routing Problem (PCARP) generalizes the well known NP-hard Capacitated Arc Routing Problem (CARP) by extending the single period to multi-period horizon. The Capacitated Arc Routing Problem (CARP) is defined on an undirected network in which a fleet of identical vehicles is based at a depot node. A subset of edges, called tasks, must be serviced by a vehicle. The CARP consists of determining a set of feasible vehicle trips that minimizes the total cost of traversed edges. The PCARP involves the assignment of tasks to periods and the determination of vehicles trips in each period, to minimize the total cost on the whole horizon. This new problem arises in various real life applications such as waste collection, mail delivery, etc. In this paper, a new linear programming model and preliminary lower bounds based on graph transformation are proposed. A meta-heuristic approach-Scatter Search (SS) is developed for the PCARP and evaluated on a large variety of instances.

[1]  Ángel Corberán,et al.  The Capacitated Arc Routing Problem: Lower bounds , 1992, Networks.

[2]  Philippe Lacomme,et al.  A Genetic Algorithm for the Capacitated Arc Routing Problem and Its Extensions , 2001, EvoWorkshops.

[3]  Nicos Christofides,et al.  The period routing problem , 1984, Networks.

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

[5]  Bruce L. Golden,et al.  Capacitated arc routing problems , 1981, Networks.

[6]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Capacitated Arc Routing Problem , 2000, Oper. Res..

[7]  Richard W. Eglese,et al.  A tabu search based heuristic for arc routing with a capacity constraint and time deadline , 1996 .

[8]  Ángel Corberán,et al.  Linear Programming Based Methods for Solving Arc Routing Problems , 2000 .

[9]  F. Glover.  HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .

[10]  Wen Lea Pearn,et al.  New lower bounds for the Capacitated Arc Routing Problem , 1988, Networks.

[11]  José-Manuel Belenguer,et al.  A cutting plane algorithm for the capacitated arc routing problem , 2003, Comput. Oper. Res..

[12]  B. Golden,et al.  The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases , 1987 .

[13]  Feng Chu,et al.  Heuristics for the periodic capacitated arc routing problem , 2005, J. Intell. Manuf..

[14]  Stefan Voß,et al.  A hierarchical relaxations lower bound for the capacitated arc routing problem , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.

[15]  Richard W. Eglese,et al.  Routeing Winter Gritting Vehicles , 1994, Discret. Appl. Math..

[16]  G. Ulusoy.  The fleet size and mix problem for capacitated arc routing , 1985 .

[17]  Feng Chu,et al.  A Scatter Search for the periodic capacitated arc routing problem , 2006, Eur. J. Oper. Res..

[18]  José-Manuel Belenguer,et al.  The Capacitated Arc Routing Problem: Valid Inequalities and Facets , 1998, Comput. Optim. Appl..