The multiple traveling salesman problem with backup coverage

DOI10.1016/J.ENDM.2018.03.018zbMath1408.90339OpenAlexW2796796276MaRDI QIDQ1791936

Olinto César Bassi de Araújo, Guilherme Dhein, Alberto Francisco Kummer Neto

Publication date: 11 October 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2018.03.018

zbMATH Keywords

synchronizationgenetic algorithmVNDbackup coverage

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Uses Software

• TSPLIB

Cites Work

• The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach
• Variable neighborhood search
• A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment
• Synchronized arc routing for snow plowing operations
• Greedy randomized adaptive search procedures
• The Pickup And Delivery Problem With Time Windows And Transshipment

This page was built for publication: The multiple traveling salesman problem with backup coverage