The TD-Dijkstra algorithm is applied to determine time-dependent paths by using a node-examination process consid-ering time-varying speeds from an origino to a destinationd. A pseudocode is presented in Algorithm 4.
Algorithm 4 Time-dependent Dijkstra label-setting algorithm (TD-Dijkstra)
1: function TD Dijkstra(o,d,t,GT)
References
Konstantinos N Androutsopoulos and Konstantinos G Zografos. An integrated modelling approach for the bicriterion vehicle routing and scheduling problem with environmental considerations.Transportation Research Part C: Emerging Technologies, 82:180–209, 2017.
Matthew Barth and Kanok Boriboonsomsin. Real-world carbon dioxide impacts of traffic congestion. Transportation Research Record: Journal of the Transportation Research Board, 2058:163–171, 2008.
Matthew Barth and Kanok Boriboonsomsin. Energy and emissions impacts of a freeway-based dynamic eco-driving system. Transportation Research Part D: Transport and Environment, 14(6):400–410, 2009.
Martin Behnke and Thomas Kirschstein. The impact of path selection on GHG emissions in city logistics.Transportation Research Part E: Logistics and Transportation Review, 106:320–336, 2017.
Tolga Bekta¸s and Gilbert Laporte. The pollution-routing problem.Transportation Research Part B: Methodological, 45 (8):1232–1250, 2011.
Khaled Belhassine, Leandro C Coelho, Jacques Renaud, and Jean-Philippe Gagliardi. Improved home deliveries in congested areas using geospatial technology. Technical Report CIRRELT-2018-02, Montreal, Canada, 2018.
Gerth Stølting Brodal and Riko Jacob. Time-dependent networks as models to achieve fast exact time-table queries.
Electronic Notes in Theoretical Computer Science, 92:3–15, 2004.
Tobia Calogiuri, Gianpaolo Ghiani, and Emanuela Guerriero. The time-dependent quickest path problem: Properties and bounds. Networks, 66(2):112–117, 2015.
Said Dabia, Emrah Demir, and Tom Van Woensel. An exact approach for a variant of the pollution-routing problem.
Transportation Science, 51(2):607–628, 2017.
Brian C Dean. Shortest paths in fifo time-dependent networks: Theory and algorithms. Technical report, Massachusetts Institute of Technology, 2004.
Frank Dehne, Masoud T Omran, and J¨org-R¨udiger Sack. Shortest paths in time-dependent FIFO networks.Algorithmica, 62(1-2):416–435, 2012.
Daniel Delling and Giacomo Nannicini. Core routing on dynamic time-dependent road networks. INFORMS Journal on Computing, 24(2):187–201, 2012.
Emrah Demir, Tolga Bekta¸s, and Gilbert Laporte. An adaptive large neighborhood search heuristic for the pollution-routing problem. European Journal of Operational Research, 223(2):346–359, 2012.
Emrah Demir, Tolga Bekta¸s, and Gilbert Laporte. The bi-objective pollution-routing problem. European Journal of Operational Research, 232(3):464–478, 2014a.
Emrah Demir, Tolga Bekta¸s, and Gilbert Laporte. A review of recent research on green road freight transportation.
European Journal of Operational Research, 237(3):775–793, 2014b.
Marco Di Bartolomeo, Enrico Grande, Gaia Nicosia, and Andrea Pacifici. Cheapest paths in dynamic networks.Networks, 55(2):23–32, 2017.
Jan Fabian Ehmke, Ann Melissa Campbell, and Barrett W Thomas. Data-driven approaches for emissions-minimized paths in urban areas. Computers & Operations Research, 67:34–47, 2016a.
Jan Fabian Ehmke, Ann Melissa Campbell, and Barrett W Thomas. Vehicle routing to minimize time-dependent emissions in urban areas. European Journal of Operational Research, 251(2):478–494, 2016b.
Miguel Andres Figliozzi. The impacts of congestion on time-definitive urban freight distribution networks CO2 emission levels: Results from a case study in Portland, Oregon. Transportation Research Part C: Emerging Technologies, 19 (5):766–778, 2011.
Bernhard Fleischmann, Martin Gietz, and Stefan Gnutzmann. Time-varying travel times in vehicle routing. Transporta-tion Science, 38(2):160–173, 2004.
Anna Franceschetti, Doroth´ee Honhon, Tom Van Woensel, Tolga Bekta¸s, and Gilbert Laporte. The time-dependent pollution-routing problem. Transportation Research Part B: Methodological, 56:265–293, 2013.
Anna Franceschetti, Emrah Demir, Doroth´ee Honhon, Tom Van Woensel, Gilbert Laporte, and Mark Stobbe. A meta-heuristic for the time-dependent pollution-routing problem. European Journal of Operational Research, 259(3):972–
991, 2017.
Thierry Garaix, Christian Artigues, Dominique Feillet, and Didier Josselin. Vehicle routing problems with alternative paths: An application to on-demand transportation. European Journal of Operational Research, 204(1):62–75, 2010.
Michel Gendreau, Gianpaolo Ghiani, and Emanuela Guerriero. Time-dependent routing problems: A review.Computers
& Operations Research, 64:189–197, 2015.
Gianpaolo Ghiani and Emanuela Guerriero. A lower bound for the quickest path problem. Computers & Operations Research, 50:154–160, 2014a.
Gianpaolo Ghiani and Emanuela Guerriero. A note on the Ichoua, Gendreau, and Potvin (2003) travel time model.
Transportation Science, 48(3):458–462, 2014b.
H. Heni, L. C. Coelho, and J. Renaud. Time-dependent quickest path problem with emission minimization. Technical Report CIRRELT-2017-62, Montreal, Canada, 2017.
John Hickman, Dieter Hassel, Robert Joumard, Zissis Samaras, and S Sorenson. Methodology for calculating trans-port emissions and energy consumption. In European Commission, DG VII. Technical Report. 1999. URL http://www.transport-research.info/sites/default/files/project/documents/meet.pdf. Available online (ac-cessed on February 17, 2018).
Yixiao Huang, Lei Zhao, Tom Van Woensel, and Jean-Philippe Gross. Time-dependent vehicle routing problem with path flexibility. Transportation Research Part B: Methodological, 95:169–195, 2017.
Soumia Ichoua, Michel Gendreau, and Jean Yves Potvin. Vehicle dispatching with time-dependent travel times.European Journal of Operational Research, 144(2):379–396, 2003.
O Jabali, T Van Woensel, and A.-G. de Kok. Analysis of travel times and CO2 emissions in time-dependent vehicle routing. Production and Operations Management, 21(6):1060–1074, 2012.
Adrianus Leendert Kok, EW Hans, and JMJ Schutten. Vehicle routing under time-dependent travel times: the impact of congestion avoidance. Computers & Operations Research, 39(5):910–918, 2012.
Raphael Kramer, Nelson Maculan, Anand Subramanian, and Thibaut Vidal. A speed and departure time optimization algorithm for the pollution-routing problem. European Journal of Operational Research, 247(3):782–787, 2015a.
Raphael Kramer, Anand Subramanian, Thibaut Vidal, and F Cabral Luc´ıdio dos Anjos. A matheuristic approach for the pollution-routing problem. European Journal of Operational Research, 243(2):523–539, 2015b.
David SW Lai, Ozgun Caliskan Demirag, and Janny MY Leung. A tabu search heuristic for the heterogeneous vehicle routing problem on a multigraph. Transportation Research Part E: Logistics and Transportation Review, 86:32–52, 2016.
Adam N Letchford, Saeideh D Nasiri, and Amar Oukil. Pricing routines for vehicle routing with time windows on road networks. Computers & Operations Research, 51:331–337, 2014.
Jiani Qian and Richard Eglese. Fuel emissions optimization in vehicle routing problems with time-varying speeds.
European Journal of Operational Research, 248(3):840–848, 2016.
Kiseok Sung, Michael GH Bell, Myeongki Seong, and Soondal Park. Shortest paths in a network with time-dependent flow speeds. European Journal of Operational Research, 121(1):32–39, 2000.
Eric Taillard, Philippe Badeau, Michel Gendreau, Fran¸´ cois Guertin, and Jean-Yves Potvin. A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Science, 31(2):170–186, 1997.
Hamza Ben Ticha, Nabil Absi, Dominique Feillet, and Alain Quilliot. Empirical analysis for the VRPTW with a multigraph representation for the road network. Computers & Operations Research, 88:103–116, 2017.
Transports Canada. Transportation in Canada 2016. https://www.tc.gc.ca/media/documents/policy/
comprehensive_report_2016.pdf, 2017. Available online (accessed on February 17, 2018).
Tom Van Woensel, Laoucine Kerbache, Herbert Peremans, and Nico Vandaele. Vehicle routing with dynamic travel times: A queueing approach. European Journal of Operational Research, 186(3):990–1007, 2008.
L. Wen, B. C¸ atay, and R. Eglese. Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge. European Journal of Operational Research, 236(3):915–923, 2014.
Yiyong Xiao and Abdullah Konak. The heterogeneous green vehicle routing and scheduling problem with time-varying traffic congestion. Transportation Research Part E: Logistics and Transportation Review, 88:146–166, 2016.
Emmanouil E Zachariadis and Chris T Kiranoudis. A strategy for reducing the computational complexity of local search-based methods for the vehicle routing problem. Computers & Operations Research, 37(12):2089–2105, 2010.