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

Daily Activity and Multimodal Travel Planner: Phase II Final Report

Author

Listed:
  • Kitamura, Ryuichi
  • Chen, Cynthia
  • Chen, Jiayu

Abstract

It is important that our travel be organized in an efficient way. One way to achieve this is to provide travelers with a trip planner that produces efficient travel itineraries for them. It is desired that a trip planner possess the following features in order to be useful: be able to handle multiple destinations, multiple constraints, and multiple modes; and be able to adjust travelers' preferences under different circumstances. These features cannot be found in existing trip planners. The goal is then to develop an "Itinerary Planner" that possesses all of these features. The Itinerary Planner attempts to identify the most desirable itinerary from among all feasible alternatives. The desirability of an itinerary is measured by an objective function, which is defined a weighted sum of seven criteria (i.e., attributes of the itinerary), The weights represent travelers' preferences to the attributes (e.g., total travel time and monetary cost). The Itinerary Planner first uses initial values of the preference weights established in a previous study in the Bay Area. After a series of operations, the Planner selects the two "best" itineraries which have the best and the second best objective function values. Then, the Planner presents the selected itineraries to the traveler. If the traveler is not satisfied with either itinerary, the Planner asks the traveler to indicate the itinerary that they prefer to the other. Based on the selection made by the user, the Planner updates the preference weights and re-selects another two itineraries. This process is repeated until the traveler is satisfied with one of the selected itineraries. A prototype is developed for downtown San Francisco. It is demonstrated that the Planner is capable of effectively generating alternative itineraries for a tour that involves multiple trips and multiple modes, with complex constraints, and that the Planner prototype serves as a practical tool for travelers in itinerary planning.

Suggested Citation

  • 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.
  • Handle: RePEc:cdl:itsrrp:qt5354w222
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Aksoy, Yasemin & Butler, Timothy W. & Minor, Elliott D., 1996. "Comparative studies in interactive multiple objective mathematical programming," European Journal of Operational Research, Elsevier, vol. 89(2), pages 408-422, March.
    2. 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)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Andrew Ensor & Felipe Lillo, 2016. "Colored-Edge Graph Approach for the Modeling of Multimodal Transportation Systems," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(01), pages 1-21, February.

    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. Gendreau, Michel & Laporte, Gilbert & Semet, Frederic, 1998. "A tabu search heuristic for the undirected selective travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 539-545, April.
    2. 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.
    3. Ahmadi, Reza H. & Mamer, John W., 1999. "Routing heuristics for automated pick and place machines," European Journal of Operational Research, Elsevier, vol. 117(3), pages 533-552, September.
    4. Yossiri Adulyasak & Jean-François Cordeau & Raf Jans, 2014. "Optimization-Based Adaptive Large Neighborhood Search for the Production Routing Problem," Transportation Science, INFORMS, vol. 48(1), pages 20-45, February.
    5. 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.
    6. 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.
    7. Ann M. Campbell & Barrett W. Thomas, 2008. "Probabilistic Traveling Salesman Problem with Deadlines," Transportation Science, INFORMS, vol. 42(1), pages 1-21, February.
    8. C D Tarantilis & G Ioannou & C T Kiranoudis & G P Prastacos, 2005. "Solving the open vehicle routeing problem via a single parameter metaheuristic algorithm," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(5), pages 588-596, May.
    9. Dominique Feillet & Pierre Dejax & Michel Gendreau, 2005. "Traveling Salesman Problems with Profits," Transportation Science, INFORMS, vol. 39(2), pages 188-205, May.
    10. R Aringhieri & R Cordone, 2011. "Comparing local search metaheuristics for the maximum diversity problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(2), pages 266-280, February.
    11. 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.
    12. Renaud, Jacques & Boctor, Fayez F., 2002. "A sweep-based algorithm for the fleet size and mix vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 140(3), pages 618-628, August.
    13. Bernhard Fleischmann & Martin Gietz & Stefan Gnutzmann, 2004. "Time-Varying Travel Times in Vehicle Routing," Transportation Science, INFORMS, vol. 38(2), pages 160-173, May.
    14. Zhao, Qiu-Hong & Chen, Shuang & Zang, Cun-Xun, 2008. "Model and algorithm for inventory/routing decision in a three-echelon logistics system," European Journal of Operational Research, Elsevier, vol. 191(3), pages 623-635, December.
    15. 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.
    16. Biao Yuan & Zhibin Jiang, 2017. "Disruption Management for the Real-Time Home Caregiver Scheduling and Routing Problem," Sustainability, MDPI, vol. 9(12), pages 1-15, November.
    17. 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.
    18. Zhao, Qiu-Hong & Wang, Shou-Yang & Lai, K.K., 2007. "A partition approach to the inventory/routing problem," European Journal of Operational Research, Elsevier, vol. 177(2), pages 786-802, March.
    19. 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.
    20. van der Bruggen, Lambert & Gruson, Ruud & Salomon, Marc, 1995. "Reconsidering the distribution structure of gasoline products for a large oil company," European Journal of Operational Research, Elsevier, vol. 81(3), pages 460-473, March.

    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:qt5354w222. 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.