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

DOI10.1016/J.EJOR.2016.03.053zbMATH Open1346.90745OpenAlexW2336649575MaRDI QIDQ323359FDOQ323359

Authors: 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

Recommendations

• A fast solution method for the time-dependent orienteering problem
• The time-dependent orienteering problem with time windows: a fast ant colony system
• Heuristics for the multi-period orienteering problem with multiple time windows
• An efficient two-phase metaheuristic algorithm for the time dependent traveling salesman problem
• Heuristics for the time dependent team orienteering problem: application to tourist route planning

zbMATH Keywords

multi-objective optimizationmeta-heuristicsorienteering problemmemetic algorithmant colony system

Mathematics Subject Classification ID

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

Cites Work

• The orienteering problem
• The orienteering problem: a survey
• Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
• Genetic local search for multi-objective combinatorial optimization
• Heuristics for the multi-period orienteering problem with multiple time windows
• A fast and effective heuristic for the orienteering problem
• A tabu search heuristic for the undirected selective travelling salesman problem
• The team orienteering problem with time windows: an LP-based granular variable neighborhood search
• 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
• Strong linear programming relaxations for the orienteering problem
• Approximation algorithms for time-dependent orienteering.
• A fast solution method for the time-dependent orienteering problem
• Title not available (Why is that?)
• Heuristics for the time dependent team orienteering problem: application to tourist route planning
• Using a genetic algorithm to solve the generalized orienteering problem
• 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

Cited In (7)

• Orchard algorithm (OA): a new meta-heuristic algorithm for solving discrete and continuous optimization problems
• A matheuristic approach to the orienteering problem with service time dependent profits
• Heuristics for the multi-period orienteering problem with multiple time windows
• A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints
• 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

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

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