A unified framework for population-based metaheuristics
From MaRDI portal
Publication:646652
Recommendations
Cites work
- scientific article; zbMATH DE number 5117521 (Why is no real title available?)
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 1337869 (Why is no real title available?)
- scientific article; zbMATH DE number 976350 (Why is no real title available?)
- scientific article; zbMATH DE number 1480194 (Why is no real title available?)
- scientific article; zbMATH DE number 795587 (Why is no real title available?)
- scientific article; zbMATH DE number 3240118 (Why is no real title available?)
- A General Bounding Scheme for the Permutation Flow-Shop Problem
- A comprehensive review and evaluation of permutation flowshop heuristics
- A fast tabu search algorithm for the permutation flow-shop problem
- A framework for the description of evolutionary algorithms
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- A taxonomy of evolutionary algorithms in combinatorial optimization
- A unified modeling and solution framework for combinatorial optimization problems
- A unifying approach to heuristic search
- Adaptive memory programming: a unified view of metaheuristics
- An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem
- An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
- Convergence Rates for Markov Chains
- Differential evolution. A practical approach to global optimization. With CD-ROM.
- Evolution strategies. A comprehensive introduction
- Evolutionary computation: a unified approach.
- Finite Markov Chains and Algorithmic Applications
- Handbook of metaheuristics
- Improved particle swarm optimization combined with chaos
- Intensification and diversification with elite tabu search solutions for the linear ordering problem
- Introduction to evolutionary computing
- Modeling genetic algorithms with Markov chains.
- Modified simulated annealing algorithms for the flow shop sequencing problem
- Multicriteria scheduling
- New block properties for the permutation flow shop problem with application in tabu search
- On the convergence rates of genetic algorithms
- Optimal two- and three-stage production schedules with set-up time included
- Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
- Principles of scatter search
- Recent advances in memetic algorithms.
- Scatter Search and Path Relinking: Advances and Applications
- Scatter search --- wellsprings and challenges
- Scatter search. Methodology and implementation in C. With CD-ROM.
- Scheduling continuous casting of aluminum using a multiple objective ant colony optimization metaheuristic
- Scheduling flow shops using differential evolution algorithm
- Some aspects of scatter search in the flow-shop problem
- The particle swarm optimization algorithm: Convergence analysis and parameter selection
- The permutation flow shop with buffers: A tabu search approach
- Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art
- Variable neighborhood search: Principles and applications
Cited in
(10)- Metaheuristics for a scheduling problem with rejection and tardiness penalties
- An inverse power generation mechanism based fruit fly algorithm for function optimization
- Constrained particle swarm optimization for health maintenance in three-mass resonant servo control system with LuGre friction model
- Population migration: A meta-heuristics for stochastic approaches to constraint satisfaction problems
- An overview of population-based algorithms for multi-objective optimisation
- scientific article; zbMATH DE number 2040675 (Why is no real title available?)
- A population-based approach for hard global optimization problems based on dissimilarity measures
- A framework using nested partitions algorithm for convergence analysis of population distribution-based methods
- A partition-based convergence framework for population-based optimization algorithms
- A general model for meta-heuristic algorithms using the concept of fields of forces
This page was built for publication: A unified framework for population-based metaheuristics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q646652)
