Determining time-dependent minimum cost paths under several objectives
DOI10.1016/j.cor.2019.01.007zbMath1458.90100OpenAlexW2910351011WikidataQ128560212 ScholiaQ128560212MaRDI QIDQ1722968
Jacques Renaud, Leandro C. Coelho, Hamza Heni
Publication date: 19 February 2019
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/20.500.11794/37274
boundscongestionemissionquickest pathlabel-setting algorithmtime-dependent networksflow speed modellink travel time
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)
Related Items (1)
Cites Work
- Unnamed Item
- A review of recent research on green road freight transportation
- Fuel emissions optimization in vehicle routing problems with time-varying speeds
- Vehicle routing to minimize time-dependent emissions in urban areas
- A lower bound for the quickest path problem
- Minimum cost VRP with time-dependent speed data and congestion charge
- Data-driven approaches for emissions-minimized paths in urban areas
- The accuracy of carbon emission and fuel consumption computations in green vehicle routing
- A metaheuristic for the time-dependent pollution-routing problem
- Vehicle routing under time-dependent travel times: the impact of congestion avoidance
- Vehicle dispatching with time-dependent travel times
- Shortest paths in a network with time-dependent flow speeds
- An adaptive large neighborhood search heuristic for the pollution-routing problem
- The bi-objective pollution-routing problem
- Vehicle routing with dynamic travel times: a queueing approach
- Shortest paths in time-dependent FIFO networks
- Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge
- The shortest route through a network with time-dependent internodal transit times
- Core Routing on Dynamic Time-Dependent Road Networks
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
- Cheapest paths in dynamic networks
- The time-dependent quickest path problem: Properties and bounds
- Algorithms for minimum-cost paths in time-dependent networks with waiting policies
This page was built for publication: Determining time-dependent minimum cost paths under several objectives
