IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v144y2003i2p379-396.html
   My bibliography  Save this article

Vehicle dispatching with time-dependent travel times

Author

Listed:
  • Ichoua, Soumia
  • Gendreau, Michel
  • Potvin, Jean-Yves

Abstract

No abstract is available for this item.

Suggested Citation

  • Ichoua, Soumia & Gendreau, Michel & Potvin, Jean-Yves, 2003. "Vehicle dispatching with time-dependent travel times," European Journal of Operational Research, Elsevier, vol. 144(2), pages 379-396, January.
    • Handle: RePEc:eee:ejores:v:144:y:2003:i:2:p:379-396
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(02)00147-9
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Hill, A. V. & Mabert, V. A. & Montgomery, D. W., 1988. "A decision support system for the courier vehicle scheduling problem," Omega, Elsevier, vol. 16(4), pages 333-345.
    2. Michel Gendreau & François Guertin & Jean-Yves Potvin & Éric Taillard, 1999. "Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching," Transportation Science, INFORMS, vol. 33(4), pages 381-390, November.
    3. Malandraki, Chryssi & Dial, Robert B., 1996. "A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 90(1), pages 45-55, April.
    4. Nachtigall, K., 1995. "Time depending shortest-path problems with applications to railway networks," European Journal of Operational Research, Elsevier, vol. 83(1), pages 154-166, May.
    5. Stuart E. Dreyfus, 1969. "An Appraisal of Some Shortest-Path Algorithms," Operations Research, INFORMS, vol. 17(3), pages 395-412, June.
    6. André de Palma & Pierre Hansen & Martine Labbé, 1990. "Commuters' Paths with Penalties for Early or Late Arrival Time," Transportation Science, INFORMS, vol. 24(4), pages 276-286, November.
    7. Mark D. Hickman & David H. Bernstein, 1997. "Transit Service and Path Choice Models in Stochastic and Time-Dependent Networks," Transportation Science, INFORMS, vol. 31(2), pages 129-146, May.
    8. L. R. Ford & D. R. Fulkerson, 1958. "Constructing Maximal Dynamic Flows from Static Flows," Operations Research, INFORMS, vol. 6(3), pages 419-433, June.
    9. Randolph W. Hall, 1986. "The Fastest Path through a Network with Random Time-Dependent Travel Times," Transportation Science, INFORMS, vol. 20(3), pages 182-188, August.
    10. Chryssi Malandraki & Mark S. Daskin, 1992. "Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms," Transportation Science, INFORMS, vol. 26(3), pages 185-200, August.
    11. Gerald G. Brown & Carol J. Ellis & Glenn W. Graves & David Ronen, 1987. "Real-Time, Wide Area Dispatch of Mobil Tank Trucks," Interfaces, INFORMS, vol. 17(1), pages 107-120, February.
    12. Marshall L. Fisher & Arnold J. Greenfield & R. Jaikumar & Joseph T. Lester, 1982. "A Computerized Vehicle Routing Application," Interfaces, INFORMS, vol. 12(4), pages 42-52, August.
    13. Harilaos N. Psaraftis & John N. Tsitsiklis, 1993. "Dynamic Shortest Paths in Acyclic Networks with Markovian Arc Costs," Operations Research, INFORMS, vol. 41(1), pages 91-101, February.
    14. Philippe H. J. Marguier & Avishai Ceder, 1984. "Passenger Waiting Strategies for Overlapping Bus Routes," Transportation Science, INFORMS, vol. 18(3), pages 207-230, August.
    15. Jean-Claude Picard & Maurice Queyranne, 1978. "The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling," Operations Research, INFORMS, vol. 26(1), pages 86-110, February.
    16. Marius M. Solomon, 1987. "Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints," Operations Research, INFORMS, vol. 35(2), pages 254-265, April.
    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. Tao Zhang & W. Art Chaovalitwongse & Yuejie Zhang, 2014. "Integrated Ant Colony and Tabu Search approach for time dependent vehicle routing problems with simultaneous pickup and delivery," Journal of Combinatorial Optimization, Springer, vol. 28(1), pages 288-309, July.
    2. Furini, Fabio & Persiani, Carlo Alfredo & Toth, Paolo, 2016. "The Time Dependent Traveling Salesman Planning Problem in Controlled Airspace," Transportation Research Part B: Methodological, Elsevier, vol. 90(C), pages 38-55.
    3. Bernhard Fleischmann & Martin Gietz & Stefan Gnutzmann, 2004. "Time-Varying Travel Times in Vehicle Routing," Transportation Science, INFORMS, vol. 38(2), pages 160-173, May.
    4. Anke Stieber & Armin Fügenschuh, 2022. "Dealing with time in the multiple traveling salespersons problem with moving targets," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 30(3), pages 991-1017, September.
    5. Jean-François Cordeau & Gianpaolo Ghiani & Emanuela Guerriero, 2014. "Analysis and Branch-and-Cut Algorithm for the Time-Dependent Travelling Salesman Problem," Transportation Science, INFORMS, vol. 48(1), pages 46-58, February.
    6. Huang, He & Gao, Song, 2012. "Optimal paths in dynamic networks with dependent random link travel times," Transportation Research Part B: Methodological, Elsevier, vol. 46(5), pages 579-598.
    7. Andres Figliozzi, Miguel, 2012. "The time dependent vehicle routing problem with time windows: Benchmark problems, an efficient solution algorithm, and solution characteristics," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(3), pages 616-636.
    8. Liu, Yiming & Roberto, Baldacci & Zhou, Jianwen & Yu, Yang & Zhang, Yu & Sun, Wei, 2023. "Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 310(1), pages 133-155.
    9. Ghiani, Gianpaolo & Guerriero, Francesca & Laporte, Gilbert & Musmanno, Roberto, 2003. "Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies," European Journal of Operational Research, Elsevier, vol. 151(1), pages 1-11, November.
    10. Barrett W. Thomas, 2007. "Waiting Strategies for Anticipating Service Requests from Known Customer Locations," Transportation Science, INFORMS, vol. 41(3), pages 319-331, August.
    11. Maskooki, Alaleh & Kallio, Markku, 2023. "A bi-criteria moving-target travelling salesman problem under uncertainty," European Journal of Operational Research, Elsevier, vol. 309(1), pages 271-285.
    12. Wohlgemuth, Sascha & Oloruntoba, Richard & Clausen, Uwe, 2012. "Dynamic vehicle routing with anticipation in disaster relief," Socio-Economic Planning Sciences, Elsevier, vol. 46(4), pages 261-271.
    13. Yiming Liu & Yang Yu & Yu Zhang & Roberto Baldacci & Jiafu Tang & Xinggang Luo & Wei Sun, 2023. "Branch-Cut-and-Price for the Time-Dependent Green Vehicle Routing Problem with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 35(1), pages 14-30, January.
    14. Ampol Karoonsoontawong & Puntipa Punyim & Wanvara Nueangnitnaraporn & Vatanavongs Ratanavaraha, 2020. "Multi-Trip Time-Dependent Vehicle Routing Problem with Soft Time Windows and Overtime Constraints," Networks and Spatial Economics, Springer, vol. 20(2), pages 549-598, June.
    15. Barrett W. Thomas & Chelsea C. White, 2004. "Anticipatory Route Selection," Transportation Science, INFORMS, vol. 38(4), pages 473-487, November.
    16. Daqing Wu & Chenxiang Wu, 2022. "Research on the Time-Dependent Split Delivery Green Vehicle Routing Problem for Fresh Agricultural Products with Multiple Time Windows," Agriculture, MDPI, vol. 12(6), pages 1-28, May.
    17. M. Alinaghian & M. Ghazanfari & N. Norouzi & H. Nouralizadeh, 2017. "A Novel Model for the Time Dependent Competitive Vehicle Routing Problem: Modified Random Topology Particle Swarm Optimization," Networks and Spatial Economics, Springer, vol. 17(4), pages 1185-1211, December.
    18. Said Dabia & Stefan Ropke & Tom van Woensel & Ton De Kok, 2013. "Branch and Price for the Time-Dependent Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 47(3), pages 380-396, August.
    19. de Lima, Vinícius L. & Alves, Cláudio & Clautiaux, François & Iori, Manuel & Valério de Carvalho, José M., 2022. "Arc flow formulations based on dynamic programming: Theoretical foundations and applications," European Journal of Operational Research, Elsevier, vol. 296(1), pages 3-21.
    20. Miller-Hooks, Elise & Mahmassani, Hani, 2003. "Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks," European Journal of Operational Research, Elsevier, vol. 146(1), pages 67-82, April.

    More about this item

    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:eee:ejores:v:144:y:2003:i:2:p:379-396. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.