Application of Milk-Run Method for Inbound Transportation of Stamped-Metal Raw Material for Power Supply Manufacturing Plants
Keywords:
Milk Run, Ant Colony Optimization, Ant SystemAbstract
This research studied the application of the milk-run method for inbound transportation of stamped-metal raw material for power supply manufacture. The research was indeed conducted to mitigate the problem of high transportation cost due to excessively low raw material carrying load on trucks. Ant colony optimization method was applied to identify the shortest transportation routes; input data were from the transportation records of 7 suppliers. Milk-run transportation employing the developed heuristics could decrease (1) the average number of trucks per day from 18 to 4 (78% reduction); (2) the number of transportation trips from 1,059 to 341 (68% reduction) and (3) the total transportation distance from 59,804 to 45,622 kilometers (24% reduction).
References
Capgemini, 2005, 2005 THIRD-PARTY LOGISTICS : Results and Findings of the 10th Annual Study [Online], Availlable: http://3plstudy.com. [12 October 2020]
Satoh, I., 2008, “A Formal Approach for Milk-run Transport Logistics, IEICE Transactions on Fundamental of Electronics,” Communication and Computer Sciences, E91.A (11), pp. 3261-3268.
Sadjagi, J., Jafari, M.D. and Amini, T., 2008, “A New Mathematical Modeling and a Genetic Algorithm Search for Milk Run Problems,” The International Journal of Advanced Manufacturing Technology, 44 (4), pp. 194-200.
Gurider, S.B. and Saini, G., 2011, “Milk Run Logistics: Literature Review and Directions,” Proceedings of the World Congress on Engineering, Vol.1, p. 223.
Blum, C., 2005, “Ant Colony Optimization: Introduction and Recent Trends,” Physics of Life Reviews, 2 (4), pp. 353-373.
Udomsakdigool, A. and Kachitvichyanukul, V., 2005, “Heterogenous Ant Algprithm for Job Shop Scheduling,” Proceedings of the 2005 International Conference on Simulation and Modeling.
Dorigo, M. and Gambardella, L.M., 1997, “Ant Colonies for the Traveling Salesman Problem,” Bio Systems, 43, pp. 73–81.
Dorigo, M., Birattari, M. and Stutzle, T., 2006, Ant Colony Optimization Artificial Ants as a Computational Intelligence Technique, IEEE Computational Intelligence Magazine, November 2006, pp. 28-39.
Stutzle, T. and Dorigo, M., 1999, “ACO Algorithms for the Traveling Salesman Problem,” [Online], Available: http://staff.washington.edu/paymana/swarm/stutzle99-eaecs.pdf. [12 October 2020]
Cheng, C.B. and Mao, C.P., 2007, “A Modified Ant Colony System for Solving the Traveling Salesman Problem with Time Windows,” Mathematical and Computer Modelling, 46 (9-10), pp. 1225-1235.
Ma, J. and Sun, G., 2013, “Mutation Ant Colony Algorithm of Milk-Run Vehicle Routing Problem with Fastest Completion Time Based on Dynamic Optimization,” Discrete Dynamics in Nature and Society, 2013: 418436, 6 p. https://doi.org/10.1155/2013/418436.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2021 King Mongkut's University of Technology Thonburi
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Any form of contents contained in an article published in Science and Engineering Connect, including text, equations, formula, tables, figures and other forms of illustrations are copyrights of King Mongkut's University of Technology Thonburi. Reproduction of these contents in any format for commercial purpose requires a prior written consent of the Editor of the Journal.
