Scatter search and star-paths: Beyond the genetic metaphor
From MaRDI portal
Publication:1908997
DOI10.1007/BF01719256zbMath0843.90081OpenAlexW1974485962MaRDI QIDQ1908997
Publication date: 1995
Published in: OR Spektrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01719256
Related Items
Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue, Mathematical programming based heuristics for the 0--1 MIP: a survey, Metaheuristics: A bibliography, Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs, Genetic local search with distance preserving recombination operator for a vehicle routing problem., Scatter search for the 0-1 multidimensional knapsack problem, Infeasible/feasible search trajectories and directional rounding in integer programming, A memetic algorithm for the total tardiness single machine scheduling problem, Experiments concerning sequential versus simultaneous maximization of objective function and distance, On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs, Scatter search --- wellsprings and challenges, Continuous scatter search: an analysis of the integration of some combination methods and improvement strategies, Proposals for chunking and tabu search, Scatter search and bionomic algorithms for the aircraft landing problem
Uses Software
Cites Work
- Evolution algorithms in combinatorial optimization
- Tabu search techniques. A tutorial and an application to neural networks
- Evolution based learning in a job shop scheduling environment
- Genetic algorithms and tabu search: Hybrids for optimization
- An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search
- Hashing vectors for tabu search
- Pivot and Complement–A Heuristic for 0-1 Programming
- A Nonstandard Genetic Algorithm for the Nonlinear Transportation Problem
- Tabu Search—Part I
- Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristic
- An Approach to Zero-One Integer Programming
- A Note on Linear Programming and Integer Feasibility
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item