Applied Artificial Bee colony algorithm for multiple capacitated vehicle routing problem: Case study of the plastic packaging industry

摘要

The aim of this research is to investigate the transportation problem of a plastic packaging industry case study because at present, competition within the plastic packaging business requires good services and on time delivery. Therefore, customer complaints and delayed deliveries are major problems for this industry group and that is why it is required to create more reliability and satisfaction for customers. Nowadays, this industry engages a transport supplier for goods delivery but it still has high transportation cost problems due to vehicle routing management. Artificial Bee colony algorithm is applied to overcome this issue. This algorithm is verified by using Vehicle Routing Problem benchmark (VRP) in terms of minimized total traveling distance. Then, for presenting high efficiency, this algorithm was validated for good performance compared with other algorithms. After algorithm validation, Artificial Bee colony algorithm is employed to solve the vehicle routing problem that has various vehicle capacities in the plastic packaging industry case study. The experimental results show that the purposed algorithm can be used to tackle the transportation problem in terms of minimizing total traveling distance and transportation costs, and also enhancing quality service levels and vehicle utilization for the multi-capacitated Vehicle Routing Problem.