Close category search window
 

A particle swarm approach for the MLLP

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Deroussi, L. ; LIMOS, Univ. Blaise Pascal, Montlucon, France ; Lemoine, D.

This contribution 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 originality of the proposed DPSO approach is that it is based on cost modification. By the way, we use PSO for that it has been developed: the continuous optimization. Each particle of the swarm is represented by a matrix of logistic costs. A sequential approach heuristic, using Wagner-Whitin algorithm, is then used to determine the associated production planning. The first results obtained are very encouraging. Our DPSO outperforms the results recently published with other nature-inspired algorithms.

Published in:
Computers & Industrial Engineering, 2009. CIE 2009. International Conference on

Date of Conference: 6-9 July 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.