Adaptive memory programming: a unified view of metaheuristics
From MaRDI portal
Publication:5954822
DOI10.1016/S0377-2217(00)00268-XzbMath1051.90032OpenAlexW4376522562WikidataQ115202287 ScholiaQ115202287MaRDI QIDQ5954822
Jean-Yves Potvin, Luca Maria Gambardella, Éric D. Taillard, Michel Gendreau
Publication date: 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(00)00268-x
Genetic algorithmsMulti-agent systemsMetaheuristicsEvolutionary computationsQuadratic assignmentTaboo searchVehicle routing
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Global sensing search for nonlinear global optimization, Hybrid simulated annealing with memory: an evolution-based diversification approach, Optimisation under hybrid uncertainty, Using a family of critical ratio-based approaches to minimize the number of tardy jobs in the job shop with sequence dependent setup times, Adaptive memory programming for the vehicle routing problem with multiple trips, A survey for the quadratic assignment problem, A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling, Coalition-based metaheuristic: a self-adaptive metaheuristic using reinforcement learning and mimetism, Adaptive neighborhood simulated annealing for the heterogeneous fleet vehicle routing problem with multiple cross-docks, Learning variable neighborhood search for a scheduling problem with time windows and rejections, Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization, Initialization of metaheuristics: comprehensive review, critical analysis, and research directions, Metaheuristics: A Canadian Perspective, An adaptive memory matheuristic for the set orienteering problem, A survey of the standard location-routing problem, The late acceptance hill-climbing heuristic, A unified framework for population-based metaheuristics, Combining metaheuristics with mathematical programming, constraint programming and machine learning, Graph Coloring Models and Metaheuristics for Packing Applications, A survey on optimization metaheuristics, An ant colony algorithm aimed at dynamic continuous optimization, Meta-heuristics for stable scheduling on a single machine, Applications of optimization heuristics to estimation and modelling problems, Combining metaheuristics with mathematical programming, constraint programming and machine learning, Adaptive memory programming: local search parallel algorithms for phylogenetic tree construc\-tion, A GRASP-based approach for technicians and interventions scheduling for telecommunications, A TABU search heuristic for the team orienteering problem, A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem, Solving the vehicle routing problem with adaptive memory programming methodology, Metaheuristics for a scheduling problem with rejection and tardiness penalties, An adaptive memory programming method for risk logistics operations, A multi‐agent system for the decentralized resource‐constrained multi‐project scheduling problem, COSEARCH: A parallel cooperative metaheuristic, A two-phase approach for jointly determining the lot size and delivery policy in a vendor-buyer integrated system with rework, A black-box scatter search for optimization problems with integer variables, Un algorithme GRASP pour le problème de planification de techniciens et d'interventions pour les télécommunications, A hybrid evolution strategy for the open vehicle routing problem, The periodic Vehicle routing problem: classification and heuristic, A hybrid scatter search/electromagnetism meta-heuristic for project scheduling, Diversification strategies in local search for a nonbifurcated network loading problem, Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods, Metaheuristics in combinatorial optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Using tabu search techniques for graph coloring
- An improved annealing scheme for the QAP
- Evolution algorithms in combinatorial optimization
- A new adaptive multi-start technique for combinatorial global optimizations
- A genetic approach to the quadratic assignment problem
- An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
- On the quality of local search for the quadratic assignment problem
- Heuristic methods for large centroid clustering problems
- Greedy randomized adaptive search procedures
- Future paths for integer programming and links to artificial intelligence
- Diversification strategies in tabu search algorithms for the maximum clique problem
- Genetic and hybrid algorithms for graph coloring
- Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs
- Probabilistic diversification and intensification in local search for vehicle routing
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem
- Ant colonies for the quadratic assignment problem
- Cooling Schedules for Optimal Annealing
- Some Convergence Results for Probabilistic Tabu Search
- Tabu Search—Part I
- Tabu Search—Part II
- Comparison of iterative searches for the quadratic assignment problem
- Parallel iterative search methods for vehicle routing problems
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
- The Reactive Tabu Search
- Algorithms for the Vehicle Routing Problems with Time Deadlines
- A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows
- A Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Time Windows
- A heuristic column generation method for the heterogeneous fleet VRP
- Vehicle Routeing with Multiple Use of Vehicles
- A Tabu Search Heuristic for the Vehicle Routing Problem
- Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
- The Vehicle Routing Problem with Time Windows Part I: Tabu Search
- The Vehicle Routing Problem with Time Windows Part II: Genetic Search
