A memetic algorithm for the prize-collecting Traveling Car Renter Problem

This paper introduces a new variant of the Traveling Car Renter Problem, named Prize-collecting Traveling Car Renter Problem. In this problem, a set of vertices, each associated with a bonus, and a set of vehicles are given. The bonus represents a degree of satisfaction to visit the vertex. The objective is to determine a cycle that visits some vertices collecting, at least, a pre-defined bonus, i.e. reaching a pre-specified satisfaction, and minimizing the cost of the tour that can be traveled with different vehicles. A mathematical formulation is presented and implemented in a solver to produce results for sixty-four instances. A memetic algorithm is proposed and its performance is evaluated in comparison to the results obtained with the solver.

[1]  Dirk Van Oudheusden,et al.  A PERSONALIZED TOURIST TRIP DESIGN ALGORITHM FOR MOBILE TOURIST GUIDES , 2008, Appl. Artif. Intell..

[2]  Yew-Soon Ong,et al.  Memetic Computation—Past, Present & Future [Research Frontier] , 2010, IEEE Computational Intelligence Magazine.

[3]  Pablo Moscato,et al.  On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms , 1989 .

[4]  Marco César Goldbarg,et al.  Memetic algorithm for the Traveling Car Renter Problem: an experimental investigation , 2012, Memetic Comput..

[5]  Marco César Goldbarg,et al.  A transgenetic algorithm applied to the Traveling Car Renter Problem , 2013, Expert Syst. Appl..

[6]  Cathy H. Xia,et al.  Fleet-sizing and service availability for a vehicle rental system via closed queueing networks , 2011, Eur. J. Oper. Res..

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

[8]  Marco César Goldbarg,et al.  Evolutionary algorithm for the Car Renter Salesman , 2011, 2011 IEEE Congress of Evolutionary Computation (CEC).

[9]  G. Croes A Method for Solving Traveling-Salesman Problems , 1958 .

[10]  Xiaoni Hao,et al.  Car rental logistics problem: A review of literature , 2008, 2008 IEEE International Conference on Service Operations and Logistics, and Informatics.

[11]  Dirk Van Oudheusden,et al.  The Mobile Tourist Guide: An OR Opportunity , 2007, OR Insight.

[12]  Egon Balas,et al.  The prize collecting traveling salesman problem , 1989, Networks.

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

[14]  R. A. Zemlin,et al.  Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[15]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[16]  R. Fortet L’algebre de Boole et ses applications en recherche operationnelle , 1960 .

[17]  Fred W. Glover,et al.  Technical Note - Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program , 1974, Oper. Res..