Efficient meta-heuristics for the multi-objective time-dependent orienteering problem

DOI10.1016/j.ejor.2016.03.053zbMath1346.90745OpenAlexW2336649575MaRDI QIDQ323359

Yi Mei, Flora D. Salim, Xiaodong Li

Publication date: 7 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://figshare.com/articles/journal_contribution/Efficient_meta-heuristics_for_the_multi-objective_time-dependent_orienteering_problem/14343968

zbMATH Keywords

multi-objective optimizationmeta-heuristicsmemetic algorithmorienteering problemant colony system

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (5)

A matheuristic approach to the orienteering problem with service time dependent profits ⋮ UAV routing for reconnaissance mission: a multi-objective orienteering problem with time-dependent prizes and multiple connections ⋮ A swarm intelligence graph-based pathfinding algorithm (SIGPA) for multi-objective route planning ⋮ Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach ⋮ A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints

Cites Work

• Unnamed Item
• Heuristics for the time dependent team orienteering problem: application to tourist route planning
• 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
• The orienteering problem: a survey
• Heuristics for the multi-period orienteering problem with multiple time windows
• Iterated local search for the team orienteering problem with time windows
• 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 fast and effective heuristic for the orienteering problem
• Strong linear programming relaxations for the orienteering problem
• A tabu search heuristic for the undirected selective travelling salesman problem
• A TABU search heuristic for the team orienteering problem
• Approximation algorithms for time-dependent orienteering.
• The team orienteering problem with time windows: an LP-based granular variable neighborhood search
• A fast solution method for the time-dependent orienteering problem
• An exact algorithm for team orienteering problems
• Using a Genetic Algorithm to Solve the Generalized Orienteering Problem
• The orienteering problem
• Genetic local search for multi-objective combinatorial optimization

This page was built for publication: Efficient meta-heuristics for the multi-objective time-dependent orienteering problem