Discrete Particle Swarm Optimization for the Multi-Level Lot-Sizing Problem

Authors:
Laurent Deroussi;David Lemoine
Affiliations:
Blaise Pascal University, Clermont-Ferrand II, France;Ecole des Mines de Nantes, France
Venue:
International Journal of Applied Metaheuristic Computing
Year:
2011

Citing 6
Cited 0

Optimal lot-sizing algorithms for complex product structures

Operations Research
Determining lot sizes and resource requirements: A review

Operations Research
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
Solving uncapacitated multilevel lot-sizing problems using a particle swarm optimization with flexible inertial weight

Computers & Mathematics with Applications
Computational complexity of uncapacitated multi-echelon production planning problems

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a Discrete Particle Swarm Optimization (DPSO) approach for the Multi-Level Lot-Sizing Problem (MLLP), which is an uncapacitated lot sizing problem dedicated to materials requirements planning (MRP) systems. The proposed DPSO approach is based on cost modification and uses PSO in its original form with continuous velocity equations. Each particle of the swarm is represented by a matrix of logistic costs. A sequential approach heuristic, using Wagner-Whitin algorithm, is used to determine the associated production planning. The authors demonstrate that any solution of the MLLP can be reached by particles. The sequential heuristic is a subjective function from the particles space to the set of the production plans, which meet the customer's demand. The authors test the DPSO Scheme on benchmarks found in literature, more specifically the unique DPSO that has been developed to solve the MLLP.