The multi-visit team orienteering problem with precedence constraints
From MaRDI portal
Publication:2282540
DOI10.1016/j.ejor.2019.09.045zbMath1430.90086OpenAlexW2976235687WikidataQ127218021 ScholiaQ127218021MaRDI QIDQ2282540
Saïd Hanafi, Renata Mansini, Roberto Zanotti
Publication date: 8 January 2020
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2019.09.045
Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)
Related Items
An integrated routing and scheduling problem for home healthcare delivery with limited person-to-person contact ⋮ The aquaculture service vessel routing problem with time dependent travel times and synchronization constraints ⋮ A decomposition approach for the stochastic asset protection problem ⋮ Hybridizing adaptive large neighborhood search with kernel search: a new solution approach for the nurse routing problem with incompatible services and minimum demand ⋮ Solving the team orienteering problem with nonidentical agents: A Lagrangian approach ⋮ A matheuristic for the electric vehicle routing problem with time windows and a realistic energy consumption model ⋮ Planning robust drone-truck delivery routes under road traffic uncertainty ⋮ Flexible vehicle scheduling with precedence constraints for tourists ⋮ Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem ⋮ Scheduling heterogeneous delivery tasks on a mixed logistics platform
Uses Software
Cites Work
- Orienteering problem: a survey of recent variants, solution approaches and applications
- Solving the team orienteering problem with cutting planes
- Kernel search: a new heuristic framework for portfolio selection
- The orienteering problem: a survey
- Combined vehicle routing and scheduling with temporal precedence and synchronization constraints
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- A fast and effective heuristic for the orienteering problem
- The home care crew scheduling problem: preference-based visit clustering and temporal dependencies
- An exact algorithm for team orienteering problems
- The vehicle routing problem with time windows and temporal dependencies
- A branch‐and‐cut algorithm for the Team Orienteering Problem
- A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem
- The Synchronized Dynamic Vehicle Dispatching Problem
