Paper Info
Title
A memetic algorithm for the prize-collecting Traveling Car Renter Problem.
Abstract
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.
Year
DOI
Venue
2014
10.1109/CEC.2014.6900337
IEEE Congress on Evolutionary Computation
Keywords
Field
DocType
memetics,memetic algorithm,np hard problem,computational complexity,algorithm design and analysis,evolutionary computation,sociology,statistics,transportation
Bottleneck traveling salesman problem,Traveling purchaser problem,Memetic algorithm,Mathematical optimization,Vertex (geometry),Computer science,2-opt,Solver,Renting
Conference
Citations 
PageRank 
References 
1
0.36
9
Authors
3
Name
Order
Citations
PageRank
Matheus da Silva Menezes120.72
Marco César Goldbarg29610.64
Elizabeth F.G. Goldbarg311916.22