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

DOI10.1016/J.EJOR.2012.01.030MaRDI QIDQ1926697zbMATH OpenOpenAlexFDO

Authors Nacima Labadie, Renata Mansini, Jan Melechovský, 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

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

Recommendations

• Hybridized evolutionary local search algorithm for the team orienteering problem with time windows
• Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows
• An iterated local search algorithm for the team orienteering problem with variable profits
• A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem
• Solving the team orienteering problem with cutting planes

Cites work

• scientific article; zbMATH DE number 6676558 (Why is no real title available?)
• scientific article; zbMATH DE number 1082108 (Why is no real title available?)
• scientific article; zbMATH DE number 1769325 (Why is no real title available?)
• A TABU search heuristic for the team orienteering problem
• A fast and effective heuristic for the orienteering problem
• A guided local search metaheuristic for the team orienteering problem
• A memetic algorithm for the team orienteering problem
• A path relinking approach for the team orienteering problem
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• Algorithms to solve the orienteering problem: A comparison
• An exact algorithm for team orienteering problems
• 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
• Heuristics for the multi-period orienteering problem with multiple time windows
• Hybridized evolutionary local search algorithm for the team orienteering problem with time windows
• Integer Programming Formulation of Traveling Salesman Problems
• Iterated local search for the team orienteering problem with time windows
• The Orienteering Problem with Time Windows
• The granular tabu search and its application to the vehicle-routing problem
• The orienteering problem
• The orienteering problem: a survey
• The selective travelling salesman problem
• The team orienteering problem
• Variable neighborhood search
• Variable neighborhood search: Principles and applications

Cited in

(35)

• Variable neighborhood search for metric dimension and minimal doubly resolving set problems
• Multi-period orienteering with uncertain adoption likelihood and waiting at customers
• Solving the team orienteering problem with cutting planes
• The multi-vehicle profitable pickup and delivery problem
• A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems
• Solving the team orienteering problem with nonidentical agents: A Lagrangian approach
• Designing granular solution methods for routing problems with time windows
• In-depth analysis of granular local search for capacitated vehicle routing
• Single-machine scheduling with release times, deadlines, setup times, and rejection
• Formulation and a two-phase matheuristic for the roaming salesman problem: application to election logistics
• 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
• A tabu search with geometry‐based sparsification methods for angular traveling salesman problems
• Hybridized evolutionary local search algorithm for the team orienteering problem with time windows
• An iterative three-component heuristic for the team orienteering problem with time windows
• The multi-visit team orienteering problem with precedence constraints
• An effective large neighborhood search for the team orienteering problem with time windows
• A simulated annealing heuristic for the team orienteering problem with time windows
• Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach
• A unified matheuristic for solving multi-constrained traveling salesman problems with profits
• 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
• The bus sightseeing problem
• The synchronized multi-assignment orienteering problem
• A tabu search algorithm for the multi-period inspector scheduling problem
• Trip planning for visitors in a service system with capacity constraints
• An effective matheuristic for the capacitated total quantity discount problem
• Heuristics for the time dependent team orienteering problem: application to tourist route planning
• Adaptive large neighborhood search algorithm for route planning of freight buses with pickup and delivery
• A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem
• A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit
• Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows
• A new mathematical model and a heuristic algorithm for the tourist trip design problem under new constraints: a real-world application

Describes a project that uses

Uses Software

• VRP

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

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