全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

MIP Formulations and Metaheuristics for Multi-Item Capacitated Lot-Sizing Problem with Non-Customer Specific Production Time Windows and Setup Times

DOI: 10.4236/ajor.2017.72006, PP. 83-98

Keywords: Variable Neighborhood Decomposition Search, Formatting, Metaheuristics, Production Planning, Capacitated Lot Sizing, Mixed Integer Programming, Matheuristics, Production Time Windows

Full-Text   Cite this paper   Add to My Lib

Abstract:

Our research focuses on the development of two cooperative approaches for resolution of the multi-item capacitated lot-sizing problems with time windows and setup times (MICLSP-TW-ST). In this paper we combine variable neighborhood search and accurate mixed integer programming (VNS-MIP) to solve MICLSP-TW-ST. It concerns so a particularly important and difficult problem in production planning. This problem is NP-hard in the strong sense. Moreover, it is very difficult to solve with an exact method; it is for that reason we have made use of the approximate methods. We improved the variable neighborhood search (VNS) algorithm, which is efficient for solving hard combinatorial optimization problems. This problem can be viewed as an optimization problem with mixed variables (binary variables and real variables). The new VNS algorithm was tested against 540 benchmark problems. The performance of most of our approaches was satisfactory and performed better than the algorithms already proposed in the literature.

References

[1]  Kuik, R. and Salomon, M. (1990) Multi-Level Lot-Sizing Problem. Evaluation of a Simulated Annealing Heuristic. European Journal of Operational Research, 45, 25-37.
https://hdl.handle.net/11245/1.431251
https://doi.org/10.1016/0377-2217(90)90153-3
[2]  Brahimi, N., Dauzère-Pérès, S., Najid, N. and Nordli, A. (2003) Alagrangian Relaxation Heuristic for the Capacitated Single Item Lot Sizing Problem with Time Windows. 6th Workshop on Models and Algorithms for Planning and Scheduling Problems, Aussois, 30 March-4 April 2003, 105-106.
[3]  Richter, K. and Sombrutzki, M. (2000) Remanufacturing Planning for the Reverse Wagner/Whitin Models. European Journal of Operational Research, 121, 304-315.
http://www.sciencedirect.com/science/article/pii/S0377-2217(99)00219-2
https://doi.org/10.1016/S0377-2217(99)00219-2
[4]  Trigeiro, W., Thomas, L.J. and McLain, J.O. (1989) Capacitated Lot-Sizing with Setup Times. Management Science, 35, 353-366.
https://doi.org/10.1287/mnsc.35.3.353
[5]  Suerie, C. and Stadtler, H. (2003) The Capacitated Lot-Sizing Problem with Linked Lot Sizes. Management Science, 49, 1039-1054.
https://doi.org/10.1287/mnsc.49.8.1039.16406
[6]  Wagner, H.M. and Whitin, T.M. (1958) A Dynamic Version of the Economic Lot Size Model. Management Science, 5, 89-96.
https://doi.org/10.1287/mnsc.5.1.89
[7]  Golany, B., Yang, J. and Yu, G. (2001) Economic Lot-Sizing with Remanufacturing Options. IIE Transactions, 33, 995-1003.
https://doi.org/10.1080/07408170108936890
[8]  Lee, C.Y., Cetinkaya, S. and Wagelmans, A.P.M. (2001) A Dynamic Lot-Sizing Model with Demand Time Windows. Management Science, 47, 1384-1395.
http://www.jstor.org/stable/822493
https://doi.org/10.1287/mnsc.47.10.1384
[9]  Dauzère-Pérès, S., Brahimi, N., Najid, N. and Nordli, A. (2002) The Single-Item Lot Sizing Problem with Time Windows. Technical Report, 02/4/AUTO, Ecole des Mines de Nantes, France.
[10]  Wolsey, L.A. (2006) Lot-Sizing with Production and Delivery Time Windows. Mathematical Programming, 107, 471-489.
http://link.springer.com/article/10.1007%2Fs10107-005-0675-3
https://doi.org/10.1007/s10107-005-0675-3
[11]  Van den Heuvel, W. and Wagelmans, A. (2008) Four Equivalent Lot-Sizing Models. Operations Research Letters, 36, 465-470.
https://doi.org/10.1016/j.orl.2007.12.003
[12]  Pochet, Y. and Wolsey, L.A. (1994) Polyhedral for Lot-Sizing with Wagner-Whitin Costs. Mathematical Programming, 67, 297-323.
https://doi.org/10.1007/BF01582225
[13]  Karimi, B., FatemiGhomi, S.M.T. and Wilson, J.M. (2003) The Capacitated Lot Sizing Problem: A Review of Models and Algorithms. Omega, 31, 365-378.
https://doi.org/10.1016/S0305-0483(03)00059-8
[14]  Hansen, P. and Mladenovic. N. (2001) Variable Neighborhood Search: Principles and Applications. European Journal of Operational Research, 130, 449-467.
http://dblp.uni-trier.de/db/journals/eor/eor130.html#HansenM01
https://doi.org/10.1016/S0377-2217(00)00100-4
[15]  Mladenovic, N. and Hansen, P. (1997) Variable Neighborhood Search, Computers and Operations Research, 24, 1097-1100.
https://doi.org/10.1016/S0305-0548(97)00031-2
[16]  Lourenco, H.R., Martin, O.C. and Stützle, T. (2002) Iterated Local Search. In: Glover, F. and Kochenberger, G., Eds., Handbook of Metaheuristics, Kluwer, Boston, 321-353.
https://arxiv.org/abs/math/0102188v1
[17]  NadjibBrahimi, N., Dauzère-Pérès, S. and Wolsey, L.A. (2010) Polyhedral and Lagrangian Approaches for Lot Sizing with Production Time Windows and Setup Times. Computers & Operations Research, 37, 182-188.
https://doi.org/10.1016/j.cor.2009.04.005
[18]  Brahimi, N., Dauzère-Pérès, S., Najid, N. and Nordli, A. (2006) Single Item Lot Sizing Problems. European Journal of Operational Research, 168, 1-16.
http://www.sciencedirect.com/science/article/pii/S0377-2217(04)00392-3
https://doi.org/10.1016/j.ejor.2004.01.054
[19]  Millar, H.H. and Yang, M. (1994) Lagrangian Heuristics for the Capacitated Multi-Item Lot-Sizing Problem with Backordering. International Journal of Production Economics, 34, 1-15.
https://doi.org/10.1016/0925-5273(94)90042-6
http://www.sciencedirect.com/science/article/pii/0925-5273(94)90042-6

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133