Variable neighborhood descent for solving the vehicle routing problem with time windows (Q1687673): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.endm.2017.03.023 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2606491916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solve the vehicle routing problem with time windows via a genetic algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints / rank
 
Normal rank

Latest revision as of 22:19, 14 July 2024

scientific article
Language Label Description Also known as
English
Variable neighborhood descent for solving the vehicle routing problem with time windows
scientific article

    Statements

    Variable neighborhood descent for solving the vehicle routing problem with time windows (English)
    0 references
    0 references
    0 references
    4 January 2018
    0 references
    combinatorial optimization
    0 references
    transportation
    0 references
    VRPTW
    0 references
    VND
    0 references

    Identifiers