Metaheuristic for the capacitated lot-sizing problem: a software tool for MPS elaboration Online publication date: Thu, 30-Sep-2010
by Michel Gourgand, David Lemoine, Sylvie Norre
International Journal of Mathematics in Operational Research (IJMOR), Vol. 2, No. 6, 2010
Abstract: The master production schedule elaboration plays a major part in tactical planning. Among mathematical models which deal with the tactical planning, a particular one is dedicated to it: the capacitated lot-sizing problem. Literature about its resolution is huge, but few metaheuristics have been developed in order to solve it: we propose to use optimisation methods based on a simulated annealing: the data encoding are based on a production planning matrix and the neighbourhood system is maked up of several possible moves. We also proposed a bi-objective function which integrates logistic costs and an evaluation of the degree of the capacities' temporarily leave the set of feasible solutions in order to escape from local minimas. We have tested our optimisation methods on benchmarks from the literature and some best results are outperformed. These methods have been integrated into a software tool.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook