Optimization of the material flow in a manufacturing plant by use of artificial bee colony algorithm

被引:33
作者
Alvarado-Iniesta, Alejandro [1 ]
Garcia-Alcaraz, Jorge L. [1 ]
Ivan Rodriguez-Borbon, Manuel [1 ]
Maldonado, Aide [1 ]
机构
[1] Autonomous Univ Ciudad Juarez, Dept Ind & Mfg Engn, Ciudad Juarez 32315, Chihuahua, Mexico
关键词
Material flow; Continuous improvement; Standard time; Vehicle routing problem; Artificial bee colony algorithm; VEHICLE-ROUTING PROBLEM; GENETIC ALGORITHM;
D O I
10.1016/j.eswa.2013.02.029
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
To survive in today's competitive global market, companies must perform strategic changes in order to increase productivity, eliminating wasted materials, time, and effort. This study will examine how to optimize the time and effort required to supply raw material to different production lines in a manufacturing plant in Juarez, Mexico by minimizing the distance an operator must travel to distribute material from a warehouse to a set of different production lines with corresponding demand. The core focus of this study is similar to that of the Vehicle Routing Problem in that it is treated as a combinatorial optimization problem. The artificial bee colony algorithm is applied in order to find the optimal distribution of material with the aim of establishing a standard time for this duty by examining how this is applied in a local manufacturing plant. Results show that using this approach may be convenient to set standard times in the selected company. (C) 2013 Elsevier Ltd. All rights reserved.
引用
收藏
页码:4785 / 4790
页数:6
相关论文
共 29 条
[1]   A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery [J].
Ai, The Jin ;
Kachitvichyanukul, Voratas .
COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (05) :1693-1702
[2]  
[Anonymous], 2005, Technical Report-TR06
[3]   A genetic algorithm for the vehicle routing problem [J].
Baker, BM ;
Ayechew, MA .
COMPUTERS & OPERATIONS RESEARCH, 2003, 30 (05) :787-800
[4]   Ant colony optimization techniques for the vehicle routing problem [J].
Bell, JE ;
McMullen, PR .
ADVANCED ENGINEERING INFORMATICS, 2004, 18 (01) :41-48
[5]  
Berger J, 2003, LECT NOTES COMPUT SC, V2723, P646
[6]  
Bhagade A.S., 2012, Int. J. Soft Comput. Eng, V2, P329
[7]  
Brajevic Ivona, 2011, European Computing Conference. Proceedings of the European Computing Conference (ECC '11), P239
[8]   Simulated annealing metaheuristics for the vehicle routing problem with time windows [J].
Chiang, WC ;
Russell, RA .
ANNALS OF OPERATIONS RESEARCH, 1996, 63 :3-27
[9]  
Daza Julio Mario, 2009, Rev.EIA.Esc.Ing.Antioq, V0, P23
[10]   An improved ant colony optimization and its application to vehicle routing problem with time windows [J].
Ding, Qiulei ;
Hu, Xiangpei ;
Sun, Lijun ;
Wang, Yunzeng .
NEUROCOMPUTING, 2012, 98 :101-107