Adaptive memory programming: a unified view of metaheuristics (Q5954822): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the quality of local search for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Reactive Tabu Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new adaptive multi-start technique for combinatorial global optimizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495191 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved annealing scheme for the QAP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Convergence Results for Probabilistic Tabu Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy randomized adaptive search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic and hybrid algorithms for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ant colonies for the quadratic assignment problem / 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: Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching / 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: 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: Q4352217 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive memory heuristic for a class of vehicle routing problems with minmax objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cooling Schedules for Optimal Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495203 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using tabu search techniques for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolution algorithms in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Vehicle Routing Problem with Time Windows Part II: Genetic Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Vehicle Routing Problem with Time Windows Part I: Tabu Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic diversification and intensification in local search for vehicle routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diversification strategies in tabu search algorithms for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495193 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel iterative search methods for vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Taboo Search Techniques for the Job Shop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of iterative searches for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic methods for large centroid clustering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic column generation method for the heterogeneous fleet VRP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle Routeing with Multiple Use of Vehicles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic approach to the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Vehicle Routing Problems with Time Deadlines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem / rank
 
Normal rank

Revision as of 22:38, 3 June 2024

scientific article; zbMATH DE number 1702052
Language Label Description Also known as
English
Adaptive memory programming: a unified view of metaheuristics
scientific article; zbMATH DE number 1702052

    Statements

    Adaptive memory programming: a unified view of metaheuristics (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2001
    0 references
    Metaheuristics
    0 references
    Evolutionary computations
    0 references
    Genetic algorithms
    0 references
    Multi-agent systems
    0 references
    Taboo search
    0 references
    Quadratic assignment
    0 references
    Vehicle routing
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers