Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem (Q2367016): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: VRP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A set‐partitioning‐based exact algorithm for the vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Savings Based Heuristics for the Delivery Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: State-space relaxation procedures for the computation of bounds to routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3815115 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tabu Search Heuristic for the Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Future paths for integer programming and links to artificial intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds and Heuristics for Capacitated Routing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Routing under Capacity and Distance Restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751354 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Solutions of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation techniques for the vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The savings algorithm for the vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—An Effective Heuristic for the <i>M</i>-Tour Traveling Salesman Problem with Some Side Conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangean relaxation heuristic for vehicle routing / rank
 
Normal rank

Latest revision as of 17:20, 17 May 2024

scientific article
Language Label Description Also known as
English
Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
scientific article

    Statements

    Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem (English)
    0 references
    16 August 1993
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references