Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics
type: Item
instance of: scholarly article
title: Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics
zbMATH Open document ID: 1411.90342
author: Angel A. Juan
author: Seán McGarraghy
author: Jesica De Armas
author: Peter B. Keenan
published in: Annals of Operations Research
publication date: 2019-03-06T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90B06
zbMATH DE Number: 7032658
zbMATH Keywords: capacitated arc routing problem
zbMATH Keywords: time-based capacities
zbMATH Keywords: biased randomisation
zbMATH Keywords: simulated annealing
zbMATH Keywords: metaheuristics
describes a project that uses: Algorithm 97
MaRDI profile type: Publication
full work available at URL: s10479-018-2777-3
OpenAlex ID: W2790740531
cites work: Q5431855
cites work: Q5271455
cites work: Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees
cites work: A constraint programming approach to the Chinese postman problem with time windows
cites work: Exact methods based on node-routing formulations for undirected arc-routing problems
cites work: An Exact Algorithm for the Capacitated Arc Routing Problem with Deadheading Demand
cites work: A cutting plane algorithm for the capacitated arc routing problem
cites work: Q5271456
cites work: Networks and vehicle routing for municipal waste collection
cites work: The Capacitated Arc Routing Problem: Lower bounds
cites work: A guided local search heuristic for the capacitated arc routing problem
cites work: A deterministic tabu search algorithm for the capacitated arc routing problem
cites work: A hybrid metaheuristic approach for the capacitated arc routing problem
cites work: Arc Routing
cites work: Recent results on Arc Routing Problems: An annotated bibliography
cites work: Q4510100
cites work: Routeing winter gritting vehicles
cites work: Q4762467
cites work: Arc Routing Problems, Part II: The Rural Postman Problem
cites work: Arc Routing Problems, Part I: The Chinese Postman Problem
cites work: The vehicle routing problem. Latest advances and new challenges.
cites work: Network service scheduling and routing
cites work: Q5271464
cites work: Q3374251
cites work: A Tabu Search Heuristic for the Capacitated arc Routing Problem
cites work: A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
cites work: NODE DUPLICATION LOWER BOUNDS FOR THE CAPACITATED ARC ROUTING PROBLEM
cites work: Q5287166
cites work: Solution of real-world postman problems
cites work: Using parallel \& distributed computing for real-time solving of vehicle routing problems with stochastic demands
cites work: MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems
cites work: Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues
cites work: Optimization by Simulated Annealing
cites work: Capacitated arc routing problem with deadheading demands
cites work: Q2770548
cites work: Competitive memetic algorithms for arc routing problems
cites work: Exploiting sparsity in pricing routines for the capacitated arc routing problem
cites work: Multi-job Cutting Stock Problem with Due Dates and Release Dates
cites work: A new algorithm for the directed Chinese postman problem
cites work: Solving capacitated arc routing problems using a transformation to the CVRP
cites work: Road network monitoring: algorithms and a case study
cites work: A comparison of simulated annealing cooling strategies
cites work: New lower bounds for the Capacitated Arc Routing Problem
cites work: Approximate solutions for the capacitated arc routing problem
cites work: Augment-insert algorithms for the capacitated arc routing problem
cites work: Transforming arc routing into node routing problems
cites work: Q5271454
cites work: GRASP with evolutionary path-relinking for the capacitated arc routing problem
cites work: Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows
cites work: Node, Edge, Arc Routing and Turn Penalties: Multiple Problems—One Neighborhood Extension
cites work: Q3801316
cites work: New lower bound for the capacitated arc routing problem
cites work: A Decade of Capacitated Arc Routing
cites work: An Approximation Algorithm for the Capacitated Arc Routing Problem
DOI: 10.1007/S10479-018-2777-3
description: scientific article; zbMATH DE number 7032658