The team orienteering problem with time windows: an LP-based granular variable neighborhood search
From MaRDI portal
Publication:1926697
DOI10.1016/J.EJOR.2012.01.030zbMATH Open1253.90048OpenAlexW2058995871MaRDI QIDQ1926697FDOQ1926697
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
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
- Integer Programming Formulation of Traveling Salesman Problems
- The orienteering problem
- The Orienteering Problem with Time Windows
- The orienteering problem: a survey
- Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
- The team orienteering problem
- Variable neighborhood search
- Variable neighborhood search: Principles and applications
- Heuristics for the multi-period orienteering problem with multiple time windows
- A memetic algorithm for the team orienteering problem
- Algorithms to solve the orienteering problem: A comparison
- A fast and effective heuristic for the orienteering problem
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- Title not available (Why is that?)
- Iterated local search for the team orienteering problem with time windows
- The selective travelling salesman problem
- An exact algorithm for the maximum clique problem
- A TABU search heuristic for the team orienteering problem
- An exact algorithm for team orienteering problems
- Title not available (Why is that?)
- A path relinking approach for the team orienteering problem
- A guided local search metaheuristic for the team orienteering problem
- The granular tabu search and its application to the vehicle-routing problem
- Title not available (Why is that?)
- Hybridized evolutionary local search algorithm for the team orienteering problem with time windows
Cited In (35)
- The synchronized multi-assignment orienteering problem
- Formulation and a two-phase matheuristic for the roaming salesman problem: application to election logistics
- A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem
- Single-machine scheduling with release times, deadlines, setup times, and rejection
- A tabu search with geometry‐based sparsification methods for angular traveling salesman problems
- An effective large neighborhood search for the team orienteering problem with time windows
- An effective matheuristic for the capacitated total quantity discount problem
- Solving the team orienteering problem with nonidentical agents: A Lagrangian approach
- 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
- The multi-visit team orienteering problem with precedence constraints
- Variable neighborhood search for metric dimension and minimal doubly resolving set problems
- 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
- Trip planning for visitors in a service system with capacity constraints
- Heuristics for the time dependent team orienteering problem: application to tourist route planning
- A new mathematical model and a heuristic algorithm for the tourist trip design problem under new constraints: a real-world application
- Hybridized evolutionary local search algorithm for the team orienteering problem with time windows
- A simulated annealing heuristic for the team orienteering problem with time windows
- Adaptive large neighborhood search algorithm for route planning of freight buses with pickup and delivery
- The bus sightseeing problem
- A tabu search algorithm for the multi-period inspector scheduling problem
- Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows
- Multi-period orienteering with uncertain adoption likelihood and waiting at customers
- The multi-vehicle profitable pickup and delivery problem
- Solving the team orienteering problem with cutting planes
- An iterative three-component heuristic for the team orienteering problem with time windows
- A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit
- Designing granular solution methods for routing problems with time windows
- A unified matheuristic for solving multi-constrained traveling salesman problems with profits
- A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems
- In-depth analysis of granular local search for capacitated vehicle routing
- Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach
Uses Software
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)
