Solving uncapacitated multilevel lot-sizing problems using a particle swarm optimization with flexible inertial weight

Authors:
Yi Han;Jiafu Tang;Iko Kaku;Lifeng Mu
Affiliations:
Key Laboratory of Integrated Automation of Process Industry of Ministry of Education, Northeastern University, Shenyang, 110004, China;Key Laboratory of Integrated Automation of Process Industry of Ministry of Education, Northeastern University, Shenyang, 110004, China;Department of Management Science and Engineering, Akita Prefectural University, Honjo, 015-0015, Japan;Key Laboratory of Integrated Automation of Process Industry of Ministry of Education, Northeastern University, Shenyang, 110004, China
Venue:
Computers & Mathematics with Applications
Year:
2009

Citing 10
Cited 8

Heuristics for multilevel lot-sizing with a bottleneck

Management Science
Optimal lot-sizing algorithms for complex product structures

Operations Research
Solving multi-item capacitated lot-sizing problems using variable redefinition

Operations Research
Capacitated lot sizing with setup times

Management Science
Improved algorithms for economic lot size problems

Operations Research
A Lagrangean-based heuristic for dynamic multilevel multiitem constrained lotsizing with setup times

Management Science
bc -- prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems

Management Science
Single-point stochastic search algorithms for the multi-level lot-sizing problem

Computers and Operations Research
A MAX-MIN ant system for unconstrained multi-level lot-sizing problems

Computers and Operations Research
An application of swarm optimization to nonlinear programming

Computers & Mathematics with Applications

Variable neighborhood search based approach for solving multilevel lot-sizing problems

ACE'10 Proceedings of the 9th WSEAS international conference on Applications of computer engineering
Integer linear programming model for multidimensional two-way number partitioning problem

Computers & Mathematics with Applications
Incorporating a database approach into the large-scale multi-level lot sizing problem

Computers & Mathematics with Applications
A variable neighborhood search based approach for uncapacitated multilevel lot-sizing problems

Computers and Industrial Engineering
Neighborhood search techniques for solving uncapacitated multilevel lot-sizing problems

Computers and Operations Research
A novel parallel hybrid intelligence optimization algorithm for a function approximation problem

Computers & Mathematics with Applications
Discrete Particle Swarm Optimization for the Multi-Level Lot-Sizing Problem

International Journal of Applied Metaheuristic Computing
Collaborative production planning with production time windows and order splitting in make-to-order manufacturing

Computers and Industrial Engineering

Quantified Score

Hi-index	0.09

Visualization

Abstract

The multilevel lot-sizing (MLLS) problem is a key production planning problem in materials requirements planning (MRP) system. The MLLS problem deals with determining the production lot-sizes of various items appearing in the product structure over a given finite planning horizon to minimize the production cost, the inventory carrying cost, the back ordering cost and etc. This paper proposed a particle swarm optimization (PSO) algorithm for solving the uncapacitated MLLS problem with assembly structure. All the mathematical operators in our algorithm are redefined and the inertial weight parameter can be either a negative real number or a positive one. The feasibility and effectiveness of our algorithm are investigated by comparing the experimental results with those of a genetic algorithm (GA).