Meta-heuristic algorithms in solving the perishable supply chain network problem considering the queuing system based on robust possibilistic programming
نویسندگان
1 Department of Industrial Engineering and Management Systems, Amirkabir University of Technology, Tehran, Iran
2 Department of Industrial Engineering, Lahijan Branch, Islamic Azad University, Lahijan, Iran
3 Department of Industrial Management, North Tehran Branch, Islamic Azad University, Tehran, Iran
4 Department of Industrial Engineering, University of Eyvanekey, Eyvanekey, Iran
doi
چکیده
In a real world, there are some products and goods such as meat, vegetables, fruits and flowers that decay during the time. The producer has to produce more than the market demand due to the decay of some of the perishable goods. The perishable goods affect the production planning, goods preservation policy and the retailer’s decision making. The retailer should also consider the good’s perishability in her/his decision making. Therefore, one of the attractive and considerable subcategories of the supply chain management is the appropriate design of the chain network in supplying the perishable goods in which the main challenge is decreasing the expenses of production and preservation and also the perishable goods is one of the challenges of the perishable goods. In this article, a model of supply chain for perishable goods has been considered which is used to control the uncertain parameters by robust possibilistic programming and the meta-heuristic algorithms such as PSO, ALO and GWO are used to solve it. The results show that the GWO algorithm is much more efficient than other algorithms. To compare these algorithms, the means of total cost and CPU-time have been used. Also, T-test was used to study the significant index means derived from the meta-heuristic algorithms which shows no significant difference between the objective function and the CPU-time.
