Journal
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH
Volume 25, Issue 4, Pages 1269-1295Publisher
WILEY
DOI: 10.1111/itor.12330
Keywords
traveling purchaser problem; genetic algorithms; local search; metaheuristics; biased random key genetic algorithm
Funding
- Fundacao para a Ciencia e a Tecnologia [UID/MAT/04561/2013, PTDC/MAT-NAN/2196/2014]
- Fundação para a Ciência e a Tecnologia [PTDC/MAT-NAN/2196/2014] Funding Source: FCT
Ask authors/readers for more resources
In this paper we address the traveling purchaser problem, an NP-hard problem that generalizes the traveling salesman problem. We present several metaheuristics that combine genetic algorithms and local search. The genetic algorithms are induced by different hierarchic orderings of the decision making regarding the route and the acquisition of the items. Computational experiments were carried out with benchmark instances and the results show that the proposed metaheuristics are a suitable tool to solve high-dimensioned instances for which the exact methods do not provide solutions within a reasonable CPU time. For several instances, best new upper bounds for the optimum value of the objective function were obtained.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available