Capacitated arc routing problem with deadheading demands
From MaRDI portal
Publication:1761173
DOI10.1016/j.cor.2011.12.008zbMath1251.90053WikidataQ59317585 ScholiaQ59317585MaRDI QIDQ1761173
Gokhan Kirlik, Aydin Sipahioglu
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.12.008
mathematical model; capacitated arc routing problem; constructive heuristic; deadheading edge demands; post-optimization procedure
Related Items
A generalized constructive algorithm using insertion-based heuristics, Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Competitive memetic algorithms for arc routing problems
- Blossom V: A new implementation of a minimum cost perfect matching algorithm
- A deterministic tabu search algorithm for the capacitated arc routing problem
- A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
- Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions
- The fleet size and mix problem for capacitated arc routing
- Routeing winter gritting vehicles
- Approximation algorithms for lawn mowing and milling
- A cutting plane algorithm for the capacitated arc routing problem
- Coverage for robotics -- a survey of recent results
- A Decade of Capacitated Arc Routing
- Capacitated arc routing problems
- On general routing problems
- Approximation Algorithms for Some Postman Problems
- Improvement Procedures for the Undirected Rural Postman Problem
- Handbook of Graph Theory
- Matching, Euler tours and the Chinese postman
- Arc Routing Problems, Part I: The Chinese Postman Problem
- Arc Routing Problems, Part II: The Rural Postman Problem
