Comparison among three algorithms to solve unconstrained MLLS problems

MaRDI QIDQ3016792zbMATH OpenFDO

Authors Yi Han, Jiafu Tang, Jianhu Cai, Gengui Zhou

Publication date 19 July 2011

zbMATH Keywords

genetic algorithmlot-sizing problemparticle swarm optimizationrepulsive operatorscatter search

Mathematics Subject Classification ID

Production models (90B30) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Solving uncapacitated multilevel lot-sizing problems using a particle swarm optimization with flexible inertial weight
• A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems
• A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems
• A MAX-MIN ant system for unconstrained multi-level lot-sizing problems
• scientific article; zbMATH DE number 5583359

Cited in

(3)

• A new hybrid algorithm of scatter search and Nelder-Mead algorithms to optimize joint economic lot sizing problem
• A MAX-MIN ant system for unconstrained multi-level lot-sizing problems
• Solving uncapacitated multilevel lot-sizing problems using a particle swarm optimization with flexible inertial weight

This page was built for publication: Comparison among three algorithms to solve unconstrained MLLS problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3016792)