A Tabu Search Heuristic for the Capacitated arc Routing Problem

Hertz, Alain; Laporte, Gilbert; Mittaz, Michel

doi:10.1287/opre.48.1.129.12455

Cited by 219 publications

(124 citation statements)

References 18 publications

Supporting

Mentioning

124

Contrasting

Order By: Relevance

“…Among fast constructive methods, there are for instance Augment-Merge (Golden and Wong 1981), Path-Scanning (Golden et al 1983 andUlusoy's splitting technique Ulusoy 1985). 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.…”

Section: Arc Routing Problemsmentioning

confidence: 99%

Combinatorial optimization and Green Logistics

Sbihi¹,

Eglese²

2009

Ann Oper Res

222

106

View full text Add to dashboard Cite

show abstract

Section: Arc Routing Problemsmentioning

confidence: 99%

Combinatorial optimization and Green Logistics

Sbihi¹,

Eglese²

2009

Ann Oper Res

222

106

View full text Add to dashboard Cite

show abstract

“…Several heuristics have been proposed for it. Among them we can cite Golden et al [4], Chapleau et al [9], Ulusoy [27], Pearn [23,24] and Hertz et al [15]. Many other heuristics are described in [2] [12] and [11].…”

Section: Introductionmentioning

confidence: 99%

Solving capacitated arc routing problems using a transformation to the CVRP

Longo

Aragão

Uchôa

2006

Computers & Operations Research

136

View full text Add to dashboard Cite

A well known transformation by Pearn, Assad and Golden reduces a Capacitated Arc Routing Problem (CARP) into an equivalent Capacitated Vehicle Routing Problem (CVRP). However, that transformation is regarded as unpractical, since an original instance with r required edges is turned into a CVRP over a complete graph with 3r + 1 vertices. We propose a similar transformation that reduces this graph to 2r + 1 vertices, with the additional restriction that r edges are already fixed to 1. Using a recent branch-and-cut-and-price algorithm for the CVRP, we observed that it yields an effective way of attacking the CARP, being significantly better than the exact methods created specifically for that problem. Computational experiments obtained improved lower bounds for almost all open instances from the literature. Several such instances could be solved to optimality.Keywords: CARP, CVRP, Routing, Mixed-Integer Programming. ResumoO problema de roteamento de veículos em um grafo com demandas nas arestas (CARP -Capacitated Arc Routing Problem) pode ser transformado em um problema equivalente de roteamento com as demandas nos vértices (CVRP -Capacitated Vehicle Routing Problem), usando-se a transformação proposta por Pearn, Assad e Golden. Contudo, a utilização dessa transformaçãoé praticamente inviável, uma vez que uma instância do CARP com r arestas com demandasé transformada em um CVRP com 3r + 1 vértices. Nós propomos uma transformação similar que reduz esse grafo a 2r + 1 vértices, com a restrição adicional de que r arestas são previamente fixadas em 1. Usando-se um algoritmo recente de branch-and-cut-and-price para o CVRP, essa nova transformação mostrou-se eficaz na resolução do CARP, sendo significativamente melhor do que os métodos exatos criados especificamente para esse problema. As experiências computacionais melhoraram os limites inferiores no valor da soluçãoótima para quase todas as instâncias testadas. Muitas dessas instâncias da literatura puderam, pela primeira vez, ser resolvidas até a otimalidade.

show abstract

“…Cordeau, et al, 1997) (Hertz, et al, 2000) (Côté and Potvin, 2009) (Zachariadis, et al, 2009). Essentially, TS iteratively explores the solution space by moving from the current solution to another solution in its neighborhood.…”

Section: A Tabu Search Algorithmmentioning

confidence: 99%

Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care

Liu

Xie

Augusto

et al. 2013

European Journal of Operational Research

230

View full text Add to dashboard Cite

International audienceThis paper addresses a vehicle scheduling problem encountered in home health care logistics. It concerns the delivery of drugs and medical devices from the home care company's pharmacy to patients' homes, delivery of special drugs from a hospital to patients, pickup of bio samples and unused drugs and medical devices from patients. The problem can be considered as a special vehicle routing problem with simultaneous delivery and pickup and time windows, with four types of demands: delivery from depot to patient, delivery from a hospital to patient, pickup from a patient to depot and pickup from a patient to a medical lab. Each patient is visited by one vehicle and each vehicle visits each node at most once. Patients are associated with time windows and vehicles with capacity. Two mixed-integer programming models are proposed. We then propose a Genetic Algorithm (GA) and a Tabu Search (TS) method. The GA is based on a permutation chromosome, a split procedure and local search. The TS is based on route assignment attributes of patients, an augmented cost function, route re-optimization, and attribute-based aspiration levels. These approaches are tested on test instances derived from existing VRPTW benchmarks

show abstract

A Tabu Search Heuristic for the Capacitated arc Routing Problem

Cited by 219 publications

References 18 publications

Combinatorial optimization and Green Logistics

Combinatorial optimization and Green Logistics

Solving capacitated arc routing problems using a transformation to the CVRP

Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care

Contact Info

Product

Resources

About