Please wait a minute...
Front. Inform. Technol. Electron. Eng.  2012, Vol. 13 Issue (8): 601-612    DOI: 10.1631/jzus.C1100384
    
Developing a multi-objective, multi-item inventory model and three algorithms for its solution
Ommolbanin Yousefi, Mirbahadorgholi Aryanezhad, Seyed Jafar Sadjadi, Arash Shahin
Department of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran; Department of Management, University of Isfahan, Isfahan, Iran
Developing a multi-objective, multi-item inventory model and three algorithms for its solution
Ommolbanin Yousefi, Mirbahadorgholi Aryanezhad, Seyed Jafar Sadjadi, Arash Shahin
Department of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran; Department of Management, University of Isfahan, Isfahan, Iran
 全文: PDF 
摘要: We develop a multi-objective model in a multi-product inventory system. The proposed model is a joint replenishment problem (JRP) that has two objective functions. The first one is minimization of total ordering and inventory holding costs, which is the same objective function as the classic JRP. To increase the applicability of the proposed model, we suppose that transportation cost is independent of time, is not a part of holding cost, and is calculated based on the maximum of stored inventory, as is the case in many real inventory problems. Thus, the second objective function is minimization of total transportation cost. To solve this problem three efficient algorithms are proposed. First, the RAND algorithm, called the best heuristic algorithm for solving the JRP, is modified to be applicable for the proposed problem. A multi-objective genetic algorithm (MOGA) is developed as the second algorithm to solve the problem. Finally, the model is solved by a new algorithm that is a combination of the RAND algorithm and MOGA. The performances of these algorithms are then compared with those of the previous approaches and with each other, and the findings imply their ability in finding Pareto optimal solutions to 3200 randomly produced problems.
关键词: Joint replenishment problemMulti-objective genetic algorithmRAND algorithm    
Abstract: We develop a multi-objective model in a multi-product inventory system. The proposed model is a joint replenishment problem (JRP) that has two objective functions. The first one is minimization of total ordering and inventory holding costs, which is the same objective function as the classic JRP. To increase the applicability of the proposed model, we suppose that transportation cost is independent of time, is not a part of holding cost, and is calculated based on the maximum of stored inventory, as is the case in many real inventory problems. Thus, the second objective function is minimization of total transportation cost. To solve this problem three efficient algorithms are proposed. First, the RAND algorithm, called the best heuristic algorithm for solving the JRP, is modified to be applicable for the proposed problem. A multi-objective genetic algorithm (MOGA) is developed as the second algorithm to solve the problem. Finally, the model is solved by a new algorithm that is a combination of the RAND algorithm and MOGA. The performances of these algorithms are then compared with those of the previous approaches and with each other, and the findings imply their ability in finding Pareto optimal solutions to 3200 randomly produced problems.
Key words: Joint replenishment problem    Multi-objective genetic algorithm    RAND algorithm
收稿日期: 2011-12-28 出版日期: 2012-08-02
CLC:  TP301.6  
服务  
把本文推荐给朋友
加入引用管理器
E-mail Alert
RSS
作者相关文章  
Ommolbanin Yousefi
Mirbahadorgholi Aryanezhad
Seyed Jafar Sadjadi
Arash Shahin

引用本文:

Ommolbanin Yousefi, Mirbahadorgholi Aryanezhad, Seyed Jafar Sadjadi, Arash Shahin. Developing a multi-objective, multi-item inventory model and three algorithms for its solution. Front. Inform. Technol. Electron. Eng., 2012, 13(8): 601-612.

链接本文:

http://www.zjujournals.com/xueshu/fitee/CN/10.1631/jzus.C1100384        http://www.zjujournals.com/xueshu/fitee/CN/Y2012/V13/I8/601

[1] Juan Yu, Pei-zhong Lu. AGCD:一种基于最大公因子逼近的鲁棒周期分析方法[J]. Front. Inform. Technol. Electron. Eng., 2015, 16(6): 466-473.
[2] Hamid Tabatabaee, Mohammad Reza Akbarzadeh-T, Naser Pariz. 非结构化异构多处理器系统中的动态任务调度建模[J]. Front. Inform. Technol. Electron. Eng., 2014, 15(6): 423-434.
[3] Saeid Arish, Ali Amiri, Khadije Noori. FICA: fuzzy imperialist competitive algorithm[J]. Front. Inform. Technol. Electron. Eng., 2014, 15(5): 363-371.
[4] Li-wei Huang, Gui-sheng Chen, Yu-chao Liu, De-yi Li. Enhancing recommender systems by incorporating social information[J]. Front. Inform. Technol. Electron. Eng., 2013, 14(9): 711-721.
[5] Mo-fei Song, Zheng-xing Sun, Yan Zhang, Fei-qian Zhang. Synthesis of 3D models by Petri net[J]. Front. Inform. Technol. Electron. Eng., 2013, 14(7): 521-529.
[6] Suiang-Shyan Lee, Ja-Chen Lin. An accelerated K-means clustering algorithm using selection and erasure rules[J]. Front. Inform. Technol. Electron. Eng., 2012, 13(10): 761-768.
[7] Alireza Askarzadeh, Alireza Rezazadeh. [J]. Frontiers of Information Technology & Electronic Engineering, 2011, 12(8): 638-646.