A path relinking approach for the team orienteering problem

DOI10.1016/j.cor.2009.05.002zbMath1188.90221OpenAlexW1968989933MaRDI QIDQ975993

Wouter Souffriau, Pieter Vansteenwegen, Dirk D. L. van Oudheusden, Greet vanden Berghe

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)

Related Items (30)

The multi-vehicle profitable pickup and delivery problem ⋮ Iterated local search for the team orienteering problem with time windows ⋮ A guided local search metaheuristic for the team orienteering problem ⋮ The selective vehicle routing problem in a collaborative environment ⋮ Statistical analysis of distance-based path relinking for the capacitated vehicle routing problem ⋮ The multi-district team orienteering problem ⋮ Solving the team orienteering problem with cutting planes ⋮ Algorithm selection for the team orienteering problem ⋮ Evolution-inspired local improvement algorithm solving orienteering problem ⋮ The orienteering problem with variable profits ⋮ The capacitated team orienteering problem with incomplete service ⋮ A hybrid adaptive large neighborhood search heuristic for the team orienteering problem ⋮ The team orienteering problem with time windows: an LP-based granular variable neighborhood search ⋮ Coupling ant colony systems with strong local searches ⋮ The vehicle routing problem with service level constraints ⋮ The orienteering problem: a survey ⋮ Solving the team orienteering problem with nonidentical agents: A Lagrangian approach ⋮ Hybridized evolutionary local search algorithm 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 ⋮ A GRASP with evolutionary path relinking for the truck and trailer routing problem ⋮ A simulated annealing heuristic for the team orienteering problem with time windows ⋮ Local search for the undirected capacitated arc routing problem with profits ⋮ Simplified swarm optimization in disassembly sequencing problems with learning effects ⋮ A path relinking approach for the team orienteering problem ⋮ Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem ⋮ Planning in tourism and public transportation. Attraction selection by means of a personalised electronic tourist guide and train transfer scheduling ⋮ Memory and Learning in Metaheuristics ⋮ An effective PSO-inspired algorithm for the team orienteering problem ⋮ A memetic algorithm for the multiperiod vehicle routing problem with profit ⋮ Heuristics for multi-attribute vehicle routing problems: a survey and synthesis

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
• The selective travelling salesman problem
• Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
• A path relinking approach for the team orienteering problem
• Algorithms to solve the orienteering problem: A comparison
• A probabilistic heuristic for a computationally difficult set covering problem
• The vehicle routing problem: An overview of exact and approximate algorithms
• The team orienteering problem
• A fast and effective heuristic for the orienteering problem
• An optimal solution procedure for the multiple tour maximum collection problem using column generation
• A heuristic for the multiple tour maximum collection problem
• A tabu search heuristic for the undirected selective travelling salesman problem
• A TABU search heuristic for the team orienteering problem
• Using artificial neural networks to solve the orienteering problem
• A guided local search metaheuristic for the team orienteering problem
• An exact algorithm for team orienteering problems
• Path relinking for the vehicle routing problem
• The orienteering problem
• An Optimal Algorithm for the Orienteering Tour Problem
• Solving the Orienteering Problem through Branch-and-Cut
• GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
• Computer Solutions of the Traveling Salesman Problem
• Efficient Heuristic Procedures for Integer Linear Programming with an Interior

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