Determining time-dependent minimum cost paths under several objectives (Q1722968): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q128560212, #quickstatements; #temporary_batch_1726341741784
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2910351011 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2847380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The time-dependent quickest path problem: Properties and bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: The shortest route through a network with time-dependent internodal transit times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for minimum-cost paths in time-dependent networks with waiting policies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths in time-dependent FIFO networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Core Routing on Dynamic Time-Dependent Road Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive large neighborhood search heuristic for the pollution-routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bi-objective pollution-routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review of recent research on green road freight transportation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cheapest paths in dynamic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data-driven approaches for emissions-minimized paths in urban areas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle routing to minimize time-dependent emissions in urban areas / rank
 
Normal rank
Property / cites work
 
Property / cites work: A metaheuristic for the time-dependent pollution-routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the quickest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle dispatching with time-dependent travel times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle routing under time-dependent travel times: the impact of congestion avoidance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fuel emissions optimization in vehicle routing problems with time-varying speeds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths in a network with time-dependent flow speeds / rank
 
Normal rank
Property / cites work
 
Property / cites work: The accuracy of carbon emission and fuel consumption computations in green vehicle routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle routing with dynamic travel times: a queueing approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cost VRP with time-dependent speed data and congestion charge / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128560212 / rank
 
Normal rank

Latest revision as of 20:23, 14 September 2024

scientific article
Language Label Description Also known as
English
Determining time-dependent minimum cost paths under several objectives
scientific article

    Statements

    Determining time-dependent minimum cost paths under several objectives (English)
    0 references
    0 references
    0 references
    0 references
    19 February 2019
    0 references
    time-dependent networks
    0 references
    congestion
    0 references
    emission
    0 references
    quickest path
    0 references
    bounds
    0 references
    label-setting algorithm
    0 references
    link travel time
    0 references
    flow speed model
    0 references
    0 references

    Identifiers