Determining time-dependent minimum cost paths under several objectives

DOI10.1016/J.COR.2019.01.007MaRDI QIDQ1722968zbMATH OpenOpenAlexWikidataFDO

Authors Hamza Heni, Leandro C. Coelho, Jacques Renaud

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

zbMATH Keywords

boundscongestionquickest pathlabel-setting algorithmemissiontime-dependent networksflow speed modellink travel time

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Transportation, logistics and supply chain management (90B06)

Recommendations

• Finding least fuel emission paths in a network with time-varying speeds
• Vehicle routing to minimize time-dependent emissions in urban areas
• Fuel emissions optimization in vehicle routing problems with time-varying speeds
• Optimizing the composite cost involved in road motor-transporting trucks by taking into account traffic condition
• An emission-minimizing vehicle routing problem with heterogeneous vehicles and pathway selection

Cites work

• A lower bound for the quickest path problem
• A metaheuristic for the time-dependent pollution-routing problem
• A review of recent research on green road freight transportation
• Algorithms for minimum-cost paths in time-dependent networks with waiting policies
• An adaptive large neighborhood search heuristic for the pollution-routing problem
• Cheapest paths in dynamic networks
• Core routing on dynamic time-dependent road networks
• Data-driven approaches for emissions-minimized paths in urban areas
• Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge
• Fuel emissions optimization in vehicle routing problems with time-varying speeds
• Minimum cost VRP with time-dependent speed data and congestion charge
• Shortest paths in a network with time-dependent flow speeds
• Shortest paths in time-dependent FIFO networks
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• The accuracy of carbon emission and fuel consumption computations in green vehicle routing
• The bi-objective pollution-routing problem
• The shortest route through a network with time-dependent internodal transit times
• The time-dependent quickest path problem: properties and bounds
• Time-dependent networks as models to achieve fast exact time-table queries
• Vehicle dispatching with time-dependent travel times
• Vehicle routing to minimize time-dependent emissions in urban areas
• Vehicle routing under time-dependent travel times: the impact of congestion avoidance
• Vehicle routing with dynamic travel times: a queueing approach

Cited in

(7)

• Optimizing the composite cost involved in road motor-transporting trucks by taking into account traffic condition
• Finding least fuel emission paths in a network with time-varying speeds
• Time dependency in multiple objective dynamic programming
• Data-driven approaches for emissions-minimized paths in urban areas
• Finding efficient and environmentally friendly paths for risk-averse freight carriers
• The time-dependent shortest path and vehicle routing problem
• Finding cheapest deadline paths

This page was built for publication: Determining time-dependent minimum cost paths under several objectives

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1722968)