A greedy randomized adaptive search procedure for the orienteering problem with hotel selection

DOI10.1016/J.EJOR.2019.11.010MaRDI QIDQ2286963zbMATH OpenOpenAlexWikidataFDO

Authors Somayeh Sohrabi, Koorush Ziarati, Morteza Keshtkaran

Publication date 23 January 2020

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

Full work available at URL https://doi.org/10.1016/j.ejor.2019.11.010

zbMATH Keywords

dynamic programminggreedy randomized adaptive search proceduremetaheuristicsorienteering problemorienteering problem with hotel selection

Mathematics Subject Classification ID

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

Recommendations

• A memetic algorithm for the orienteering problem with hotel selection
• A Memetic-GRASP Algorithm for the Solution of the Orienteering Problem
• Greedy randomized adaptive search procedures
• scientific article; zbMATH DE number 2050708
• A fast metaheuristic for the travelling salesperson problem with hotel selection

Cites work

• A fast metaheuristic for the travelling salesperson problem with hotel selection
• A Heuristic for the Periodic Vehicle Routing Problem
• A hybrid dynamic programming and memetic algorithm to the traveling salesman problem with hotel selection
• A hybrid guided local search for the vehicle-routing problem with intermediate replenishment facilities
• A memetic algorithm for the orienteering problem with hotel selection
• A memetic algorithm for the travelling salesperson problem with hotel selection
• A method for solving traveling-salesman problems
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• An adaptive VNS algorithm for vehicle routing problems with intermediate stops
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities
• Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots
• Greedy randomized adaptive search procedures
• Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory
• Orienteering problem: a survey of recent variants, solution approaches and applications
• Splitting procedures for the mixed capacitated arc routing problem under time restrictions with intermediate facilities
• The application of a vehicle routing model to a waste-collection problem: two case studies
• The multi-depot vehicle routing problem with inter-depot routes
• The periodic vehicle routing problem with intermediate facilities
• Waste collection vehicle routing problem with time windows

Cited in

(7)

• Robust drone selective routing in humanitarian transportation network assessment
• The vacation planning problem: a multi-level clustering-based metaheuristic approach
• A memetic algorithm for the orienteering problem with hotel selection
• A hybrid iterated local search heuristic for the traveling salesperson problem with hotel selection
• A swarm intelligence graph-based pathfinding algorithm (SIGPA) for multi-objective route planning
• An effective hybrid evolutionary algorithm for the clustered orienteering problem
• Low budget traveling: the orienteering problem with hotel selection and budget constraint

This page was built for publication: A greedy randomized adaptive search procedure for the orienteering problem with hotel selection

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