Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees
From MaRDI portal
Publication:1577774
DOI10.1016/S0377-2217(99)00170-8zbMath0967.90017WikidataQ127526486 ScholiaQ127526486MaRDI QIDQ1577774
Wolfgang Domschke, Anita Amberg, Stefan Voß
Publication date: 27 August 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items
A guided local search heuristic for the capacitated arc routing problem, A biased random-key genetic algorithm for the capacitated minimum spanning tree problem, Multi-depot rural postman problems, A heuristic algorithm for hierarchical hub-and-spoke network of time-definite common carrier operation planning problem, Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics, Crossover iterated local search for SDCARP, A deterministic tabu search algorithm for the capacitated arc routing problem, A Decade of Capacitated Arc Routing, A variable neighborhood search for the capacitated arc routing problem with intermediate facilities, A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems, A dynamic vehicle routing problem with time-dependent travel times, Recent results on Arc Routing Problems: An annotated bibliography, Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration, A scatter search for the periodic capacitated arc routing problem
Cites Work
- A note on two problems in connexion with graphs
- On the shortest spanning subtree of a graph and the traveling salesman problem
- A parallel insert method for the capacitated arc routing problem
- Approximate solutions for the capacitated arc routing problem
- The capacitated minimal spanning tree problem: An experiment with a hop-indexed model
- Augment-insert algorithms for the capacitated arc routing problem
- The complexity of the capacitated tree problem
- Capacitated arc routing problems
- Tabu Search—Part I
- Tabu Search—Part II
- On the complexity of edge traversing
- A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem
- A Tabu Search Heuristic for the Capacitated arc Routing Problem
- Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
- Matching, Euler tours and the Chinese postman
- A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
- Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
