Memory and Learning in Metaheuristics
From MaRDI portal
Publication:2866122
DOI10.1007/978-3-642-29694-9_18zbMath1277.68244OpenAlexW189010153MaRDI QIDQ2866122
Publication date: 13 December 2013
Published in: Studies in Computational Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-29694-9_18
Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cites Work
- Ant colony optimization for continuous domains
- Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking
- Dynamic multi-criteria evaluation of co-evolution strategies for solving stock trading problems
- Hybrid scatter tabu search for unconstrained global optimization
- Synergetics. An introduction. Nonequilibrium phase transitions and self-organization in physics, chemistry, and biology. 3rd rev. and enl. ed
- MHD effects on the instability of thermocapillary convection in two-layer fluid system
- Integrating particle swarm optimization with genetic algorithms for solving nonlinear optimization problems
- A united search particle swarm optimization algorithm for multiobjective scheduling problem
- Handbook of swarm intelligence. Concepts, principles and applications
- Controlling chaos by an improved estimation of distribution algorithm
- Implementation of scatter search for multi-objective optimization: a comparative study
- Tabu search with path relinking for an integrated production-distribution problem
- A heterogeneous cooperative parallel search of branch-and-bound method and tabu search algorithm
- A survey of very large-scale neighborhood search techniques
- HPBILc: A histogram-based EDA for continuous optimization
- GRASP with path-relinking for the generalized quadratic assignment problem
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- Towards a new evolutionary computation. Advances on estimation of distribution algorithms.
- Optimal allocation problem using genetic algorithm
- An effective and simple heuristic for the set covering problem
- A tabu search algorithm for the single machine total weighted tardiness problem
- Active-guided evolution strategies for large-scale capacitated vehicle routing problems
- A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries
- Reactive search and intelligent optimization
- Scatter search for the single source capacitated facility location problem
- Extending a class of continuous estimation of distribution algorithms to dynamic problems
- A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows
- Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem
- Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem
- A hybrid method based on linear programming and tabu search for routing of logging trucks
- Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
- Continuous ant colony system and tabu search algorithms hybridized for global minimization of continuous multi-minima functions
- A multi-level search strategy for the 0-1 multidimensional knapsack problem
- A path relinking approach for the team orienteering problem
- A hybrid scatter search heuristic for personalized crew rostering in the airline industry
- Solving constrained optimization problems using a novel genetic algorithm
- An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems
- Tuning metaheuristics. A machine learning Perspective
- Extended ant colony optimization for non-convex mixed integer nonlinear programming
- Computational intelligence. Collaboration, fusion and emergence
- GRASP and path relinking for the max-min diversity problem
- Distributed supply chain management using ant colony optimization
- A variable selection method based on Tabu search for logistic regression models
- Heuristics for the 0-1 multidimensional knapsack problem
- GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem
- The multidimensional 0-1 knapsack problem: an overview.
- Local search with memory: Benchmarking RTS
- Probabilistic diversification and intensification in local search for vehicle routing
- An ant colony optimization approach for the multidimensional knapsack problem
- MB-GNG: Addressing drawbacks in multi-objective optimization estimation of distribution algorithms
- New convergent heuristics for 0-1 mixed integer programming
- A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem
- An improved ant colony optimization for vehicle routing problem
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
- The development of a multi-objective tabu search algorithm for continuous optimisation problems
- Swarm intelligence. Introduction and applications
- A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
- Adaptive evolutionary programming based on reinforcement learning
- Scheduling flexible manufacturing cells using Tabu Search
- A Meta-RaPS for the early/tardy single machine scheduling problem
- A reactive tabu search for the vehicle routing problem
- Search Methodologies
- A survey of effective heuristics and their application to a variety of knapsack problems
- A tabu search procedure for coordinating production, inventory and distribution routing problems
- A combined global and local search method to deal with constrained optimization for continuous tabu search
- Tabu Search—Part I
- The Reactive Tabu Search
- A Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Time Windows
- Scatter Search and Path Relinking: Advances and Applications
- Cooperative co‐evolutionary scatter search for satellite module layout design
- A simple and efficient tabu search heuristic for solving the open vehicle routing problem
- Metaheuristics for Hard Optimization
- Outline for a Logical Theory of Adaptive Systems
- Introduction to evolutionary computing
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
