The capacitated arc routing problem with intermediate facilities

DOI10.1002/NET.3MaRDI QIDQ2719845zbMATH OpenOpenAlexFDO

Authors Gianpaolo Ghiani, Gennaro Improta, G. Laporte

Publication date 24 March 2002

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3

zbMATH Keywords

intermediate facilitiescapacited arc routing problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Traffic problems in operations research (90B20)

Recommendations

• Tabu search heuristics for the arc routing problem with intermediate facilities under capacity and length restrictions
• A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
• The capacitated arc routing problem with refill points
• The Capacitated Arc Routing Problem: Lower bounds
• Improved lower bounds and exact algorithm for the capacitated arc routing problem

Cites work

• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• A Tabu Search Heuristic for the Capacitated arc Routing Problem
• A branch-and-cut algorithm for the undirected rural postman problem
• A polyhedral approach to the rural postman problem
• An approximate procedure for determining the number, capacities and locations of solid waste transfer-stations in an urban region
• Arc Routing Problems, Part I: The Chinese Postman Problem
• Arc Routing Problems, Part II: The Rural Postman Problem
• Bounds for the general capacitated routing problem
• Capacitated arc routing problems
• Geometric algorithms and combinatorial optimization.
• Improvement Procedures for the Undirected Rural Postman Problem
• Odd Minimum Cut-Sets and b-Matchings
• The Capacitated Arc Routing Problem: Lower bounds
• The capacitated arc routing problem: Valid inequalities and facets

Cited in

(32)

• Splitting procedures for the mixed capacitated arc routing problem under time restrictions with intermediate facilities
• Local-ideal-points based autonomous space decomposition framework for the multi-objective periodic generalized directed rural postman problem under length restrictions with intermediate facilities
• A multi-level capacitated arc routing problem with intermediate facilities in waste collection
• New large-scale data instances for CARP and new variations of CARP
• The aircraft maintenance base location problem
• Solving vehicle routing problems with intermediate stops using VRPSolver models
• An improved multi-objective framework for the rich arc routing problem
• A decade of capacitated arc routing
• A variable neighborhood descent algorithm for a real waste collection problem with mobile depots
• Arc routing problems: A review of the past, present, and future
• The mixed capacitated arc routing problem with non-overlapping routes
• Smart selective navigator (SSN): enhancing urban winter road maintenance through optimized arc routing with hard turn restrictions
• A survey of the standard location-routing problem
• On matchings, T‐joins, and arc routing in road networks
• Graph partitioning-based matheuristic for residential waste collection problem with visual attractiveness and turn penalty
• Multi-depot periodic capacitated arc routing problem with intermediate facilities for waste collection
• A memetic algorithm for the travelling salesperson problem with hotel selection
• Lower bounds for the mixed capacitated arc routing problem
• Arc routing problems with time-dependent service costs
• Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities
• Recent results on arc routing problems: an annotated bibliography
• A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
• A fast metaheuristic for the travelling salesperson problem with hotel selection
• Tabu search heuristics for the arc routing problem with intermediate facilities under capacity and length restrictions
• Heuristic method for a mixed capacitated arc routing problem: A refuse collection application
• The capacitated arc routing problem: Valid inequalities and facets
• A branch-and-cut algorithm for the windy profitable location rural postman problem
• Fast upper and lower bounds for a large‐scale real‐world arc routing problem
• Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions
• The capacitated arc routing problem with refill points
• A memetic algorithm for the orienteering problem with hotel selection
• A survey of variants and extensions of the location-routing problem

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: The capacitated arc routing problem with intermediate facilities

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