A Decade of Capacitated Arc Routing
From MaRDI portal
Publication:3564348
DOI10.1007/978-0-387-77778-8_2zbMath1187.90064OpenAlexW2103516725MaRDI QIDQ3564348
Publication date: 2 June 2010
Published in: Operations Research/Computer Science Interfaces (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-0-387-77778-8_2
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)
Related Items (21)
The mixed capacitated arc routing problem with non-overlapping routes ⋮ Local search heuristics for sectoring routing in a household waste collection context ⋮ GRASP with evolutionary path-relinking for the capacitated arc routing problem ⋮ Location-arc routing problem: heuristic approaches and test instances ⋮ A strategic oscillation simheuristic for the time capacitated arc routing problem with stochastic demands ⋮ Improved lower bounds and exact algorithm for the capacitated arc routing problem ⋮ 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 ⋮ A Decade of Capacitated Arc Routing ⋮ Iterated local search and column generation to solve arc-routing as a permutation set-covering problem ⋮ Branch-price-and-cut for the mixed capacitated general routing problem with time windows ⋮ Collaborative vehicle routing: a survey ⋮ An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem ⋮ Capacitated arc routing problem with deadheading demands ⋮ A guided local search procedure for the multi-compartment capacitated arc routing problem ⋮ The open capacitated arc routing problem ⋮ Constant-factor approximations for capacitated arc routing without triangle inequality ⋮ Part logistics in the automotive industry: decision problems, literature review and research agenda ⋮ Lower bounds for the mixed capacitated arc routing problem ⋮ A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands ⋮ On games arising from multi-depot Chinese postman problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Competitive memetic algorithms for arc routing problems
- A survey of models and algorithms for winter road maintenance. III: Vehicle routing and depot location for spreading
- A survey of models and algorithms for winter road maintenance. IV: Vehicle routing and fleet sizing for plowing and snow disposal
- Using mixed integer programming for solving the capacitated arc routing problem with vehicle/site dependencies with an application to the routing of residential sanitation collection vehicles
- Arc routing problems with time-dependent service costs
- A deterministic tabu search algorithm for the capacitated arc routing problem
- Exploiting sparsity in pricing routines for the capacitated arc routing problem
- The fleet size and mix problem for capacitated arc routing
- An approximation algorithm for the general routing problem
- The rural postman problem with deadline classes
- A decision support system for urban waste management
- Routeing winter gritting vehicles
- The capacitated arc routing problem: Valid inequalities and facets
- A linear programming model for the separate refuse collection service.
- Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees
- Districting for salt spreading operations
- Evolutionary algorithms for periodic arc routing problems
- Transforming arc routing into node routing problems
- A cutting plane algorithm for the capacitated arc routing problem
- A guided local search heuristic for the capacitated arc routing problem
- Heuristic method for a mixed capacitated arc routing problem: A refuse collection application
- Lower-bounding and heuristic methods for a refuse collection vehicle routing problem
- Graph theory, combinatorics and algorithms. Interdisciplinary applications
- Lower and upper bounds for the mixed capacitated arc routing problem
- A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem
- Privatized rural postman problems
- New lower bound for the capacitated arc routing problem
- A genetic algorithm for a bi-objective capacitated arc routing problem
- Road network monitoring: algorithms and a case study
- A scatter search for the periodic capacitated arc routing problem
- Arc routing in a node routing environment
- Solving capacitated arc routing problems using a transformation to the CVRP
- The capacitated arc routing problem with refill points
- The capacitated arc routing problem with intermediate facilities
- Exact methods based on node-routing formulations for undirected arc-routing problems
- A Decade of Capacitated Arc Routing
- Postman tour on a graph with precedence relation on arcs
- The Chinese Postman Problem for Mixed Networks
- Capacitated arc routing problems
- NODE DUPLICATION LOWER BOUNDS FOR THE CAPACITATED ARC ROUTING PROBLEM
- The Capacitated Arc Routing Problem: Lower bounds
- On the complexity of edge traversing
- On general routing problems
- A fundamental problem in vehicle routing
- Approximation Algorithms for Some Postman Problems
- A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
- Improvement Procedures for the Undirected Rural Postman Problem
- A Tabu Search Heuristic for the Capacitated arc Routing Problem
- District design for arc-routing applications
- 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
- Improving robustness of solutions to arc routing problems
- A variable neighborhood descent algorithm for a real waste collection problem with mobile depots
- Handbook of metaheuristics
This page was built for publication: A Decade of Capacitated Arc Routing
