Abstract
AbstractA personalized day tour planning problem is studied to maximize the total pleasure gained from the tour. The concept of utility theory is employed for this purpose. Considering the uniform and diminishing marginal pleasure intensities, two zero–one mixed integer nonlinear programming models are proposed. Both the models can accommodate preferred time slots, visits to specific spots, and spots diversity. A branch‐and‐bound algorithm is used to solve the proposed models. Finally, they are applied to solve the day tour problem for Delhi, India. The tour plan obtained using the diminishing marginal pleasure intensity offers an improved value of total pleasure.
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.
