IDEAS home Printed from https://ideas.repec.org/p/cdl/itsrrp/qt2jq8524g.html
   My bibliography  Save this paper

Daily Activity and Multimodal Travel Planner: Phase 1 Report

Author

Listed:
  • Kitamura, Ryuichi
  • Chen, Cynthia

Abstract

Travel constitutes an integral part of our daily life. Only by traveling are we able to engage in a variety of activities at different locations. Since the extension of our movement is restricted by the amount of time that is available and the speed with which we can move, it is important that our travel be efficiently organized such that the time resource can be best utilized to engage in activities in an efficient manner. One approach to achieving this is to choose less congested and faster routes. The use of in-vehicle advanced traveler information systems (ATIS) for this purpose has been extensively discussed in the ITS literature. Little attention has been directed, on the other hand, to achieving the same goal by developing efficient travel itineraries. This becomes important when a traveler visits a number of places in a tour. Examples include a delivery truck driver who is supposed to deliver goods to multiple locations, or a tourist who wishes to visit a number of attraction spots. In these cases the traveler is interested in not only the best route connecting successive locations for visit, but also the best sequence of visiting the locations. The problem, however, is an extremely complex one to solve, whose solution may often be not obvious to the traveler. The objective of this project is to develop a tool that can assist the traveler in developing an efficient itinerary in which multiple locations can be visited with a minimal waste. Also in the scope of this project is the development of an information system that will aid the traveler in using public transit in a complex tour in which multiple locations are visited. Underlying this is the beliefs that the availability of information affects the decision to use public transit in important manners, and that people will make complex tours by public transit if they are shown that it is possible and convenient to do so. These considerations led to the conception of the “Travel Planner,” a computer software which assists the traveler by proposing to hider efficient itineraries for visiting multiple locations using alternative travel modes. Given the set of locations the traveler wishes to visit and the constraints associated with the visits, the Travel Planner develops alternative itineraries for the visits interactively with the traveler, or, the user. The planner presents alternative itineraries, and the user indicates the Planner which itinerary is more preferable. The planner in turn takes the feedback from the user and updates its objective function to better reflect the user’s preferences. This process is iterated until a satisfactory itinerary is found.

Suggested Citation

  • Kitamura, Ryuichi & Chen, Cynthia, 1998. "Daily Activity and Multimodal Travel Planner: Phase 1 Report," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt2jq8524g, Institute of Transportation Studies, UC Berkeley.
  • Handle: RePEc:cdl:itsrrp:qt2jq8524g
    as

    Download full text from publisher

    File URL: https://www.escholarship.org/uc/item/2jq8524g.pdf;origin=repeccitec
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Michel Gendreau & Alain Hertz & Gilbert Laporte, 1992. "New Insertion and Postoptimization Procedures for the Traveling Salesman Problem," Operations Research, INFORMS, vol. 40(6), pages 1086-1094, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Baals, Julian & Emde, Simon & Turkensteen, Marcel, 2023. "Minimizing earliness-tardiness costs in supplier networks—A just-in-time truck routing problem," European Journal of Operational Research, Elsevier, vol. 306(2), pages 707-741.
    2. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part II: Metaheuristics," Transportation Science, INFORMS, vol. 39(1), pages 119-139, February.
    3. Mohan, Srimathy & Gendreau, Michel & Rousseau, Jean-Marc, 2010. "Heuristics for the Stochastic Eulerian Tour Problem," European Journal of Operational Research, Elsevier, vol. 203(1), pages 107-117, May.
    4. Ann M. Campbell & Barrett W. Thomas, 2008. "Probabilistic Traveling Salesman Problem with Deadlines," Transportation Science, INFORMS, vol. 42(1), pages 1-21, February.
    5. Majed G. Alharbi & Ahmed Stohy & Mohammed Elhenawy & Mahmoud Masoud & Hamiden Abd El-Wahed Khalifa, 2021. "Solving Traveling Salesman Problem with Time Windows Using Hybrid Pointer Networks with Time Features," Sustainability, MDPI, vol. 13(22), pages 1-12, November.
    6. Bernhard Fleischmann & Martin Gietz & Stefan Gnutzmann, 2004. "Time-Varying Travel Times in Vehicle Routing," Transportation Science, INFORMS, vol. 38(2), pages 160-173, May.
    7. Zachariadis, Emmanouil E. & Tarantilis, Christos D. & Kiranoudis, Christos T., 2009. "A Guided Tabu Search for the Vehicle Routing Problem with two-dimensional loading constraints," European Journal of Operational Research, Elsevier, vol. 195(3), pages 729-743, June.
    8. Keisuke Murakami, 2018. "Iterative Column Generation Algorithm for Generalized Multi-Vehicle Covering Tour Problem," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 35(04), pages 1-22, August.
    9. Bahram Alidaee & Haibo Wang, 2017. "A note on heuristic approach based on UBQP formulation of the maximum diversity problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(1), pages 102-110, January.
    10. Jeffrey W. Ohlmann & Barrett W. Thomas, 2007. "A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 19(1), pages 80-90, February.
    11. Manerba, Daniele & Mansini, Renata & Riera-Ledesma, Jorge, 2017. "The Traveling Purchaser Problem and its variants," European Journal of Operational Research, Elsevier, vol. 259(1), pages 1-18.
    12. I H Osman & S Ahmadi, 2007. "Guided construction search metaheuristics for the capacitated p-median problem with single source constraint," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(1), pages 100-114, January.
    13. Yossiri Adulyasak & Jean-François Cordeau & Raf Jans, 2014. "Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems," INFORMS Journal on Computing, INFORMS, vol. 26(1), pages 103-120, February.
    14. Vidal, Thibaut & Crainic, Teodor Gabriel & Gendreau, Michel & Prins, Christian, 2013. "Heuristics for multi-attribute vehicle routing problems: A survey and synthesis," European Journal of Operational Research, Elsevier, vol. 231(1), pages 1-21.
    15. Kitamura, Ryuichi & Chen, Cynthia & Chen, Jiayu, 1999. "Daily Activity and Multimodal Travel Planner: Phase II Final Report," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt5354w222, Institute of Transportation Studies, UC Berkeley.
    16. I.N. Kamal Abadi & Nicholas G. Hall & Chelliah Sriskandarajah, 2000. "Minimizing Cycle Time in a Blocking Flowshop," Operations Research, INFORMS, vol. 48(1), pages 177-180, February.
    17. C. Archetti & M. G. Speranza & A. Hertz, 2006. "A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem," Transportation Science, INFORMS, vol. 40(1), pages 64-73, February.
    18. Leonardo Berbotto & Sergio García & Francisco Nogales, 2014. "A Randomized Granular Tabu Search heuristic for the split delivery vehicle routing problem," Annals of Operations Research, Springer, vol. 222(1), pages 153-173, November.
    19. Cattaruzza, Diego & Absi, Nabil & Feillet, Dominique & Vidal, Thibaut, 2014. "A memetic algorithm for the Multi Trip Vehicle Routing Problem," European Journal of Operational Research, Elsevier, vol. 236(3), pages 833-848.
    20. Gerardo Berbeglia & Jean-François Cordeau & Irina Gribkovskaia & Gilbert Laporte, 2007. "Static pickup and delivery problems: a classification scheme and survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 15(1), pages 1-31, July.

    More about this item

    Keywords

    Engineering;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:cdl:itsrrp:qt2jq8524g. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Lisa Schiff (email available below). General contact details of provider: https://edirc.repec.org/data/itucbus.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.