Abstract
Abstract. The Trip Design Problem (TTDP) is a computational problem related to path planning among points of interests in a touristic area. It can be modeled as a well-known routing problem called Orienteering Problem with Time Windows (OPTW) in which a given positive profit and time interval are associated with each location. This paper approaches OPTW suggesting a comparison between two different methods to solve it: Biased Random Key Genetic Algorithm (BRKGA) and MultiStart. Both techniques use a local search with four steps, based on the lasts solutions proposed to this problem. Computational experiments were executed on traditional instances. The tests showed that the BRKGA method achieved larger or same results than MultiStart for all the 76 instances evaluated. Furthermore, were found 21 new best solutions for OPTW instances, in comparison with the current literature. Keywords: BRKGA, MultiStart, OPTW, TTDP.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
