Adaptive memory programming: a unified view of metaheuristics
From MaRDI portal
Publication:5954822
Recommendations
- scientific article; zbMATH DE number 1054674
- Adaptive memory programming for constrained global optimization
- Memory and learning in metaheuristics
- Adaptive memory search for Boolean optimization problems
- An adaptive membrane algorithm for solving combinatorial optimization problems
- scientific article; zbMATH DE number 2209654
- scientific article; zbMATH DE number 2040675
- scientific article; zbMATH DE number 1857493
Cites work
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 1054674 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 1488087 (Why is no real title available?)
- scientific article; zbMATH DE number 1488089 (Why is no real title available?)
- scientific article; zbMATH DE number 1488097 (Why is no real title available?)
- A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem
- A Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Time Windows
- A Tabu Search Heuristic for the Vehicle Routing Problem
- A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- A genetic approach to the quadratic assignment problem
- A heuristic column generation method for the heterogeneous fleet VRP
- A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem
- A new adaptive multi-start technique for combinatorial global optimizations
- Algorithms for the Vehicle Routing Problems with Time Deadlines
- An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
- An improved annealing scheme for the QAP
- Ant colonies for the quadratic assignment problem
- Comparison of iterative searches for the quadratic assignment problem
- Cooling Schedules for Optimal Annealing
- Diversification strategies in tabu search algorithms for the maximum clique problem
- Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs
- Evolution algorithms in combinatorial optimization
- Future paths for integer programming and links to artificial intelligence
- Genetic and hybrid algorithms for graph coloring
- Greedy randomized adaptive search procedures
- Heuristic methods for large centroid clustering problems
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- On the quality of local search for the quadratic assignment problem
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
- Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
- Parallel iterative search methods for vehicle routing problems
- Probabilistic diversification and intensification in local search for vehicle routing
- Some Convergence Results for Probabilistic Tabu Search
- Tabu Search—Part I
- Tabu Search—Part II
- The Reactive Tabu Search
- The Vehicle Routing Problem with Time Windows Part I: Tabu Search
- The Vehicle Routing Problem with Time Windows Part II: Genetic Search
- Using tabu search techniques for graph coloring
- Vehicle Routeing with Multiple Use of Vehicles
Cited in
(49)- Combining metaheuristics with mathematical programming, constraint programming and machine learning
- Learning variable neighborhood search for a scheduling problem with time windows and rejections
- Metaheuristics for a scheduling problem with rejection and tardiness penalties
- COSEARCH: A parallel cooperative metaheuristic
- A hybrid scatter search/electromagnetism meta-heuristic for project scheduling
- Diversification strategies in local search for a nonbifurcated network loading problem
- An adaptive memory programming method for risk logistics operations
- Meta-heuristics for stable scheduling on a single machine
- Adaptive memory algorithm with the covering recombination operator
- A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem
- Adaptive memory programming: local search parallel algorithms for phylogenetic tree construc\-tion
- Un algorithme GRASP pour le problème de planification de techniciens et d'interventions pour les télécommunications
- Solving the vehicle routing problem with adaptive memory programming methodology
- A multi‐agent system for the decentralized resource‐constrained multi‐project scheduling problem
- A hybrid evolution strategy for the open vehicle routing problem
- Global sensing search for nonlinear global optimization
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
- A survey for the quadratic assignment problem
- Hybrid simulated annealing with memory: an evolution-based diversification approach
- A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling
- Initialization of metaheuristics: comprehensive review, critical analysis, and research directions
- Adaptive memory programming for the vehicle routing problem with multiple trips
- A survey of the standard location-routing problem
- A survey on optimization metaheuristics
- Adaptive memory in multistart heuristics for multicommodity network design
- scientific article; zbMATH DE number 2209665 (Why is no real title available?)
- Coalition-based metaheuristic: a self-adaptive metaheuristic using reinforcement learning and mimetism
- A black-box scatter search for optimization problems with integer variables
- scientific article; zbMATH DE number 2040675 (Why is no real title available?)
- Adaptive neighborhood simulated annealing for the heterogeneous fleet vehicle routing problem with multiple cross-docks
- Metaheuristics in combinatorial optimization
- Using a family of critical ratio-based approaches to minimize the number of tardy jobs in the job shop with sequence dependent setup times
- An iterative vertex coloring algorithm for vehicle routing problems with soft time windows for reverse logistics
- The late acceptance hill-climbing heuristic
- A GRASP-based approach for technicians and interventions scheduling for telecommunications
- Applications of optimization heuristics to estimation and modelling problems
- Graph coloring models and metaheuristics for packing applications
- A unified framework for population-based metaheuristics
- A TABU search heuristic for the team orienteering problem
- Optimisation under hybrid uncertainty
- Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization
- RAMP experiments in solving the uncapacitated facility location problem
- Metaheuristics: A Canadian Perspective
- The periodic Vehicle routing problem: classification and heuristic
- An adaptive memory matheuristic for the set orienteering problem
- Adaptive memory programming for constrained global optimization
- Memory and learning in metaheuristics
- An ant colony algorithm aimed at dynamic continuous optimization
This page was built for publication: Adaptive memory programming: a unified view of metaheuristics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5954822)
