The bus sightseeing problem
From MaRDI portal
Publication:6080627
DOI10.1111/itor.13160MaRDI QIDQ6080627
Emmanouil E. Zachariadis, Qian Hu, Christos D. Tarantilis, Zhenzhen Zhang, Roberto Baldacci
Publication date: 4 October 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
vehicle routing; branch-and-cut; orienteering; local search based metaheuristic; profit collection; sightseeing
90-XX: Operations research, mathematical programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints
- Hybridized evolutionary local search algorithm for the team orienteering problem with time windows
- Partitioning procedures for solving mixed-variables programming problems
- Variable neighborhood search
- Logic-based Benders decomposition
- The team orienteering problem with time windows: an LP-based granular variable neighborhood search
- An iterative three-component heuristic for the team orienteering problem with time windows
- A guided local search metaheuristic for the team orienteering problem
- Generalized Benders decomposition
- New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows
- Vehicle Routing
- Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Reformulation and Decomposition of Integer Programs
- Solving Large-Scale Zero-One Linear Programming Problems
