An updated annotated bibliography on arc routing problems
From MaRDI portal
Publication:6496350
DOI10.1002/NET.21762MaRDI QIDQ6496350
Maria Cândida Mourão, Leonor Santiago Pinto
Publication date: 3 May 2024
Published in: Networks (Search for Journal in Brave)
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (2)
Polyhedral analysis and a new algorithm for the length constrained \(K\)-drones rural postman problem ⋮ An Open-Source Desktop Application for Generating Arc-Routing Benchmark Instances
Cites Work
- Efficient Algorithms for Eulerian Extension and Rural Postman
- An Exact Algorithm for the Capacitated Arc Routing Problem with Deadheading Demand
- New large-scale data instances for CARP and new variations of CARP
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On games arising from multi-depot Chinese postman problems
- A survey of recent research on location-routing problems
- The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem
- New results for the directed profitable rural postman problem
- Approximation algorithms for solving the constrained arc routing problem in mixed graphs
- Rural postman parameterized by the number of components of required edges
- Two-phase branch-and-cut for the mixed capacitated general routing problem
- An approach to the asymmetric multi-depot capacitated arc routing problem
- The mixed capacitated arc routing problem with non-overlapping routes
- A matheuristic for the team orienteering arc routing problem
- A branch-and-cut algorithm for the profitable windy rural postman problem
- The bi-objective mixed capacitated general routing problem with different route balance criteria
- A hybrid metaheuristic approach for the capacitated arc routing problem
- Local search heuristics for sectoring routing in a household waste collection context
- Orienteering problem: a survey of recent variants, solution approaches and applications
- The synchronized arc and node routing problem: application to road marking
- Improved bounds for large scale capacitated arc routing problem
- GRASP with evolutionary path-relinking for the capacitated arc routing problem
- Location-arc routing problem: heuristic approaches and test instances
- Solution methodologies for debris removal in disaster response
- The time-dependent prize-collecting arc routing problem
- A lower bound for the node, edge, and arc routing problem
- Plowing with precedence: a variant of the windy postman problem
- Parameterized complexity of the \(k\)-arc Chinese postman problem
- A branch-and-cut algorithm for the orienteering arc routing problem
- On the collaboration uncapacitated arc routing problem
- Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities
- Location arc routing problem with inventory constraints
- GIS technology as an environment for testing an advanced mathematical model for optimization of road maintenance
- Modeling and solving the mixed capacitated general routing problem
- The hierarchical traveling salesman problem
- A branch-and-cut algorithm for the maximum benefit Chinese postman problem
- An ILP-refined tabu search for the directed profitable rural postman problem
- The capacitated general windy routing problem with turn penalties
- The \(k\)-centrum Chinese postman delivery problem and a related cost allocation game
- Reoptimizing the rural postman problem
- A multi-population cooperative coevolutionary algorithm for multi-objective capacitated arc routing problem
- Chinese postman problem on edge-colored multigraphs
- Local search for the undirected capacitated arc routing problem with profits
- The orienteering problem: a survey
- The open capacitated arc routing problem
- Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions
- The undirected capacitated arc routing problem with profits
- Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows
- A metaheuristic for the min-max windy rural postman problem with K vehicles
- Lower bounds for the mixed capacitated arc routing problem
- Heuristics for the stochastic Eulerian tour problem
- Heuristics for the rural postman problem
- Multi-vehicle prize collecting arc routing for connectivity problem
- The generalized arc routing problem
- Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
- Efficient metaheuristics for the mixed team orienteering problem with time windows
- The windy rural postman problem with a time-dependent zigzag option
- Iterated local search and column generation to solve arc-routing as a permutation set-covering problem
- The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm
- Multi-vehicle synchronized arc routing problem to restore post-disaster network connectivity
- The undirected capacitated general routing problem with profits
- Solving the team orienteering arc routing problem with a column generation approach
- Splitting procedures for the mixed capacitated arc routing problem under time restrictions with intermediate facilities
- An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem
- Capacitated arc routing problem with deadheading demands
- Synchronized arc routing for snow plowing operations
- Constant-factor approximations for capacitated arc routing without triangle inequality
- A new view on rural postman based on Eulerian extension and matching
- The periodic capacitated arc routing problem with irregular services
- Improved lower bounds and exact algorithm for the capacitated arc routing problem
- City-courier routing and scheduling problems
- Lower and upper bounds for location-arc routing problems with vehicle capacity constraints
- Approximating the length of Chinese postman tours
- A guided local search procedure for the multi-compartment capacitated arc routing problem
- A compact transformation of arc routing problems into node routing problems
- Profitable mixed capacitated arc routing and related problems
- An integer programming approach for the Chinese postman problem with time-dependent travel time
- Sharp bounds for the Chinese postman problem in 3-regular graphs and multigraphs
- New results on the windy postman problem
- Parameterized complexity of Eulerian deletion problems
- A survey on matheuristics for routing problems
- The directed profitable location rural postman problem
- An artificial bee colony approach for the undirected capacitated arc routing problem with profits
- The mixed capacitated general routing problem under uncertainty
- A branch-price-and-cut algorithm for the min-maxk-vehicle windy rural postman problem
- Solving the close-enough arc routing problem
- A novel model for arc territory design: promoting Eulerian districts
- A taxonomical analysis, current methods and objectives on location-routing problems
- The time-dependent rural postman problem: polyhedral results
- A Branch-and-Price Algorithm for Capacitated Arc Routing Problem with Flexible Time Windows
- Districting for Arc Routing
- Recent results on Arc Routing Problems: An annotated bibliography
- Efficient Algorithms for Eulerian Extension
- Parameterized Complexity of Eulerian Deletion Problems
- From Few Components to an Eulerian Graph by Adding Arcs
- A New View on Rural Postman Based on Eulerian Extension and Matching
- New facets and an enhanced branch-and-cut for the min-max K -vehicles windy rural postman problem
- A heuristic method for the capacitated arc routing problem with refill points and multiple loads
- The stochastic close-enough arc routing problem
- The rescheduling arc routing problem
- The stacker crane problem and the directed general routing problem
- Security routing games with multivehicle Chinese postman problem
- Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem
- Arc Routing
This page was built for publication: An updated annotated bibliography on arc routing problems