Article ID: | iaor2001252 |
Country: | United Kingdom |
Volume: | 6 |
Issue: | 1 |
Start Page Number: | 107 |
End Page Number: | 121 |
Publication Date: | Jan 1999 |
Journal: | International Transactions in Operational Research |
Authors: | Kitamura Ryuichi, Vaughn Kenneth M., Abdel-Aty Mohamed A. |
Keywords: | programming: travelling salesman, transportation: road |
There is a need to further explore ways to use Advanced Traveler Information Systems to encourage transit and ridesharing. One mechanism is to provide convenient travel itinerary information, not just for one trip, but for a day's travel. The formulation should consider time constraints, activity needs, real transit service parameters and the actual street system. Basic algorithmic development is needed to spur the private sector interest in such a product by demonstrating its utility. The activity travel planner will aid its user in planning his daily itinerary by arranging the sequence of stops, suggesting and possibly selecting stop locations, providing transit route and schedule information, and suggesting travel routes. This paper develops a framework for solving the Travel Itinerary Planning Problem which is a variant of the Traveling Salesman Problem. Implementation of the solution algorithm would be used to develop and test a prototype for an activity and travel planner.