Splitting procedures for the Mixed Capacitated Arc Routing Problem under Time restrictions with Intermediate Facilities

This paper develops optimal and quick near-optimal splitting procedures for the Mixed Capacitated Arc Routing Problem under Time restrictions with Intermediate Facilities. Splitting procedures are a key component of giant tour-based solution methods for Arc Routing Problems. The optimal and near-optimal splitting procedures are tested within a multi-start constructive heuristic, and a fixed execution-time limit is imposed. Results on benchmark instances show that the constructive-heuristic linked with the new optimal splitting algorithm performs better than the near-optimal versions.

[1]  Johan W. Joubert,et al.  Constructive heuristics for the Mixed Capacity Arc Routing Problem under Time Restrictions with Intermediate Facilities , 2016, Comput. Oper. Res..

[2]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[3]  Philippe Lacomme,et al.  Competitive Memetic Algorithms for Arc Routing Problems , 2004, Ann. Oper. Res..

[4]  Zhibin Jiang,et al.  A memetic algorithm with iterated local search for the capacitated arc routing problem , 2013 .

[5]  Michel Gendreau,et al.  ARC ROUTING PROBLEMS. , 1994 .

[6]  Gilbert Laporte,et al.  Arc Routing: Problems, Methods, and Applications , 2015 .

[7]  Roberto Musmanno,et al.  Tabu Search Heuristics for the Arc Routing Problem with Intermediate Facilities under Capacity and Length Restrictions , 2004, J. Math. Model. Algorithms.

[8]  José-Manuel Belenguer,et al.  Lower and upper bounds for the mixed capacitated arc routing problem , 2006, Comput. Oper. Res..

[9]  Philippe Lacomme,et al.  Order-first split-second methods for vehicle routing problems: A review , 2014 .

[10]  John E. Beasley,et al.  Route first--Cluster second methods for vehicle routing , 1983 .

[11]  Ángel Corberán,et al.  Recent results on Arc Routing Problems: An annotated bibliography , 2010, Networks.

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

[13]  Johan W. Joubert,et al.  Benchmark dataset for undirected and Mixed Capacitated Arc Routing Problems under Time restrictions with Intermediate Facilities , 2016, Data in brief.

[14]  Gilbert Laporte,et al.  The capacitated arc routing problem with intermediate facilities , 2001, Networks.

[15]  Xin Yao,et al.  Memetic Algorithm With Extended Neighborhood Search for Capacitated Arc Routing Problems , 2009, IEEE Transactions on Evolutionary Computation.