The multi-district team orienteering problem

DOI10.1016/j.cor.2013.07.026zbMath1348.90061OpenAlexW1976333517MaRDI QIDQ336760

M. Angélica Salazar-Aguilar, André Langevin, Gilbert Laporte

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2013.07.026

zbMATH Keywords

adaptive large neighborhood searchteam orienteering problemnode routingoperations planningtasks scheduling

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Orienteering problem: a survey of recent variants, solution approaches and applications, Dynamic design of sales territories, A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints, A survey of adaptive large neighborhood search algorithms and applications, Formulations for the orienteering problem with additional constraints, A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints, Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem, Fairness in ambulance routing for post disaster management, The synchronized multi-assignment orienteering problem

Cites Work

• Unnamed Item
• Iterated local search for the team orienteering problem with time windows
• A general heuristic for vehicle routing problems
• The selective travelling salesman problem
• A path relinking approach for the team orienteering problem
• New optimization heuristics. The great deluge algorithm and the record- to-record travel
• The team orienteering problem
• Synchronized arc routing for snow plowing operations
• A TABU search heuristic for the team orienteering problem
• An exact algorithm for team orienteering problems
• The orienteering problem