Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics
From MaRDI portal
Publication:1730649
DOI10.1007/S10479-018-2777-3zbMath1411.90342OpenAlexW2790740531MaRDI QIDQ1730649
Seán McGarraghy, Angel A. Juan, Jesica De Armas, Peter B. Keenan
Publication date: 6 March 2019
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-018-2777-3
metaheuristicssimulated annealingcapacitated arc routing problembiased randomisationtime-based capacities
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (8)
A biased-randomized discrete-event heuristic for coordinated multi-vehicle container transport across interconnected networks ⋮ A strategic oscillation simheuristic for the time capacitated arc routing problem with stochastic demands ⋮ A review of the role of heuristics in stochastic optimisation: from metaheuristics to learnheuristics ⋮ Program trace optimization with constructive heuristics for combinatorial problems ⋮ A novel model for sustainable waste collection arc routing problem: Pareto-based algorithms ⋮ A two-stage decision-support approach for improving sustainable last-mile cold chain logistics operations of COVID-19 vaccines ⋮ Solving the time capacitated arc routing problem under fuzzy and stochastic travel and service times ⋮ The location routing problem using electric vehicles with constrained distance
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- A hybrid metaheuristic approach for the capacitated arc routing problem
- GRASP with evolutionary path-relinking for the capacitated arc routing problem
- Using parallel \& distributed computing for real-time solving of vehicle routing problems with stochastic demands
- Competitive memetic algorithms for arc routing problems
- The vehicle routing problem. Latest advances and new challenges.
- A deterministic tabu search algorithm for the capacitated arc routing problem
- 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 new algorithm for the directed Chinese postman problem
- Approximate solutions for the capacitated arc routing problem
- Routeing winter gritting vehicles
- Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees
- Capacitated arc routing problem with deadheading demands
- 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
- MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems
- Augment-insert algorithms for the capacitated arc routing problem
- Solution of real-world postman problems
- A constraint programming approach to the Chinese postman problem with time windows
- New lower bound for the capacitated arc routing problem
- Road network monitoring: algorithms and a case study
- Solving capacitated arc routing problems using a transformation to the CVRP
- Recent results on Arc Routing Problems: An annotated bibliography
- An Approximation Algorithm for the Capacitated Arc Routing Problem
- Exact methods based on node-routing formulations for undirected arc-routing problems
- A Decade of Capacitated Arc Routing
- New lower bounds for the Capacitated Arc Routing Problem
- NODE DUPLICATION LOWER BOUNDS FOR THE CAPACITATED ARC ROUTING PROBLEM
- The Capacitated Arc Routing Problem: Lower bounds
- A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
- A comparison of simulated annealing cooling strategies
- A Tabu Search Heuristic for the Capacitated arc Routing Problem
- Network service scheduling and routing
- Multi-job Cutting Stock Problem with Due Dates and Release Dates
- Networks and vehicle routing for municipal waste collection
- Arc Routing Problems, Part I: The Chinese Postman Problem
- Arc Routing Problems, Part II: The Rural Postman Problem
- Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues
- Arc Routing
- An Exact Algorithm for the Capacitated Arc Routing Problem with Deadheading Demand
- Node, Edge, Arc Routing and Turn Penalties: Multiple Problems—One Neighborhood Extension
This page was built for publication: Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics
