The multi-district team orienteering problem

DOI10.1016/J.COR.2013.07.026MaRDI QIDQ336760zbMATH OpenOpenAlexFDO

Authors M. Angélica Salazar-Aguilar, André Langevin, G. 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) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)

Recommendations

• The team orienteering problem
• Heuristics for the multi-period orienteering problem with multiple time windows
• The synchronized multi-assignment orienteering problem
• The Orienteering Problem with Time Windows
• Orienteering problem: a survey of recent variants, solution approaches and applications

Cites work

• scientific article; zbMATH DE number 4061010 (Why is no real title available?)
• A TABU search heuristic for the team orienteering problem
• A general heuristic for vehicle routing problems
• A path relinking approach for the team orienteering problem
• An exact algorithm for team orienteering problems
• Iterated local search for the team orienteering problem with time windows
• New optimization heuristics. The great deluge algorithm and the record- to-record travel
• Synchronized arc routing for snow plowing operations
• The orienteering problem
• The selective travelling salesman problem
• The team orienteering problem

Cited in

(15)

• The synchronized multi-assignment orienteering problem
• A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints
• The set orienteering problem
• Team Orienteering with Time-Varying Profit
• The team orienteering problem
• Multi-start heuristics for unit-capacity orienteering problems
• Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem
• A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints
• Bi-objective orienteering for personal activity scheduling
• The multi-visit team orienteering problem with precedence constraints
• Orienteering problem: a survey of recent variants, solution approaches and applications
• Dynamic design of sales territories
• A survey of adaptive large neighborhood search algorithms and applications
• Formulations for the orienteering problem with additional constraints
• Fairness in ambulance routing for post disaster management

This page was built for publication: The multi-district team orienteering problem

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