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

DOI10.1016/J.EJOR.2019.11.010zbMath1431.90024OpenAlexW2983045131WikidataQ126788255 ScholiaQ126788255MaRDI QIDQ2286963

Koorush Ziarati, Somayeh Sohrabi, 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 programmingmetaheuristicsorienteering problemgreedy randomized adaptive search procedureorienteering problem with hotel selection

Mathematics Subject Classification ID

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

Related Items (4)

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 ⋮ Robust drone selective routing in humanitarian transportation network assessment ⋮ The vacation planning problem: a multi-level clustering-based metaheuristic approach

Cites Work

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

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