An efficient evolutionary algorithm for the orienteering problem

DOI10.1016/J.COR.2017.09.003MaRDI QIDQ1652505zbMATH OpenOpenAlexFDO

Authors Gorka Kobeaga, María Merino, José A. Lozano

Publication date 11 July 2018

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

Full work available at URL http://hdl.handle.net/20.500.11824/730

zbMATH Keywords

combinatorial optimizationevolutionary algorithmorienteering problemtravelling salesperson problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)

Recommendations

• Evolution-inspired local improvement algorithm solving orienteering problem
• A Memetic-GRASP Algorithm for the Solution of the Orienteering Problem
• The orienteering problem: a survey
• A biased random-key genetic algorithm for the set orienteering problem
• Solving the Orienteering Problem through Branch-and-Cut

Cites work

• scientific article; zbMATH DE number 177832 (Why is no real title available?)
• A Memetic-GRASP Algorithm for the Solution of the Orienteering Problem
• A TABU search heuristic for the team orienteering problem
• A branch-and-cut algorithm for the orienteering arc routing problem
• A fast and effective heuristic for the orienteering problem
• A memetic algorithm for the team orienteering problem
• A tabu search heuristic for the undirected selective travelling salesman problem
• Evolution-inspired local improvement algorithm solving orienteering problem
• Heuristics for the multi-period orienteering problem with multiple time windows
• Iterated local search for the team orienteering problem with time windows
• Orienteering problem: a survey of recent variants, solution approaches and applications
• Solving the Orienteering Problem through Branch-and-Cut
• TSPLIB—A Traveling Salesman Problem Library
• The effective application of a new approach to the generalized orienteering problem
• The orienteering problem
• The orienteering problem: a survey
• The prize collecting traveling salesman problem
• Using a genetic algorithm to solve the generalized orienteering problem
• Using artificial neural networks to solve the orienteering problem

Cited in

(15)

• An improvement heuristic based on variable neighborhood search for a dynamic orienteering problem
• A fishing route optimization decision support system: the case of the tuna purse seiner
• A Memetic-GRASP Algorithm for the Solution of the Orienteering Problem
• Adaptive solution prediction for combinatorial optimization
• An adaptive large neighborhood search approach for multiple traveling repairman problem with profits
• Evolution-inspired local improvement algorithm solving orienteering problem
• Research on a novel minimum-risk model for uncertain orienteering problem based on uncertainty theory
• Efficiently solving the thief orienteering problem with a max-min ant colony optimization approach
• Hybrid genetic algorithm for undirected traveling salesman problems with profits
• A revisited branch-and-cut algorithm for large-scale orienteering problems
• A biased random-key genetic algorithm for the set orienteering problem
• Boosting ant colony optimization via solution prediction and machine learning
• Route recombination for deterministic and non-deterministic orienteering problems with time windows: a dynamic programming approach
• Trip planning for visitors in a service system with capacity constraints
• A variable neighborhood search algorithm for cost-balanced travelling salesman problem

Describes a project that uses

Uses Software

• TSPLIB
• Concorde

This page was built for publication: An efficient evolutionary algorithm for the orienteering problem

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