A Two-Stage Simulated Annealing Algorithm for the Many-to-Many Milk-Run Routing Problem with Pipeline Inventory Cost

Mathematical Problems in Engineering

Volumn 2015, Issue , 2015, Pages

  Lin, Yu ^a   Bian, Zheyong ^a   Sun, Shujing ^b   Xu, Tianyi ^a  

^a TIANJIN UNIVERSITY   (China)

^b UNIVERSITY OF ROCHESTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AMPHIBIOUS VEHICLES; COSTS; HEURISTIC ALGORITHMS; LOGISTICS; PIPELINES; SIMULATED ANNEALING; SUPPLY CHAINS;

INFORMATION SHARING; LOGISTICS SYSTEM; NUMBER OF VEHICLES; ROUTING PROBLEMS; SATISFACTORY SOLUTIONS; SIMULATED ANNEALING ALGORITHMS; TRANSPORTATION MODE; TWO-STAGE HEURISTIC ALGORITHMS;

ALGORITHMS;

EID: 84941671056     PISSN: 1024123X     EISSN: 15635147     Source Type: Journal    
DOI: 10.1155/2015/428925     Document Type: Article

References (41)

1. O. Berman and Q.Wang, "Inbound logistic planning: minimizing transportation and inventory cost," Transportation Science, vol. 40, no. 3, pp. 287-299, 2006.
2. S. J. Sadjadi, M. Jafari, and T. Amini, "A new mathematical modeling and a genetic algorithm search for milk run problem (an auto industry supply chain case study)," The International Journal of Advanced Manufacturing Technology, vol. 44, no. 1-2, pp. 194-200, 2009.
3. T. Nemoto, K. Hayashi, and M. Hashimoto, "Milk-run logistics by Japanese automobile manufacturers inThailand," Procedia- Social and Behavioral Sciences, vol. 2, no. 3, pp. 5980-5989, 2010.
4. S. Raff, "Routing and scheduling of vehicles and crews.Thestate of the art," Computers & Operations Research, vol. 10, no. 2, pp. 63-211, 1983.
5. G. Laporte and Y. Nobert, "Exact algorithms for the vehicle routing problem," Surveys in Combinatorial Optimization, vol. 31, pp. 147-184, 1987.
6. M. M. Solomon, "Algorithms for the vehicle routing and scheduling problemswith timewindowconstraints," Operations Research, vol. 35, no. 2, pp. 254-265, 1987.
7. O. Bräysy and M. Gendreau, "Vehicle routing problem with time windows, Part II: metaheuristics," Transportation Science, vol. 39, no. 1, pp. 119-139, 2005.
8. J. Renaud,G. Laporte, and F. F. Boctor, "Atabu search heuristic for the multi-depot vehicle routing problem," Computers & Operations Research, vol. 23, no. 3, pp. 229-235, 1996.
9. A. Lim and F. Wang, "Multi-depot vehicle routing problem: a one-stage approach," IEEE Transactions on Automation Science and Engineering, vol. 2, no. 4, pp. 397-402, 2005.
10. K. H. Chuah and J. C. Yingling, "Routing for a just-in-time supply pickup and delivery system," Transportation Science, vol. 39, no. 3, pp. 328-339, 2005.
11. Z. Jiang, Y. Huang, and J. Wang, "Routing for the milk-run pickup system in automobile parts supply," in Proceedings of the 6th CIRP-Sponsored International Conference on Digital Enterprise Technology, vol. 66 of Advances in Intelligent and Soft Computing, pp. 1267-1275, Springer, Berlin,Germany, 2010.
12. M. Jafari-Eskandari, S. J. Sadjadi, M. S. Jabalameli et al., "A robust optimization approach for the milk run problem (An auto industry Supply Chain Case Study)," in Proceedings of the International Conference on Computers&Industrial Engineering (CIE '09), pp. 1076-1081, IEEE, 2009.
13. M. Jafari-Eskandari, A. R. Aliahmadi, and G. H. H. Khaleghi, "A robust optimisation approach for themilk run problemwith time windows with inventory uncertainty: an auto industry supply chain case study," International Journal of Rapid Manufacturing, vol. 1, no. 3, pp. 334-347, 2010.
14. J. Zhang and Y. Li, "Analysis and optimization of the milk-run model in automotive industry-an automubile manufactruring company case study," Journal of Japan Industrial Management Association, vol. 61, no. 3, pp. 214-221, 2010.
15. L. Yun, G. Xian-Long, and S. Chao-Chun, "Inventorytransportation integrated optimization based on milk-run model," in Proceedings of the 1st International Conference on EBusiness and E-Government (ICEE '10), pp. 3372-3376, IEEE, May 2010.
16. T.Du, F. K.Wang, andP.-Y.Lu, "Areal-time vehicle-dispatching system for consolidating milk runs," Transportation Research Part E: Logistics and Transportation Review, vol. 43, no. 5, pp. 565-577, 2007.
17. J. Ma and G. Sun, "Mutation ant colony algorithm of milkrun vehicle routing problem with fastest completion time based on dynamic optimization," Discrete Dynamics in Nature and Society, vol. 2013,Article ID 418436, 6 pages, 2013.
18. G. Berbeglia, J. F. Cordeau, I. Gribkovskaia, and G. Laporte, "Static pickup and delivery problems: a classification scheme and survey," TOP, vol. 15, no. 1, pp. 1-31, 2007.
19. M.W. Savelsbergh and M. Sol, "The general pickup and delivery problem," Transportation Science, vol. 29, no. 1, pp. 17-29, 1995.
20. X. Zhu, S. J. Hu, Y. Koren, and N. Huang, "A complexity model for sequence planning in mixed-model assembly lines," Journal of Manufacturing Systems, vol. 31, no. 2, pp. 121-130, 2012.
21. Y. H. Lee, J.W. Jung, and K. M. Lee, "Vehicle routing scheduling for cross-docking in the supply chain," Computers & Industrial Engineering, vol. 51, no. 2, pp. 247-256, 2006.
22. R. Musa, J.-P. Arnaout, and H. Jung, "Ant colony optimization algorithm to solve for the transportation problem of crossdocking network," Computers & Industrial Engineering, vol. 59, no. 1, pp. 85-92, 2010.
23. Z. Miao, K. Fu, and F. Yang, "A hybrid genetic algorithm for the multiple crossdocks problem," Mathematical Problems in Engineering, vol. 2012, Article ID 316908, 18 pages, 2012.
24. S. M. Mousavi and R. Tavakkoli-Moghaddam, "A hybrid simulated annealing algorithm for location and routing scheduling problems with cross-docking in the supply chain," Journal of Manufacturing Systems, vol. 32, no. 2, pp. 335-347, 2013.
25. J. Kaneko and W. Nojiri, "The logistics of just-in-time between parts suppliers and car assemblers in Japan," Journal of Transport Geography, vol. 16, no. 3, pp. 155-173, 2008.
26. A. S. Alfa, S. S. Heragu, andM. Chen, "A 3-opt based simulated annealing algorithm for vehicle routing problems," Computers & Industrial Engineering, vol. 21, no. 1-4, pp. 635-639, 1991.
27. I. H. Osman, "Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem," Annals of Operations Research, vol. 41, no. 4, pp. 421-451, 1993.
28. A. Van Breedam, "Improvement heuristics for the vehicle routing problem based on simulated annealing," European Journal of Operational Research, vol. 86, no. 3, pp. 480-490, 1995.
29. M.Gendreau, A.Hertz, and G. Laporte, "A tabu search heuristic for the vehicle routing problem," Management Science, vol. 40, no. 10, pp. 1276-1290, 1994.
30. B. M. Baker and M. A. Ayechew, "A genetic algorithm for the vehicle routing problem," Computers & Operations Research, vol. 30, no. 5, pp. 787-800, 2003.
31. C. Prins, "A simple and effective evolutionary algorithm for the vehicle routing problem," Computers & Operations Research, vol. 31, no. 12, pp. 1985-2002, 2004.
32. B. Bullnheimer, R. F. Hartl, and C. Strauss, Applying the ANT System to the Vehicle Routing Problem, Meta-Heuristics, Springer, NewYork, NY,USA, 1999.
33. J. E. Bell and P. R. McMullen, "Ant colony optimization techniques for the vehicle routing problem," Advanced Engineering Informatics, vol. 18, no. 1, pp. 41-48, 2004.
34. B. Yu, Z.-Z. Yang, and B. Yao, "An improved ant colony optimization for vehicle routing problem," European Journal of Operational Research, vol. 196, no. 1, pp. 171-176, 2009.
35. C.-H. Chen and C.-J. Ting, "An improved ant colony system algorithm for the vehicle routing problem," Journal of the Chinese Institute of Industrial Engineers, vol. 23, no. 2, pp. 115-126, 2006.
36. T. J. Ai and V. Kachitvichyanukul, "Particle swarmoptimization and two solution representations for solving the capacitated vehicle routing problem," Computers & Industrial Engineering, vol. 56, no. 1, pp. 380-387, 2009.
37. Y. Marinakis, M. Marinaki, and G. Dounias, "A hybrid particle swarmoptimization algorithm for the vehicle routing problem," Engineering Applications of Artificial Intelligence, vol. 23, no. 4, pp. 463-472, 2010.
38. X. Geng, Z. Chen,W. Yang, D. Shi, and K. Zhao, "Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search," Applied Soft Computing, vol. 11, no. 4, pp. 3680-3689, 2011.
39. J. M. Varanelli and J. P. Cohoon, "A two-stage simulated annealing methodology," in Proceedings of the 5th Great Lakes Symposium on VLSI, pp. 50-53, Buffalo, NY, USA, March 1995.
40. The Vehicle Routing Problem, SIAM, 2001.
41. I. M. Oliver, D. J. Smith, and J. R. C. Holland, "Study of permutation crossover operators on the traveling salesman problem," in Genetic Algorithms and Their Applications: Proceedings of the Second International Conference on Genetic Algorithms: July 28-31, 1987 at theMassachusetts Institute of Technology, Cambridge, MA, L. Erlhaum Associates, Hillsdale,NJ, USA, 1987.