A way to optimally solve a time-dependent vehicle routing problem with time windows (Q1002083): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.orl.2008.07.007 / rank
Normal rank
 
Property / cites work
 
Property / cites work: An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4532229 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new ILP-based refinement heuristic for vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time dependent vehicle routing problem with a multi ant colony system / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient transformation of the generalized vehicle routing 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: A dynamic vehicle routing problem with time-dependent travel times / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the asymmetrical capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Transformation Of The Generalized Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general heuristic for vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle routing and scheduling with dynamic travel times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic algorithm for the asymmetric capacitated vehicle routing problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ORL.2008.07.007 / rank
 
Normal rank

Latest revision as of 12:09, 10 December 2024

scientific article
Language Label Description Also known as
English
A way to optimally solve a time-dependent vehicle routing problem with time windows
scientific article

    Statements

    A way to optimally solve a time-dependent vehicle routing problem with time windows (English)
    0 references
    0 references
    0 references
    0 references
    23 February 2009
    0 references
    vehicle routing
    0 references
    time window
    0 references
    time-dependent costs
    0 references

    Identifiers