Capacitated arc routing problem with deadheading demands

DOI10.1016/J.COR.2011.12.008MaRDI QIDQ1761173zbMATH OpenOpenAlexWikidataFDO

Authors 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

capacitated arc routing problemconstructive heuristicdeadheading edge demandsmathematical modelpost-optimization procedure

Mathematics Subject Classification ID

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

Recommendations

• An exact algorithm for the capacitated arc routing problem with deadheading demand
• An improved heuristic for the capacitated arc routing problem
• Approximate solutions for the capacitated arc routing problem
• Augment-insert algorithms for the capacitated arc routing problem
• A decade of capacitated arc routing

Cites work

• A cutting plane algorithm for the capacitated arc routing problem
• A decade of capacitated arc routing
• 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
• Approximation algorithms for lawn mowing and milling
• Approximation Algorithms for Some Postman Problems
• Arc Routing Problems, Part I: The Chinese Postman Problem
• Arc Routing Problems, Part II: The Rural Postman Problem
• Blossom V: A new implementation of a minimum cost perfect matching algorithm
• Capacitated arc routing problems
• Competitive memetic algorithms for arc routing problems
• Coverage for robotics -- a survey of recent results
• Handbook of Graph Theory
• scientific article; zbMATH DE number 1568943 (Why is no real title available?)
• scientific article; zbMATH DE number 956790 (Why is no real title available?)
• Improvement Procedures for the Undirected Rural Postman Problem
• Matching, Euler tours and the Chinese postman
• Network flows. Theory, algorithms, and applications.
• On general routing problems
• Recent trends in arc routing
• Routeing winter gritting vehicles
• The fleet size and mix problem for capacitated arc routing

Cited in

(6)

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

Describes a project that uses

Uses Software

• Blossom V
• CPLEX

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1761173)