The team orienteering problem with time windows: an LP-based granular variable neighborhood search

DOI10.1016/j.ejor.2012.01.030zbMath1253.90048OpenAlexW2058995871MaRDI QIDQ1926697

Renata Mansini, Jan Melechovský, Nacima Labadie, Roberto Wolfler Calvo

Publication date: 29 December 2012

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2012.01.030

zbMATH Keywords

time windowsvariable neighborhood searchteam orienteering problemLP-based granularity

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Related Items (31)

The multi-vehicle profitable pickup and delivery problem ⋮ A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem ⋮ Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests ⋮ Efficient meta-heuristics for the multi-objective time-dependent orienteering problem ⋮ Orienteering problem: a survey of recent variants, solution approaches and applications ⋮ An effective matheuristic for the capacitated total quantity discount problem ⋮ A tabu search algorithm for the multi-period inspector scheduling problem ⋮ Heuristics for the time dependent team orienteering problem: application to tourist route planning ⋮ A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints ⋮ Bi-objective orienteering for personal activity scheduling ⋮ The bi-objective insular traveling salesman problem with maritime and ground transportation costs ⋮ Solving the team orienteering problem with cutting planes ⋮ Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows ⋮ Variable neighborhood search for metric dimension and minimal doubly resolving set problems ⋮ Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach ⋮ Trip planning for visitors in a service system with capacity constraints ⋮ Solving the team orienteering problem with nonidentical agents: A Lagrangian approach ⋮ The bus sightseeing problem ⋮ Designing granular solution methods for routing problems with time windows ⋮ A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit ⋮ In-depth analysis of granular local search for capacitated vehicle routing ⋮ A tabu search with geometry‐based sparsification methods for angular traveling salesman problems ⋮ A new mathematical model and a heuristic algorithm for the tourist trip design problem under new constraints: a real-world application ⋮ A unified matheuristic for solving multi-constrained traveling salesman problems with profits ⋮ Adaptive large neighborhood search algorithm for route planning of freight buses with pickup and delivery ⋮ An iterative three-component heuristic for the team orienteering problem with time windows ⋮ A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems ⋮ Formulation and a two-phase matheuristic for the roaming salesman problem: application to election logistics ⋮ Single-machine scheduling with release times, deadlines, setup times, and rejection ⋮ Multi-period orienteering with uncertain adoption likelihood and waiting at customers ⋮ The synchronized multi-assignment orienteering problem

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hybridized evolutionary local search algorithm for the team orienteering problem with time windows
• The orienteering problem: a survey
• Heuristics for the multi-period orienteering problem with multiple time windows
• Iterated local search for the team orienteering problem with time windows
• The selective travelling salesman problem
• An exact algorithm for the maximum clique problem
• Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
• A memetic algorithm for the team orienteering problem
• A path relinking approach for the team orienteering problem
• Algorithms to solve the orienteering problem: A comparison
• The team orienteering problem
• A fast and effective heuristic for the orienteering problem
• Variable neighborhood search
• A TABU search heuristic for the team orienteering problem
• A guided local search metaheuristic for the team orienteering problem
• An exact algorithm for team orienteering problems
• The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
• Integer Programming Formulation of Traveling Salesman Problems
• The orienteering problem
• The Orienteering Problem with Time Windows
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• Variable neighborhood search: Principles and applications

This page was built for publication: The team orienteering problem with time windows: an LP-based granular variable neighborhood search