Competitive Memetic Algorithms for Arc Routing Problems

Abstract

Competitive memetic algorithms for arc routing problems -P. Lacomme et al. RR LOSI-2001-01 -Page 1 Competitive Memetic Algorithms for Arc Routing ProblemsPhilippe LACOMME AbstractThe Capacitated Arc Routing Problem or CARP arises in applications like waste collection or winter gritting. Metaheuristics are tools of choice for solving large instances of this NP-hard problem. The paper presents basic components that can be combined into powerful memetic algorithms (MAs) for solving an extended version of the CARP (ECARP). The best resulting MA outperforms all known heuristics on three sets of benchmark files containing in total 81 instances with up to 140 nodes and 190 edges. In particular, one open instance is broken by reaching a tight lower bound designed by Belenguer and Benavent, 26 best-known solutions are improved, and all other best-known solutions are retrieved.Keywords: Capacitated Arc Routing Problem, CARP, metaheuristic, memetic algorithm.Competitive memetic algorithms for arc routing problems -P. Lacomme et al.

Capacitated arc routing problem in uncertain environments

“…The above operations are repeated until the vehicle finishes the sequence and returns to v 0 . In addition to the vertex representation scheme, there are other representation schemes for CARP solutions proposed, such as the explicit task representation scheme [15] and the implicit task representation scheme [16]. When using the explicit task representation scheme, a solution is represented by a set of task sequences {R 1 , ..., R m }.…”

Combinatorial optimization and Green Logistics

“…Available metaheuristics include tabu search algorithms (Eglese and Li 1996;Hertz et al 2000) and a tabu search combined with scatter search components (Greistorfer 2003), a variable neighborhood search (Hertz et al 2001), a guided local search (Beullens et al 2003), and hybrid genetic algorithms (Moscato 1999;Dellaert and Jeunet 2000). More recently Lacomme et al (2004) have produced a memetic algorithm and Brandão and Eglese (2006) have proposed a deterministic tabu search algorithm.…”

A Decade of Capacitated Arc Routing

“…Lacomme et al presented a Genetic Algorithm in 2001, [71], and a Memetic Algorithm in 2004, [74]. In both algorithms crossover is performed on a giant tour, and fitness of a chromosome is based on the partitioning of the tour into vehicle tours.…”

“…Furthermore, the Memetic Algorithm by Lacomme et al, [74], is adapted to the MCARP. Finally, the authors give a supersparse LP formulation of the MCARP, which is used in a Cutting Plane algorithm to obtain strong lower bounds for the problem.…”

“…In [47], Fleury et al present a Memetic Algorithm for the SCARP, which is an extension of the algorithm suggested by Lacomme et al in [74]. The results obtained are compared to the results generated by algorithms for the classical CARP based on the average demand.…”