Arc routing problems: A review of the past, present, and future
From MaRDI portal
Publication:6087068
DOI10.1002/net.21965OpenAlexW3040363661WikidataQ114018608 ScholiaQ114018608MaRDI QIDQ6087068
Geir Hasle, Isaac Plana, Richard W. Eglese, José María Sanchis, Angel Corberán
Publication date: 11 December 2023
Published in: Networks (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10251/185758
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)
Related Items
Polyhedral analysis and a new algorithm for the length constrained \(K\)-drones rural postman problem, The single robot line coverage problem: Theory, algorithms, and experiments
Cites Work
- A survey of recent research on location-routing problems
- New results for the directed profitable rural postman problem
- An approach to the asymmetric multi-depot capacitated arc routing problem
- 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
- The synchronized arc and node routing problem: application to road marking
- Location-arc routing problem: heuristic approaches and test instances
- The time-dependent prize-collecting arc routing problem
- Plowing with precedence: a variant of the windy postman problem
- A branch-and-cut algorithm for the orienteering arc routing problem
- On the collaboration uncapacitated arc routing problem
- Location arc routing problem with inventory constraints
- Evolutionary computation for dynamic optimization problems
- Modeling and solving the mixed capacitated general routing 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
- Reoptimizing the rural postman problem
- A multi-population cooperative coevolutionary algorithm for multi-objective capacitated arc routing problem
- Local search for the undirected capacitated arc routing problem with profits
- Uncertain multi-objective Chinese postman problem
- 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
- Location-routing: issues, models and methods
- Arc routing problems with time-dependent service costs
- 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
- Exploiting sparsity in pricing routines for the capacitated arc routing problem
- A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands
- The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem
- The rural postman problem with deadline classes
- Routeing winter gritting vehicles
- Districting for salt spreading operations
- A branch-and-bound algorithm for the time-dependent rural postman problem
- Visual attractiveness in routing problems: a review
- A hybrid heuristic procedure for the windy rural postman problem with zigzag time windows
- A novel discretization scheme for the close enough traveling salesman problem
- The generalized arc routing problem
- Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
- The periodic rural postman problem with irregular services on mixed graphs
- Efficient metaheuristics for the mixed team orienteering problem with time windows
- The windy rural postman problem with a time-dependent zigzag option
- 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
- An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem
- Synchronized arc routing for snow plowing operations
- Recent advances in memetic algorithms.
- Vehicle dispatching with time-dependent travel times
- Time-constrained Chinese postman problems
- The periodic capacitated arc routing problem with irregular services
- A matheuristic for the distance-constrained close-enough arc routing problem
- Workload equity in vehicle routing: the impact of alternative workload resources
- On the distance-constrained close enough arc routing problem
- City-courier routing and scheduling problems
- Lower and upper bounds for location-arc routing problems with vehicle capacity constraints
- A guided local search procedure for the multi-compartment capacitated arc routing problem
- A districting-based heuristic for the coordinated capacitated arc routing problem
- OAR lib: an open source arc routing library
- A time-dependent hierarchical Chinese postman problem
- Profitable mixed capacitated arc routing and related problems
- Optimization and decision science: methodologies and applications. ODS, Sorrento, Italy, September 4--7, 2017
- Multi-depot rural postman problems
- OR/MS research in disaster operations management
- Solution of real-world postman problems
- A constraint programming approach to the Chinese postman problem with time windows
- A genetic algorithm for a bi-objective capacitated arc routing problem
- A road timetable\(^{\text{TM}}\) to aid vehicle routing and scheduling
- The directed profitable location rural postman problem
- A survey of models and algorithms for winter road maintenance. I: System design for spreading and plowing
- A survey of models and algorithms for winter road maintenance. II: System design for snow disposal
- Solving capacitated arc routing problems using a transformation to the CVRP
- An artificial bee colony approach for the undirected capacitated arc routing problem with profits
- The mixed capacitated general routing problem under uncertainty
- The commodity-split multi-compartment capacitated arc routing problem
- The capacitated arc routing problem with intermediate facilities
- On crossings, the Crossing Postman Problem, and the Rural Postman Problem
- Solving the close-enough arc routing problem
- A Branch-and-Price Algorithm for Capacitated Arc Routing Problem with Flexible Time Windows
- An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem
- A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem
- Recent results on Arc Routing Problems: An annotated bibliography
- An Integer Programming Approach for the Rural Postman Problem with Time Dependent Travel Times
- Heuristic Approaches for a TSP Variant: The Automatic Meter Reading Shortest Tour Problem
- Leonhard Euler: A brief appreciation
- The bridges of Königsberg—A historical perspective
- Advances in Meter Reading: Heuristic Solution of the Close Enough Traveling Salesman Problem over a Street Network
- A heuristic method for the capacitated arc routing problem with refill points and multiple loads
- An Evolutionary Algorithm with Distance Measure for the Split Delivery Capacitated Arc Routing Problem
- The Chinese Postman Problem for Mixed Networks
- Capacitated arc routing problems
- On the complexity of edge traversing
- On general routing problems
- A fundamental problem in vehicle routing
- Approximation Algorithms for Some Postman Problems
- The Covering Tour Problem
- Split-delivery routeing heuristics in livestock feed distribution
- The stochastic close-enough arc routing problem
- The rescheduling arc routing problem
- Matching, Euler tours and the Chinese postman
- Networks and vehicle routing for municipal waste collection
- An optimal algorithm for the mixed Chinese postman problem
- Arc Routing
- Paths, Trees, and Flowers
- Coordinated road-network search route planning by a team of UAVs
- A variable neighborhood descent algorithm for a real waste collection problem with mobile depots
- 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