Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014, Article ID 515402, 14 pages
http://dx.doi.org/10.1155/2014/515402
Research Article

Introducing the MCHF/OVRP/SDMP: Multicapacitated/Heterogeneous Fleet/Open Vehicle Routing Problems with Split Deliveries and Multiproducts

Department of Industrial Engineering, Uludag University, Gorukle, 16059 Bursa, Turkey

Received 25 February 2014; Revised 7 May 2014; Accepted 7 May 2014; Published 16 June 2014

Academic Editor: Chin-Chia Wu

Copyright © 2014 Duygu Yilmaz Eroglu 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. R. Y. K. Fung, R. Liu, and Z. Jiang, “A memetic algorithm for the open capacitated arc routing problem,” Transportation Research Part E: Logistics and Transportation Review, vol. 50, no. 1, pp. 53–67, 2013. View at Publisher · View at Google Scholar · View at Scopus
  2. J. Brandão, “A tabu search algorithm for the open vehicle routing problem,” European Journal of Operational Research, vol. 157, no. 3, pp. 552–564, 2004. View at Publisher · View at Google Scholar · View at Scopus
  3. E. E. Zachariadis and C. T. Kiranoudis, “An open vehicle routing problem metaheuristic for examining wide solution neighborhoods,” Computers and Operations Research, vol. 37, no. 4, pp. 712–723, 2010. View at Publisher · View at Google Scholar · View at Scopus
  4. B. Eksioglu, A. V. Vural, and A. Reisman, “The vehicle routing problem: a taxonomic review,” Computers and Industrial Engineering, vol. 57, no. 4, pp. 1472–1483, 2009. View at Publisher · View at Google Scholar · View at Scopus
  5. A. N. Letchford, J. Lysgaard, and R. W. Eglese, “A branch-and-cut algorithm for the capacitated open vehicle routing problem,” Journal of the Operational Research Society, vol. 58, no. 12, pp. 1642–1651, 2007. View at Publisher · View at Google Scholar · View at Scopus
  6. H. Simbolon, “Developing a direct search algorithm for solving the capacitated open vehicle routing problem,” AIP Conference Proceedings, vol. 1337, pp. 211–217, 2010. View at Publisher · View at Google Scholar · View at Scopus
  7. M. Gendreau, G. Laporte, C. Musaraganyi, and É. D. Taillard, “A tabu search heuristic for the heterogeneous fleet vehicle routing problem,” Computers and Operations Research, vol. 26, no. 12, pp. 1153–1173, 1999. View at Publisher · View at Google Scholar · View at Scopus
  8. É. D. Taillard, “A heuristic column generation method for the heterogeneous fleet VRP,” Operations Research, vol. 33, no. 1, pp. 1–14, 1999. View at Google Scholar · View at Scopus
  9. R. Tavakkoli-Moghaddam, N. Safaei, M. M. O. Kah, and M. Rabbani, “A new capacitated vehicle routing problem with split service for minimizing fleet cost by simulated annealing,” Journal of the Franklin Institute, vol. 344, no. 5, pp. 406–425, 2007. View at Publisher · View at Google Scholar · View at Scopus
  10. C. Archetti and M. G. Speranza, “Vehicle routing problems with split deliveries,” International Transactions in Operational Research, vol. 19, no. 1-2, pp. 3–22, 2012. View at Publisher · View at Google Scholar · View at Scopus
  11. N. van Hop and N. N. Nagarur, “The scheduling problem of PCBs for multiple non-identical parallel machines,” European Journal of Operational Research, vol. 158, no. 3, pp. 577–594, 2004. View at Publisher · View at Google Scholar · View at Scopus
  12. J. H. Holland, Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence, The University of Michigan Press, 1975.
  13. D. E. Goldberg and J. H. Holland, “Genetic algorithms and machine learning,” Machine Learning, vol. 3, no. 2, pp. 95–99, 1988. View at Google Scholar
  14. D. Yilmaz Eroglu and C. Ozmutlu, “Mip models and hybrid algorithms for simultaneous job splitting and scheduling on unrelated parallel machines,” The Scientific World Journal, vol. 2014, Article ID 519520, 19 pages, 2014. View at Publisher · View at Google Scholar
  15. D. Yilmaz Eroglu, H. C. Ozmutlu, and S. Ozmutlu, “Genetic algorithm with local search for the unrelated parallel machine scheduling problem with sequence-dependent set-up times,” International Journal of Production Research, 2014. View at Publisher · View at Google Scholar
  16. R. L. Haupt and S. E. Haupt, Practical Genetic Algorithms, John Wiley & Sons, 2004.
  17. P.-C. Chang and S.-H. Chen, “Integrating dominance properties with genetic algorithms for parallel machine scheduling problems with setup times,” Applied Soft Computing Journal, vol. 11, no. 1, pp. 1263–1274, 2011. View at Publisher · View at Google Scholar · View at Scopus
  18. “Mchfovrpsdmp data,” http://yadi.sk/d/9-wg5kTNSV7fD.