Capacitated arc routing problem with deadheading demands

DOI10.1016/J.COR.2011.12.008zbMath1251.90053OpenAlexW1997610733WikidataQ59317585 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

zbMATH Keywords

mathematical modelcapacitated arc routing problemconstructive heuristicdeadheading edge demandspost-optimization procedure

Mathematics Subject Classification ID

Integer programming (90C10) Transportation, logistics and supply chain management (90B06)

Related Items (5)

A generalized constructive algorithm using insertion-based heuristics ⋮ A strategic oscillation simheuristic for the time capacitated arc routing problem with stochastic demands ⋮ Solving the time capacitated arc routing problem under fuzzy and stochastic travel and service times ⋮ Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics ⋮ An updated annotated bibliography on arc routing problems

Uses Software

• CPLEX
• Blossom V

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

This page was built for publication: Capacitated arc routing problem with deadheading demands