Hybridized evolutionary local search algorithm for the team orienteering problem with time windows

DOI10.1007/S10732-010-9153-ZzbMATH Open1237.90200OpenAlexW1973751736MaRDI QIDQ415560FDOQ415560

Authors: Nacima Labadie, Jan Melechovský, Roberto Wolfler Calvo 

Publication date: 8 May 2012

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10732-010-9153-z

Recommendations

• Iterated local search for the team orienteering problem with time windows
• Efficient metaheuristics for the mixed team orienteering problem with time windows
• A hybrid adaptive large neighborhood search heuristic for the team orienteering problem
• Evolution-inspired local improvement algorithm solving orienteering problem
• An effective large neighborhood search for the team orienteering problem with time windows
• A guided local search metaheuristic for the team orienteering problem
• The team orienteering problem with time windows: an LP-based granular variable neighborhood search

zbMATH Keywords

time windowsteam orienteering problemGRASPELS

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• 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
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• The team orienteering problem
• On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem
• Heuristics for the multi-period orienteering problem with multiple time windows
• A memetic algorithm for the team orienteering problem
• A fast and effective heuristic for the orienteering problem
• The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm
• A tabu search heuristic for the undirected selective travelling salesman problem
• Greedy randomized adaptive search procedures
• Title not available (Why is that?)
• Title not available (Why is that?)
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• Solving the Orienteering Problem through Branch-and-Cut
• Iterated local search for the team orienteering problem with time windows
• The selective travelling salesman 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
• Approximation algorithms for time-dependent orienteering.
• A guided local search metaheuristic for the team orienteering problem
• Title not available (Why is that?)
• Using a genetic algorithm to solve the generalized orienteering problem
• The effective application of a new approach to the generalized orienteering problem
• Approximation Algorithms for Orienteering and Discounted-Reward TSP
• Minimum directed 1-subtree relaxation for score orienteering problem
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (24)

• The synchronized multi-assignment orienteering problem
• Centralized multi-visitor trip planning with activity reservations in crowded destinations
• A memetic algorithm for the team orienteering problem
• A tabu search algorithm for the probabilistic orienteering problem
• An effective large neighborhood search for the team orienteering problem with time windows
• Efficient metaheuristics for the mixed team orienteering problem with time windows
• Genetic algorithm with path relinking for the orienteering problem with time windows
• Bi-objective orienteering for personal activity scheduling
• 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
• The bus sightseeing problem
• Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows
• A path relinking approach for the team orienteering problem
• Multi-period orienteering with uncertain adoption likelihood and waiting at customers
• The team orienteering problem with time windows: an LP-based granular variable neighborhood search
• A hybrid adaptive large neighborhood search heuristic for the team orienteering problem
• A TABU search heuristic for the team orienteering problem
• Hybrid genetic algorithm for undirected traveling salesman problems with profits
• An iterative three-component heuristic for the team orienteering problem with time windows
• Efficiently solving the thief orienteering problem with a max-min ant colony optimization approach
• A unified matheuristic for solving multi-constrained traveling salesman problems with profits
• An iterated local search algorithm for the team orienteering problem with variable profits

Uses Software

• VRP

This page was built for publication: Hybridized evolutionary local search algorithm for the team orienteering problem with time windows

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