Using tabu search for solving a dynamic multi-terminal truck dispatching problem (Q1388833): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching, Euler tours and the Chinese postman / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized insertion algorithm for the seriation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ejection chains, reference structures and alternating path methods for traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / 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: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem / rank
 
Normal rank

Latest revision as of 11:55, 28 May 2024

scientific article
Language Label Description Also known as
English
Using tabu search for solving a dynamic multi-terminal truck dispatching problem
scientific article

    Statements

    Using tabu search for solving a dynamic multi-terminal truck dispatching problem (English)
    0 references
    0 references
    0 references
    19 January 1999
    0 references
    compound moves
    0 references
    real-life tank truck dispatching
    0 references
    tabu search
    0 references

    Identifiers