A deterministic tabu search algorithm for the capacitated arc routing problem
From MaRDI portal
Publication:941537
DOI10.1016/j.cor.2006.07.007zbMath1179.90031OpenAlexW2101314043MaRDI QIDQ941537
José Brandão, Richard W. Eglese
Publication date: 1 September 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://eprints.lancs.ac.uk/id/eprint/45077/1/10.pdf
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
New large-scale data instances for CARP and new variations of CARP, Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition, An efficiency-based path-scanning heuristic for the capacitated arc routing problem, A hybrid metaheuristic approach for the capacitated arc routing problem, Improved bounds for large scale capacitated arc routing problem, GRASP with evolutionary path-relinking for the capacitated arc routing problem, Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities, Memetic algorithm based on extension step and statistical filtering for large-scale capacitated arc routing problems, On approximate data reduction for the Rural Postman Problem: Theory and experiments, Effects of update frequencies in a dynamic capacitated arc routing problem, Two phased hybrid local search for the periodic capacitated arc routing problem, An Open-Source Desktop Application for Generating Arc-Routing Benchmark Instances, Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics, Crossover iterated local search for SDCARP, A multi-population cooperative coevolutionary algorithm for multi-objective capacitated arc routing problem, A Decade of Capacitated Arc Routing, A variable neighborhood search for the capacitated arc routing problem with intermediate facilities, Combinatorial optimization and green logistics, Iterated local search and column generation to solve arc-routing as a permutation set-covering problem, An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem, Capacitated arc routing problem with deadheading demands, Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows, A guided local search procedure for the multi-compartment capacitated arc routing problem, The open capacitated arc routing problem, Recent results on Arc Routing Problems: An annotated bibliography, Exploiting sparsity in pricing routines for the capacitated arc routing problem, Tour splitting algorithms for vehicle routing problems, Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Competitive memetic algorithms for arc routing problems
- Approximate solutions for the capacitated arc routing problem
- Routeing winter gritting vehicles
- Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees
- Evolutionary algorithms for periodic arc routing problems
- A cutting plane algorithm for the capacitated arc routing problem
- A guided local search heuristic for the capacitated arc routing problem
- Algorithms for the rural postman problem
- Augment-insert algorithms for the capacitated arc routing problem
- Solving capacitated arc routing problems using a transformation to the CVRP
- Exact methods based on node-routing formulations for undirected arc-routing problems
- Capacitated arc routing problems
- The Capacitated Arc Routing Problem: Lower bounds
- On general routing problems
- Approximation Algorithms for Some Postman Problems
- A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
- A Tabu Search Heuristic for the Capacitated arc Routing Problem
- Matching, Euler tours and the Chinese postman
