IDEAS home Printed from https://ideas.repec.org/p/cdl/itsrrp/qt5354w222.html

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. Bagchi, Tapan P. & Gupta, Jatinder N.D. & Sriskandarajah, Chelliah, 2006. "A review of TSP based approaches for flowshop scheduling," European Journal of Operational Research, Elsevier, vol. 169(3), pages 816-854, March.
    2. 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.
    3. 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.
    4. 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.
    5. Hichem Kamoun & Nicholas G. Hall & Chelliah Sriskandarajah, 1999. "Scheduling in Robotic Cells: Heuristics and Cell Design," Operations Research, INFORMS, vol. 47(6), pages 821-835, December.
    6. Crevier, Benoit & Cordeau, Jean-Francois & Laporte, Gilbert, 2007. "The multi-depot vehicle routing problem with inter-depot routes," European Journal of Operational Research, Elsevier, vol. 176(2), pages 756-773, January.
    7. Brandao, Jose, 2006. "A new tabu search algorithm for the vehicle routing problem with backhauls," European Journal of Operational Research, Elsevier, vol. 173(2), pages 540-555, September.
    8. Johanns, Patrick & Lowe, Tim & Plante, Robert, 2001. "Selection and sequencing heuristics to reduce variance in gas turbine engine nozzle assemblies," European Journal of Operational Research, Elsevier, vol. 132(3), pages 490-504, August.
    9. 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.
    10. Derigs, Ulrich & Kurowsky, René & Vogel, Ulrich, 2011. "Solving a real-world vehicle routing problem with multiple use of tractors and trailers and EU-regulations for drivers arising in air cargo road feeder services," European Journal of Operational Research, Elsevier, vol. 213(1), pages 309-319, August.
    11. Brandao, Jose & Mercer, Alan, 1997. "A tabu search algorithm for the multi-trip vehicle routing and scheduling problem," European Journal of Operational Research, Elsevier, vol. 100(1), pages 180-191, July.
    12. 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.
    13. Hoff, Arild & Gribkovskaia, Irina & Laporte, Gilbert & Løkketangen, Arne, 2009. "Lasso solution strategies for the vehicle routing problem with pickups and deliveries," European Journal of Operational Research, Elsevier, vol. 192(3), pages 755-766, February.
    14. H Tang & E Miller-Hooks, 2005. "Algorithms for a stochastic selective travelling salesperson problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(4), pages 439-452, April.
    15. Atefi, Reza & Salari, Majid & C. Coelho, Leandro & Renaud, Jacques, 2018. "The open vehicle routing problem with decoupling points," European Journal of Operational Research, Elsevier, vol. 265(1), pages 316-327.
    16. Li, Jianxiang & Chen, Haoxun & Chu, Feng, 2010. "Performance evaluation of distribution strategies for the inventory routing problem," European Journal of Operational Research, Elsevier, vol. 202(2), pages 412-419, April.
    17. Jamal Ouenniche & Prasanna K. Ramaswamy & Michel Gendreau, 2017. "A dual local search framework for combinatorial optimization problems with TSP application," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(11), pages 1377-1398, November.
    18. Michel Gendreau & Manuel Iori & Gilbert Laporte & Silvano Martello, 2006. "A Tabu Search Algorithm for a Routing and Container Loading Problem," Transportation Science, INFORMS, vol. 40(3), pages 342-350, August.
    19. X-Y Li & P Tian & S C H Leung, 2009. "An ant colony optimization metaheuristic hybridized with tabu search for open vehicle routing problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(7), pages 1012-1025, July.
    20. 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.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

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