Effects of update frequencies in a dynamic capacitated arc routing problem

DOI10.1002/NET.21990MaRDI QIDQ6092644zbMATH OpenOpenAlexFDO

Authors J. Thompson, Rhyd Lewis

Publication date 23 November 2023

Published in Networks (Search for Journal in Brave)

Full work available at URL https://orca.cardiff.ac.uk/id/eprint/134895/1/Dynamic_CARP_paper_final.pdf

zbMATH Keywords

capacitated arc routingdynamicmetaheuristicnew taskstabu searchupdate schedule

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Recommendations

• Efficient algorithms under dynamic graphs to solve the capacitated arc routing problem with feasible sparse graph
• Variants of the capacitated arc routing problem
• Approximate solutions for the capacitated arc routing problem
• An approximation algorithm for the capacitated arc routing problem
• An improved heuristic for the capacitated arc routing problem
• Improved bounds for large scale capacitated arc routing problem
• The capacitated arc routing problem: Valid inequalities and facets
• The capacitated arc routing problem: exact algorithms
• Improved lower bounds and exact algorithm for the capacitated arc routing problem

Cites work

• A deterministic tabu search algorithm for the capacitated arc routing problem
• A guided local search heuristic for the capacitated arc routing problem
• A note on two problems in connexion with graphs
• Ant colony system for a dynamic vehicle routing problem
• Capacitated arc routing problems
• Heuristics for a dynamic rural postman problem
• Tabu Search—Part I
• The rescheduling arc routing problem

This page was built for publication: Effects of update frequencies in a dynamic capacitated arc routing problem

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