Exact and heuristic algorithms for the vehicle routing problem with multiple interdependent time windows (Q2475859): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2007.02.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2126693962 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59389719 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified tabu search heuristic for vehicle routing problems with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A period vehicle routing case study / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new heuristic for the period traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The period traveling salesman problem: A new heuristic algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An asynchronous parallel metaheuristic for the period vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4955267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Vehicle Routing Problem with Time Windows: Minimizing Route Duration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5301721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: D-Ants: Savings Based Ants divide and conquer the vehicle routing problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved heuristic for the period traveling salesman problem / rank
 
Normal rank

Latest revision as of 18:01, 27 June 2024

scientific article
Language Label Description Also known as
English
Exact and heuristic algorithms for the vehicle routing problem with multiple interdependent time windows
scientific article

    Statements

    Exact and heuristic algorithms for the vehicle routing problem with multiple interdependent time windows (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    11 March 2008
    0 references
    vehicle routing problem
    0 references
    multiple time windows
    0 references
    interdependent time windows
    0 references

    Identifiers