Penalty function approach for the mixed discrete nonlinear problems by particle swarm optimization
DOI10.1007/S00158-006-0021-2zbMATH Open1245.90149OpenAlexW2074071084MaRDI QIDQ445480FDOQ445480
Satoshi Kitayama, Koetsu Yamazaki, M. Arakawa
Publication date: 25 August 2012
Published in: Structural and Multidisciplinary Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00158-006-0021-2
Recommendations
- A method for the mixed discrete non-linear problems by particle swarm optimization
- The hybrid tabu search and particle swarm optimization algorithm for mixed discrete optimization problems
- A particle swarm optimization algorithm for mixed-variable nonlinear problems
- A hybrid PSO algorithm based on penalty function for solving zero-one nonlinear programming problems
- Different approaches to particle swarm optimization for discrete systems
Approximation methods and heuristics in mathematical programming (90C59) Nonconvex programming, global optimization (90C26) Compliance or weight optimization in solid mechanics (74P05)
Cites Work
Cited In (6)
- A trust-region-based derivative free algorithm for mixed integer programming
- High-order solutions around triangular libration points in the elliptic restricted three-body problem and applications to low energy transfers
- Synchronous parallelization of particle swarm optimization with digital pheromones
- Adaptive range particle swarm optimization
- A mixed-discrete particle swarm optimization algorithm with explicit diversity-preservation
- Transfers between libration point orbits of Sun-Earth and Earth-Moon systems by using invariant manifolds
This page was built for publication: Penalty function approach for the mixed discrete nonlinear problems by particle swarm optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q445480)
