Abstract
In this paper we present a LP-based heuristic for the solution of a Time Constrained Routing problem arising from innovative services accessible via World Wide Web. The problem consists of scheduling the visit of a tourist to a given geographical area in order to maximize his satisfaction degree whilst respecting time windows restrictions. We refer to this problem as the Intelligent Tourist Problem (ITP). ITP is formulated as a Set Packing problem with side constraints. Due to the huge number of variables in the formulation, the LP-relaxation is solved by a “column-and-row generation” approach. Then we run a MIP solver over the active columns to get a feasible solution. Computational experience on real-world instances is reported showing the effectiveness of the proposed approach.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
