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

Three-Phase Methodology Incorporating Scatter Search for Integrated Production, Inventory, and Distribution Routing Problem

Institute of Mathematical Sciences, University of Malaya, 50603 Kuala Lumpur, Malaysia

Received 21 January 2015; Revised 2 June 2015; Accepted 8 June 2015

Academic Editor: Matteo Gaeta

Copyright © 2015 Noor Hasnah Moin and Titi Yuliana. 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. L. Lei, S. Liu, A. Ruszczynski, and S. Park, “On the integrated production, inventory, and distribution routing problem,” IIE Transactions, vol. 38, no. 11, pp. 955–970, 2006. View at Publisher · View at Google Scholar · View at Scopus
  2. J. F. Bard and N. Nananukul, “The integrated production-inventory-distribution-routing problem,” Journal of Scheduling, vol. 12, no. 3, pp. 257–280, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  3. P. Chandra and M. L. Fisher, “Coordination of production and distribution planning,” European Journal of Operational Research, vol. 72, no. 3, pp. 503–517, 1994. View at Publisher · View at Google Scholar · View at Scopus
  4. M. Boudia, M. A. O. Louly, and C. Prins, “A reactive GRASP and path relinking for a combined production-distribution problem,” Computers and Operations Research, vol. 34, no. 11, pp. 3402–3419, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  5. M. Boudia and C. Prins, “A memetic algorithm with dynamic population management for an integrated production-distribution problem,” European Journal of Operational Research, vol. 195, no. 3, pp. 703–715, 2009. View at Publisher · View at Google Scholar · View at Scopus
  6. J. F. Bard and N. Nananukul, “A branch-and-price algorithm for an integrated production and inventory routing problem,” Computers and Operations Research, vol. 37, no. 12, pp. 2202–2217, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  7. N. Nananukul, “Clustering model and algorithm for production inventory and distribution problem,” Applied Mathematical Modelling, vol. 37, no. 24, pp. 9846–9857, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. V. A. Armentano, A. L. Shiguemoto, and A. Løkketangen, “Tabu search with path relinking for an integrated production-distribution problem,” Computers & Operations Research, vol. 38, no. 8, pp. 1199–1209, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  9. J. F. Bard and N. Nananukul, “Heuristics for a multiperiod inventory routing problem with production decisions,” Computers & Industrial Engineering, vol. 57, no. 3, pp. 713–723, 2009. View at Publisher · View at Google Scholar · View at Scopus
  10. Y. Adulyasak, J.-F. Cordeau, and R. Jans, “Optimization-based adaptive large neighborhood search for the production routing problem,” Transportation Science, vol. 48, no. 1, pp. 20–45, 2014. View at Publisher · View at Google Scholar · View at Scopus
  11. Y. Adulyasak, J.-F. Cordeau, and R. Jans, “Formulations and branch-and-cut algorithms for multivehicle production and inventory routing problems,” INFORMS Journal on Computing, vol. 26, no. 1, pp. 103–120, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. S. A. Torabi, A. R. Pourghaderi, and S. Sekhavat, “A two step approach including scatter search algorithm for the integrated procurement, production and distribution planning,” in Proceedings of the IEEE International Conference on Industrial Engineering and Engineering Management (IEEM '09), pp. 354–359, Hong Kong, China, December 2009. View at Publisher · View at Google Scholar · View at Scopus
  13. Y. Adulyasak, J.-F. Cordeau, and R. Jans, “The production routing problem: a review of formulations and solution algorithms,” Computers & Operations Research, vol. 55, no. 1, pp. 141–152, 2015. View at Publisher · View at Google Scholar · View at Scopus
  14. A. Imran, S. Salhi, and N. A. Wassan, “A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem,” European Journal of Operational Research, vol. 197, no. 2, pp. 509–518, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  15. A. Corberán, E. Fernández, M. Laguna, and R. Martí, “Heuristic solutions to the problem of routing school buses with multiple objectives,” Journal of the Operational Research Society, vol. 53, no. 4, pp. 427–435, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  16. E. Mota, V. Campos, and A. Corberan, “A new metaheuristic for the vehicle routing problem with split demands,” in Evolutionary Computation in Combinatorial Optimization, C. Cotta and J. Van Hemert, Eds., vol. 4446 of Lecture Notes in Computer Science, pp. 121–129, Springer, Berlin, Germany, 2007. View at Publisher · View at Google Scholar
  17. F. Glover, “Heuristic for integer programming using surrogate constraints,” Decision Sciences, vol. 8, no. 1, pp. 156–166, 1977. View at Publisher · View at Google Scholar
  18. M. Laguna and R. Marti, Scatter Search: Methodology and Implementations in C, Springer, New York, NY, USA, 2003.
  19. B. E. Gillett and L. R. Miller, “A heuristic algorithm for the vehicle-dispatch problem,” Operations Research, vol. 22, no. 2, pp. 340–349, 1974. View at Publisher · View at Google Scholar
  20. G. Clarke and J. W. Wright, “Scheduling a number of vehicles from a central depot to a number of delivery points,” Operations Research, vol. 12, no. 4, pp. 568–581, 1964. View at Google Scholar
  21. R. A. Russell and W.-C. Chiang, “Scatter search for the vehicle routing problem with time windows,” European Journal of Operational Research, vol. 169, no. 2, pp. 606–622, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  22. F. Glover, M. Laguna, and R. Martí, “Fundamentals of scatter search and path relinking,” Control and Cybernetics, vol. 29, no. 3, pp. 653–684, 2000. View at Google Scholar · View at MathSciNet · View at Scopus