Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015, Article ID 404868, 13 pages
http://dx.doi.org/10.1155/2015/404868
Research Article

A Two-Phase Heuristic Algorithm for the Common Frequency Routing Problem with Vehicle Type Choice in the Milk Run

College of Management & Economics, Tianjin University, 92 Weijin Road, Nankai District, Tianjin 300072, China

Received 12 August 2015; Revised 23 September 2015; Accepted 27 September 2015

Academic Editor: Yuri Vladimirovich Mikhlin

Copyright © 2015 Yu Lin et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. 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. View at Publisher · View at Google Scholar · View at Scopus
  2. L. Zhuang, “Towards a more economic production and just-in-time delivery system,” International Journal of Production Economics, vol. 36, no. 3, pp. 307–313, 1994. View at Publisher · View at Google Scholar · View at Scopus
  3. M. Savsar and A. Al-Jawini, “Simulation analysis of just-in-time production systems,” International Journal of Production Economics, vol. 42, no. 1, pp. 67–78, 1995. View at Publisher · View at Google Scholar · View at Scopus
  4. R. R. Lummus, “A simulation analysis of sequencing alternatives for JIT lines using kanbans,” Journal of Operations Management, vol. 13, no. 3, pp. 183–191, 1995. View at Publisher · View at Google Scholar · View at Scopus
  5. 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. View at Publisher · View at Google Scholar · View at Scopus
  6. M. Jafari-Eskandari, S. J. Sadjadi, M. S. Jabalameli, and A. Bozorgi-Amiri, “A robust optimization approach for the Milk Run problem (An auto industry supply chain case study),” in Proceedings of the IEEE International Conference on Computers & Industrial Engineering (CIE '09), pp. 1076–1081, Troyes, France, July 2009. View at Publisher · View at Google Scholar
  7. M. J. Eskandari, A. R. Aliahmadi, and G. H. H. Khaleghi, “A robust optimisation approach for the milk run problem with 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. View at Publisher · View at Google Scholar
  8. T. Du, F. K. Wang, and P.-Y. Lu, “A real-time vehicle-dispatching system for consolidating milk runs,” Transportation Research Part E: Logistics and Transportation Review, vol. 43, no. 5, pp. 565–577, 2007. View at Publisher · View at Google Scholar · View at Scopus
  9. J. Ma and G. Sun, “Mutation Ant colony algorithm of milk-run 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. View at Publisher · View at Google Scholar · View at Scopus
  10. G. B. Dantzig and J. H. Ramser, “The truck dispatching problem,” Management Science, vol. 6, no. 1, pp. 80–91, 1959. View at Publisher · View at Google Scholar
  11. B. Barán and M. Schaerer, “A multiobjective ant colony system for vehicle routing problem with time windows,” in Proceedings of the 21st IASTED International Multi-Conference on Applied Informatics (AI '03), pp. 97–102, Innsbruck, Austria, February 2003.
  12. B. Kallehauge, “Formulations and exact algorithms for the vehicle routing problem with time windows,” Computers and Operations Research, vol. 35, no. 7, pp. 2307–2330, 2008. View at Publisher · View at Google Scholar · View at Scopus
  13. A. Le Bouthillier and T. G. Crainic, “A cooperative parallel meta-heuristic for the vehicle routing problem with time windows,” Computers and Operations Research, vol. 32, no. 7, pp. 1685–1708, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  14. G. B. Alvarenga, G. R. Mateus, and G. de Tomi, “A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows,” Computers and Operations Research, vol. 34, no. 6, pp. 1561–1584, 2007. View at Publisher · View at Google Scholar · View at Scopus
  15. T. W. Chien, A. Balakrishnan, and R. T. Wong, “An integrated inventory allocation and vehicle routing problem,” Transportation Science, vol. 23, no. 2, pp. 67–76, 1989. View at Publisher · View at Google Scholar
  16. K. H. Chuah, Optimal common frequency routing for just-in-time supply delivery systems [M.S. thesis], University of Kentucky, Lexington, Ky, USA, 2000.
  17. K. H. Chuah and J. C. Yingling, “Analyzing inventory/transportation cost tradeoffs for milkrun parts delivery systems to large JIT assembly plants,” SAE Technical Paper 2001-01-2600, SAE International, 2001. View at Google Scholar
  18. K. H. Chuah, Optimization and simulation of just-in-time supply pickup and delivery systems [A Dissertation for the Degree of Doctor of Philosophy], University of Kentucky, Lexington, Ky, USA, 2004.
  19. Y. Chan, W. B. Carter, and M. D. Burnes, “A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands,” Computers and Operations Research, vol. 28, no. 8, pp. 803–826, 2001. View at Publisher · View at Google Scholar · View at Scopus
  20. V. Gintner, N. Kliewer, and L. Suhl, “Solving large multiple-depot multiple-vehicle-type bus scheduling problems in practice,” OR Spectrum, vol. 27, no. 4, pp. 507–523, 2005. View at Publisher · View at Google Scholar · View at Scopus
  21. J. L. Jr. Blanton and R. L. Wainwright, “Multiple vehicle routing with time and capacity constraints using genetic algorithms,” in Proceedings of the 5th International Conference on Genetic Algorithms, pp. 452–459, Morgan Kaufmann, Urbana-Champaign, Ill, USA, June 1993.
  22. K. Ahn and H. Rakha, “The effects of route choice decisions on vehicle energy consumption and emissions,” Transportation Research Part D: Transport and Environment, vol. 13, no. 3, pp. 151–167, 2008. View at Publisher · View at Google Scholar · View at Scopus
  23. R. Cavalcante and M. J. Roorda, “A disaggregate urban shipment size/vehicle-type choice model,” in Proceedings of the 89th Annual Meeting of the Transportation Research Board, 10-3878, Washington, DC, USA, January 2010.
  24. Q. L. Burrell, “The 80/20 rule: library lore or statistical law?” Journal of Documentation, vol. 41, no. 1, pp. 24–39, 1985. View at Publisher · View at Google Scholar · View at Scopus
  25. A. Ultsch, Proof of Pareto's 80/20 Law and Precise Limits for ABC-Analysis, Data Bionics Research Group University of Marburg, Lahn, Germany, 2002.
  26. M. Hardy, “Pareto's law,” The Mathematical Intelligencer, vol. 32, no. 3, pp. 38–43, 2010. View at Publisher · View at Google Scholar · View at Scopus
  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. View at Publisher · View at Google Scholar · View at Scopus
  28. É. Taillard, P. Badeau, M. Gendreau, F. Guertin, and J.-Y. Potvin, “A tabu search heuristic for the vehicle routing problem with soft time windows,” Transportation Science, vol. 31, no. 2, pp. 170–186, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  29. F. Alonso, M. J. Alvarez, and J. E. Beasley, “A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions,” Journal of the Operational Research Society, vol. 59, no. 7, pp. 963–976, 2008. View at Publisher · View at Google Scholar · View at Scopus
  30. G. Laporte, “The vehicle routing problem: an overview of exact and approximate algorithms,” European Journal of Operational Research, vol. 59, no. 3, pp. 345–358, 1992. View at Publisher · View at Google Scholar · View at Scopus
  31. R. Tavakkoli-Moghaddam, N. Safaei, and Y. Gholipour, “A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length,” Applied Mathematics and Computation, vol. 176, no. 2, pp. 445–454, 2006. View at Publisher · View at Google Scholar · View at Scopus
  32. S. D. Hosseini, M. Akbarpour Shirazi, and B. Karimi, “Cross-docking and milk run logistics in a consolidation network: a hybrid of harmony search and simulated annealing approach,” Journal of Manufacturing Systems, vol. 33, no. 4, pp. 567–577, 2014. View at Publisher · View at Google Scholar · View at Scopus
  33. H. Hotelling, “A generalized T test and measure of multivariate dispersion,” in Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability, Held at the Statistical Laboratory, Department of Mathematics, University of California, July 31–August 12, 1950, pp. 23–41, University of California Press, Berkeley, Calif, USA, 1951. View at Google Scholar
  34. D. C. Montgomery, Statistical Quality Control, John Wiley & Sons, 1985.