Efficient algorithms under dynamic graphs to solve the capacitated arc routing problem with feasible sparse graph

DOI10.1051/RO/2018087MaRDI QIDQ5380984zbMATH OpenOpenAlexWikidataFDO

Authors Sara Tfaili, Hamdi Dkhil, Abdelkader Sbihi, Adnan Yassine

Publication date 7 June 2019

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1051/ro/2018087

zbMATH Keywords

graph theorysparsitytabu searchrouting problems

Mathematics Subject Classification ID

Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Integer programming (90C10) Transportation, logistics and supply chain management (90B06)

Recommendations

• Exploiting sparsity in pricing routines for the capacitated arc routing problem
• Approximate solutions for the capacitated arc routing problem
• Augment-insert algorithms for the capacitated arc routing problem
• Improved lower bounds and exact algorithm for the capacitated arc routing problem
• The capacitated arc routing problem. A heuristic algorithm

Cited in

(2)

• Exploiting sparsity in pricing routines for the capacitated arc routing problem
• Effects of update frequencies in a dynamic capacitated arc routing problem

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: Efficient algorithms under dynamic graphs to solve the capacitated arc routing problem with feasible sparse graph

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