A path relinking approach for the team orienteering problem

DOI10.1016/J.COR.2009.05.002MaRDI QIDQ975993zbMATH OpenOpenAlexFDO

Authors Wouter Souffriau, Pieter Vansteenwegen, Greet Vanden Berghe, D. Van Oudheusden

Publication date 11 June 2010

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2009.05.002

zbMATH Keywords

metaheuristicpath relinkingteam orienteering problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• The team orienteering problem
• An iterated local search algorithm for the team orienteering problem with variable profits
• A guided local search metaheuristic for the team orienteering problem
• The orienteering problem: a survey
• Hybridized evolutionary local search algorithm for the team orienteering problem with time windows

Cites work

• scientific article; zbMATH DE number 4061010 (Why is no real title available?)
• scientific article; zbMATH DE number 1054674 (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 heuristic for the multiple tour maximum collection problem
• A path relinking approach for the team orienteering problem
• A probabilistic heuristic for a computationally difficult set covering problem
• A tabu search heuristic for the undirected selective travelling salesman problem
• Algorithms to solve the orienteering problem: A comparison
• An Optimal Algorithm for the Orienteering Tour Problem
• An exact algorithm for team orienteering problems
• An optimal solution procedure for the multiple tour maximum collection problem using column generation
• Computer Solutions of the Traveling Salesman Problem
• Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
• Efficient Heuristic Procedures for Integer Linear Programming with an Interior
• GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
• Path relinking for the vehicle routing problem
• Solving the Orienteering Problem through Branch-and-Cut
• Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
• The orienteering problem
• The selective travelling salesman problem
• The team orienteering problem
• The vehicle routing problem: An overview of exact and approximate algorithms
• Using artificial neural networks to solve the orienteering problem

Cited in

(36)

• An iterated local search algorithm for the team orienteering problem with variable profits
• The orienteering problem: a survey
• Route recombination for deterministic and non-deterministic orienteering problems with time windows: a dynamic programming approach
• A GRASP with evolutionary path relinking for the truck and trailer routing problem
• The orienteering problem with variable profits
• Local search for the undirected capacitated arc routing problem with profits
• A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem
• Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem
• A matheuristic for the team orienteering arc routing problem
• The selective vehicle routing problem in a collaborative environment
• Iterated local search for the team orienteering problem with time windows
• Genetic algorithm with path relinking for the orienteering problem with time windows
• Solving the team orienteering problem with nonidentical agents: A Lagrangian approach
• The multi-district team orienteering problem
• The capacitated team orienteering problem with incomplete service
• 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
• A memetic algorithm for the multiperiod vehicle routing problem with profit
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
• Algorithm selection for the team orienteering problem
• Statistical analysis of distance-based path relinking for the capacitated vehicle routing problem
• A path relinking approach for the team orienteering problem
• Evolution-inspired local improvement algorithm solving orienteering problem
• Solving the team orienteering problem with cutting planes
• The multi-vehicle profitable pickup and delivery problem
• Coupling ant colony systems with strong local searches
• The team orienteering problem with time windows: an LP-based granular variable neighborhood search
• An effective PSO-inspired algorithm for the team orienteering problem
• A hybrid adaptive large neighborhood search heuristic for the team orienteering problem
• The vehicle routing problem with service level constraints
• Planning in tourism and public transportation. Attraction selection by means of a personalised electronic tourist guide and train transfer scheduling
• A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit
• Solving the stochastic team orienteering problem: comparing simheuristics with the sample average approximation method
• Simplified swarm optimization in disassembly sequencing problems with learning effects
• Memory and learning in metaheuristics
• A guided local search metaheuristic for the team orienteering problem

Describes a project that uses

Uses Software

• VRP

This page was built for publication: A path relinking approach for the team orienteering problem

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