Vehicle dispatching with time-dependent travel times (Q1869392): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4834367 / 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: Commuters' Paths with Penalties for Early or Late Arrival Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Appraisal of Some Shortest-Path Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Maximal Dynamic Flows from Static Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—An <i>n</i>-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5569992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest route with time dependent length of edges and limited delay possibilities in nodes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transit Service and Path Choice Models in Stochastic and Time-Dependent Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modelling Intra-City Time-Dependent Travel Speeds for Vehicle Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming Formulation of Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time depending shortest-path problems with applications to railway networks / 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: The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Shortest Paths in Acyclic Networks with Markovian Arc Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computer assistant for vehicle dispatching with learning capabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows / rank
 
Normal rank

Latest revision as of 15:11, 5 June 2024

scientific article
Language Label Description Also known as
English
Vehicle dispatching with time-dependent travel times
scientific article

    Statements

    Vehicle dispatching with time-dependent travel times (English)
    0 references
    0 references
    0 references
    0 references
    10 April 2003
    0 references
    0 references
    transportation
    0 references
    vehicle routing
    0 references
    time-dependent
    0 references
    tabu search
    0 references
    0 references
    0 references
    0 references