A memetic algorithm for the orienteering problem with hotel selection

In this paper, a memetic algorithm is developed to solve the orienteering problem with hotel selection (OPHS). The algorithm consists of two levels: a genetic component mainly focuses on finding a good sequence of intermediate hotels, whereas six local search moves embedded in a variable neighborhood structure deal with the selection and sequencing of vertices between the hotels. A set of 176 new and larger benchmark instances of OPHS are created based on optimal solutions of regular orienteering problems. Our algorithm is applied on these new instances as well as on 224 benchmark instances from the literature. The results are compared with the known optimal solutions and with the only other existing algorithm for this problem. The results clearly show that our memetic algorithm outperforms the existing algorithm in terms of solution quality and computational time. A sensitivity analysis shows the significant impact of the number of possible sequences of hotels on the difficulty of an OPHS instance.

[1]  Christian Prins,et al.  A memetic algorithm with dynamic population management for an integrated production-distribution problem , 2009, Eur. J. Oper. Res..

[2]  Duc-Cuong Dang,et al.  A Memetic Algorithm for the Team Orienteering Problem , 2008, EvoWorkshops.

[3]  John E. Beasley,et al.  Route first--Cluster second methods for vehicle routing , 1983 .

[4]  Emmanouil E. Zachariadis,et al.  A Hybrid Guided Local Search for the Vehicle-Routing Problem with Intermediate Replenishment Facilities , 2008, INFORMS J. Comput..

[5]  Duc-Cuong Dang,et al.  An effective PSO-inspired algorithm for the team orienteering problem , 2013, Eur. J. Oper. Res..

[6]  Demetrio Laganà,et al.  Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions , 2010, J. Heuristics.

[7]  Michel Gendreau,et al.  A branch-and-cut algorithm for the undirected selective traveling salesman problem , 1998, Networks.

[8]  Jean-Yves Potvin,et al.  State-of-the Art Review - Evolutionary Algorithms for Vehicle Routing , 2009, INFORMS J. Comput..

[9]  Dirk Van Oudheusden,et al.  The City Trip Planner: An expert system for tourists , 2011, Expert Syst. Appl..

[10]  Dirk Cattrysse,et al.  A variable neighborhood search method for the orienteering problem with hotel selection , 2013 .

[11]  Gilbert Laporte,et al.  The capacitated arc routing problem with intermediate facilities , 2001, Networks.

[12]  R. Vohra,et al.  The Orienteering Problem , 1987 .

[13]  El-Ghazali Talbi,et al.  Metaheuristics - From Design to Implementation , 2009 .

[14]  Maria Grazia Speranza,et al.  The periodic vehicle routing problem with intermediate facilities , 2002, Eur. J. Oper. Res..

[15]  Byung-In Kim,et al.  Waste collection vehicle routing problem with time windows using multi-objective genetic algorithms , 2007 .

[16]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[17]  G. Laporte,et al.  Discrete Optimization The multi-depot vehicle routing problem with inter-depot routes , 2007 .

[18]  Kenneth Sörensen,et al.  MA mid PM: memetic algorithms with population management , 2006, Comput. Oper. Res..

[19]  Maria Grazia Speranza,et al.  The application of a vehicle routing model to a waste-collection problem: two case studies , 2002, J. Oper. Res. Soc..

[20]  Peter Goos,et al.  A memetic algorithm for the travelling salesperson problem with hotel selection , 2013, Comput. Oper. Res..

[21]  Jean-Yves Potvin,et al.  Evolutionary Algorithms for Vehicle Routing , 2007 .

[22]  Nubia Velasco,et al.  A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands , 2008, Comput. Oper. Res..

[23]  Qiang Meng,et al.  Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots , 2008, Math. Comput. Model..

[24]  Dirk Van Oudheusden,et al.  The orienteering problem: A survey , 2011, Eur. J. Oper. Res..

[25]  K. Sörensen,et al.  Memetic algorithms with population management , 2006 .

[26]  Richard F. Hartl,et al.  Metaheuristics for the bi-objective orienteering problem , 2009, Swarm Intelligence.

[27]  Pablo Moscato,et al.  Memetic algorithms: a short introduction , 1999 .

[28]  Christian Prins,et al.  A simple and effective evolutionary algorithm for the vehicle routing problem , 2004, Comput. Oper. Res..

[29]  Christian Prins,et al.  An effective memetic algorithm for the cumulative capacitated vehicle routing problem , 2010, Comput. Oper. Res..

[30]  T. Tsiligirides,et al.  Heuristic Methods Applied to Orienteering , 1984 .

[31]  Kenneth Sörensen,et al.  The travelling salesperson problem with hotel selection , 2012, J. Oper. Res. Soc..

[32]  A. M. Benjamin,et al.  Metaheuristics for the waste collection vehicle routing problem with time windows , 2011 .

[33]  Roberto Musmanno,et al.  Tabu Search Heuristics for the Arc Routing Problem with Intermediate Facilities under Capacity and Length Restrictions , 2004, J. Math. Model. Algorithms.