Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2014 (2014), Article ID 848129, 17 pages
http://dx.doi.org/10.1155/2014/848129
Review Article

A Survey of Transportation Problems

1Universidad Autónoma del Carmen, Avenida 56 No. 4, Esq. Av. Concordia, Col. Benito Juarez, 24180 Ciudad del Carmen, CAM, Mexico
2Benemérita Universidad Autónoma de Puebla, Facultad de Ciencias de la Computación, Ciudad Universitaria, 14 sur y Avenida san Claudio, Edificio 104C, Colonia San Manuel, 72570 Puebla, PUE, Mexico
3Universidad Autónoma del Estado de Hidalgo, Av Universidad S/N, Centro, 42780 Tlahuelilpan, HGO, Mexico

Received 30 December 2013; Revised 5 February 2014; Accepted 6 February 2014; Published 27 March 2014

Academic Editor: Francisco Chiclana

Copyright © 2014 Ocotlán Díaz-Parra 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. B. O. Øvstebø, L. M. Hvattum, and K. Fagerholt, “Optimization of stowage plans for RoRo ships,” Computers and Operations Research, vol. 38, no. 10, pp. 1425–1434, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  2. L. C. Kendall and J. J. Buckley, The Business of Shipping, Cornell Maritime Press, 7th edition, 2001.
  3. K. Fagerholt, “Optimal fleet design in a ship routing problem,” International Transactions in Operational Research, vol. 6, no. 5, pp. 453–464, 1999. View at Publisher · View at Google Scholar
  4. F. Al-Khayyal and S. J. Hwang, “Inventory constrained maritime routing and scheduling for multi-commodity liquid bulk. I: applications and model,” European Journal of Operational Research, vol. 176, no. 1, pp. 106–130, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  5. J. Laderman, L. Gleiberman, and J. F. Egan, “Vessel allocation by linear programming,” Naval Research Logistics Quarterly, vol. 13, no. 3, pp. 315–320, 1996. View at Google Scholar
  6. K. Fagerholt, “A computer-based decision support system for vessel fleet scheduling—experience and future research,” Decision Support Systems, vol. 37, no. 1, pp. 35–47, 2004. View at Publisher · View at Google Scholar · View at Scopus
  7. M. Christiansen, K. Fagerholt, and B. Nygreen, “Maritime transportation,” in Handbooks in Operations Research and Management Science, C. Barnhart and G. Laporte, Eds., vol. 14, chapter 4, pp. 189–284, 2007. View at Google Scholar
  8. G. B. Dantzig and D. R. Fulkerson, “Minimizing the number of tankers to meet a fixed schedule,” Naval Research Logistics Quarterly, vol. 1, no. 3, pp. 217–222, 1954. View at Publisher · View at Google Scholar
  9. H. D. Sherali, S. M. Al-Yakoob, and M. M. Hassan, “Fleet management models and algorithms for an oil-tanker routing and scheduling problem,” IIE Transactions, vol. 31, no. 5, pp. 395–406, 1999. View at Publisher · View at Google Scholar · View at Scopus
  10. C. Douligeris, E. Iakovou, J. D. Englehardt, H. Li, C. M. Ip, and C. N. K. Mooers, “Development of a national marine oil transportation system model,” Spill Science and Technology Bulletin, vol. 4, no. 2, pp. 113–121, 1997. View at Publisher · View at Google Scholar · View at Scopus
  11. I. Norstad, K. Fagerholt, and G. Laporte, “Tramp ship routing and scheduling with speed optimization,” Transportation Research C, vol. 19, no. 5, pp. 853–865, 2011. View at Publisher · View at Google Scholar · View at Scopus
  12. J. A. Ruiz-Vanoye and O. Díaz-Parra, “Maritime platform transport problem of solid, special and dangerous waste”.
  13. M. Hellme, “Reducing air traffic delay in a space-time network,” in Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, vol. 1, pp. 236–242, October 1992. View at Publisher · View at Google Scholar
  14. G. Andreatta, L. Brunetta, and G. Guastalla, “Multi-airport ground holding problem: a heuristic approach based on priority rules,” in Modeling and Simulation in Air Traffic Management, L. Bianco, P. Dell’Olmo, and A. R. Odoni, Eds., pp. 71–87, Springer, 1997. View at Google Scholar · View at Zentralblatt MATH
  15. X. Zhang, Y. Zhou, B. Liu, and Z. Wang, “The air traffic flow management with dynamic capacity and Co-evolutionary genetic algorithm,” in Proceedings of the 10th International IEEE Conference on Intelligent Transportation Systems (ITSC '07), pp. 580–585, October 2007. View at Publisher · View at Google Scholar · View at Scopus
  16. L. Bianco, G. Rinaldi, and A. Sassano, “A combinatorial optimization approach to aircraft sequencing problem,” in Flow Control of Congested Networks, A. R. Odoni, L. Bianco, and G. Szego, Eds., pp. 323–339, Springer, 1987. View at Google Scholar
  17. M. Timlin and W. Pulleyblank, “Precedence constraints routing and helicopter scheduling: heuristic design,” Interfaces, vol. 22, no. 3, pp. 100–111, 1992. View at Publisher · View at Google Scholar
  18. J. P. Arabeyre, J. Feanley, F. C. Stieger, and W. Teather, “The airline crew scheduling problem: a survey,” Transportation Science, vol. 3, no. 2, pp. 140–163, 1969. View at Publisher · View at Google Scholar
  19. O. Díaz-Parra and J. A. Ruiz-Vanoye, “Oil platform transport problem”.
  20. K. Li, V. K. Ganesan, and A. I. Sivakumar, “Scheduling of single stage assembly with air transportation in a consumer electronic supply chain,” Computers and Industrial Engineering, vol. 51, no. 2, pp. 264–278, 2006. View at Publisher · View at Google Scholar · View at Scopus
  21. K. Li, V. K. Ganesan, A. I. Sivakumar, and M. Mathirajan, “Methodologies for synchronised scheduling of assembly and air transportation in a consumer electronics supply chain,” International Journal of Logistics Systems and Management, vol. 2, no. 1, pp. 52–67, 2006. View at Publisher · View at Google Scholar · View at Scopus
  22. R. Ghanbari and N. Mahdavi-Amiri, “Solving bus terminal location problems using evolutionary algorithms,” Applied Soft Computing Journal, vol. 11, no. 1, pp. 991–999, 2011. View at Publisher · View at Google Scholar · View at Scopus
  23. D. Goldstein, T. Shehab, J. Casse, and H. C. Lin, “On the formulation and solution of the convoy routing problem,” Transportation Research E, vol. 46, no. 4, pp. 520–533, 2010. View at Publisher · View at Google Scholar · View at Scopus
  24. A. M. Cambell, L. Clarke, A. J. Kleywegt, and M. W. P. Savelsbergh, “The inventory routing problem,” in Fleet Management and Logistics, T. G. Crainic and G. Laporte, Eds., pp. 95–113, Springer, Boston, Mass, USA, 1998. View at Google Scholar
  25. S. C. Liu and W. T. Lee, “A heuristic method for the inventory routing problem with time windows,” Expert Systems with Applications, vol. 38, no. 10, pp. 13223–13231, 2011. View at Publisher · View at Google Scholar · View at Scopus
  26. R. M. Newton and W. H. Thomas, “Bus routing in a multi-school system,” Computers and Operations Research, vol. 1, no. 2, pp. 213–222, 1974. View at Google Scholar · View at Scopus
  27. C. Zhu, J. Q. Hu, F. Wang, Y. Xu, and R. Cao, “On the tour planning problem,” Annals of Operations Research, vol. 192, pp. 67–86, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  28. I. M. Chao, “A tabu search method for the truck and trailer routing problem,” Computers and Operations Research, vol. 29, no. 1, pp. 33–51, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  29. A. L. Kok, E. W. Hans, and J. M. J. Schutten, “Optimizing departure times in vehicle routes,” European Journal of Operational Research, vol. 210, no. 3, pp. 579–587, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  30. M. C. Bolduc, G. Laporte, J. Renaud, and F. F. Boctor, “A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars,” European Journal of Operational Research, vol. 202, no. 1, pp. 122–130, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  31. J. L. Saha, “An algorithm for bus scheduling problems,” Operational Research Quarterly, vol. 21, pp. 463–474, 1970. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  32. M. L. Balinski and R. E. Quandt, “On an integer program for a delivery problem,” Operations Research, vol. 12, no. 2, pp. 300–304, 1964. View at Publisher · View at Google Scholar
  33. B. Gavish and P. Schweitzer, “An algorithm for combining truck trips,” Transportation Science, vol. 8, no. 1, pp. 13–23, 1974. View at Google Scholar · View at Scopus
  34. F. Li, B. Golden, and E. Wasil, “The open vehicle routing problem: algorithms, large-scale test problems, and computational results,” Computers and Operations Research, vol. 34, no. 10, pp. 2918–2930, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  35. C. D. Foster, “The Transport Problem,” Monograph 00239144, Transportation Research Board, 1963.
  36. Ü. Yüceer and A. Özakça, “A truck loading problem,” Computers & Industrial Engineering, vol. 58, no. 4, pp. 766–773, 2010. View at Publisher · View at Google Scholar
  37. G. B. Dantzig and J. H. Ramser, “The truck dispatching problem,” Management Science, vol. 6, no. 1, pp. 80–91, 1959. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  38. F. Cornillier, F. F. Boctor, G. Laporte, and J. Renaud, “A heuristic for the multi-period petrol station replenishment problem,” European Journal of Operational Research, vol. 191, no. 2, pp. 295–305, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  39. F. Cornillier, F. F. Boctor, G. Laporte, and J. Renaud, “An exact algorithm for the petrol station replenishment problem,” Journal of the Operational Research Society, vol. 59, no. 5, pp. 607–615, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  40. P. Toth and D. Vigo, The Vehicle Routing Problem Discrete Math, SIAM Monographs on Discrete Mathematics and Applications, 2002. View at Publisher · View at Google Scholar · View at MathSciNet
  41. S. A. Brownlow and S. R. Watson, “Structuring multi-attribute value hierarchies,” Journal of the Operational Research Society, vol. 38, no. 4, pp. 309–317, 1987. View at Google Scholar · View at Scopus
  42. S. Yan, S. S. Wang, and M. W. Wu, “A model with a solution algorithm for the cash transportation vehicle routing and scheduling problem,” Computers & Industrial Engineering, vol. 63, no. 2, pp. 464–473, 2012. View at Publisher · View at Google Scholar
  43. I. M. Chao, B. L. Golden, and E. A. Wasil, “The team orienteering problem,” European Journal of Operational Research, vol. 88, no. 3, pp. 464–474, 1996. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  44. H. C. Lau, K. M. Ng, and X. Wu, “Transport logistics planning with service-level constraints,” in Proceedings of the 19th National Conference on Artificial Intelligence (AAAI '04), pp. 519–524, July 2004. View at Scopus
  45. F. Cornillier, G. Laporte, F. F. Boctor, and J. Renaud, “The petrol station replenishment problem with time windows,” Computers and Operations Research, vol. 36, no. 3, pp. 919–935, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  46. J. Park and B. I. Kim, “The school bus routing problem: a review,” European Journal of Operational Research, vol. 202, no. 2, pp. 311–319, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  47. B. Gavish and E. Shlifer, “An approach for solving a class of transportation scheduling problems,” European Journal of Operational Research, vol. 3, no. 2, pp. 122–134, 1979. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  48. J. F. Cordeau, P. Toth, and D. Vigo, “A survey of optimization models for train routing and scheduling,” Transportation Science, vol. 32, no. 4, pp. 380–404, 1998. View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  49. B. Vaidyanathan, R. K. Ahuja, and J. B. Orlin, “The locomotive routing problem,” Transportation Science, vol. 42, no. 4, pp. 492–507, 2008. View at Publisher · View at Google Scholar · View at Scopus
  50. C. Zhu, J. Q. Hu, F. Wang, Y. Xu, and R. Cao, “On the tour planning problem,” Annals of Operations Research, vol. 192, pp. 67–86, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  51. D. Huisman, L. G. Kroon, R. M. Lentink, and M. J. C. M. Vromans, “Operations research in passenger railway transportation,” Statistica Neerlandica, vol. 59, no. 4, pp. 467–497, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  52. J. Sessions and G. Paredes, “A solution procedure for the sort yard location problem in forest operations,” Forest Products Journal, vol. 33, no. 3, pp. 750–762, 1987. View at Google Scholar · View at Scopus
  53. U. Brännlund, P. O. Lindberg, A. Nõu, and J. E. Nilsson, “Railway timetabling using Lagrangian relaxation,” Transportation Science, vol. 32, no. 4, pp. 358–369, 1998. View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  54. J. Ahn, O. de Weck, Y. Geng, and D. Klabjan, “Column generation based heuristics for a generalized location routing problem with profits arising in space exploration,” European Journal of Operational Research, vol. 223, no. 1, pp. 47–59, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  55. C. Taylor and O. L. de Weck, “Concurrent trajectory and vehicle optimization: a case study of earth-moon supply chain logistics,” in Proceedings of the 46th AIAA/ASME/ASCE/AHS/ASC Structures, Structural Dynamics and Materials Conference, pp. 5034–5046, Austin, Tex, USA, April 2005. View at Scopus
  56. M. Nakamiya, H. Yamakawa, D. J. Scheeres, and M. Yoshikawa, “Interplanetary transfers between Halo orbits: connectivity between escape and capture trajectories,” Journal of Guidance, Control, and Dynamics, vol. 33, no. 3, pp. 803–813, 2010. View at Publisher · View at Google Scholar · View at Scopus
  57. S. Gong, J. Li, and H. Baoyin, “Solar sail transfer trajectory from L1 point to sub-L1 point,” Aerospace Science and Technology, vol. 15, no. 7, pp. 544–554, 2011. View at Publisher · View at Google Scholar · View at Scopus
  58. K. Lansey and L. Mays, “Optimization model for water distribution system design,” Journal of Hydraulic Engineering, vol. 115, no. 10, pp. 1401–1418, 1989. View at Publisher · View at Google Scholar
  59. U. Shamir, “Water distribution systems analysis,” Journal of Hydraulic Engineering, vol. 94, no. 1, pp. 219–222, 1968. View at Google Scholar
  60. S. M. Ryan and J. D. Mccalley, “Decision models for bulk energy transportation networks,” in Proceedings of the NSF IREE 2008 Grantees Conference, trip report, Washington, DC, USA, May 2008.
  61. A. Quelhas, E. Gil, J. D. McCalley, and S. M. Ryan, “A multiperiod generalized network flow model of the U.S. integrated energy system. Part I: model description,” IEEE Transactions on Power Systems, vol. 22, no. 2, pp. 829–836, 2007. View at Publisher · View at Google Scholar · View at Scopus
  62. A. Quelhas and J. D. McCalley, “A multiperiod generalized network flow model of the U.S. integrated energy system. Part II: simulation results,” IEEE Transactions on Power Systems, vol. 22, no. 2, pp. 837–844, 2007. View at Publisher · View at Google Scholar · View at Scopus
  63. T. C. Jim Yeh, R. Srivastava, A. Guzman, and T. Harter, “Numerical model for water flow and chemical transport in variably saturated porous media,” Ground Water, vol. 31, no. 4, pp. 634–644, 1993. View at Google Scholar · View at Scopus
  64. R. Doctor, A. Palmer, D. Coleman et al., “Transport of CO2,” in IPCC Special Report on Carbon Dioxide Capture and Storage, B. Metz, O. Davidson, H. de Coninck, M. Loos, and L. Meyer, Eds., Cambridge University Press, Cambridge, UK, 2005. View at Google Scholar
  65. S. T. McCoy and E. S. Rubin, “An engineering-economic model of pipeline transport of CO2 with application to carbon capture and storage,” International Journal of Greenhouse Gas Control, vol. 2, no. 2, pp. 219–229, 2008. View at Publisher · View at Google Scholar · View at Scopus
  66. E. M. Gil, A. M. Quelhas, J. D. McCalley, and T. van Voorhis, “Modeling integrated energy transportation networks for analysis of economic efficiency and network interdependencies,” in Proceedings of 35 th North America Power Symposium (NAPS '03), Rolla, Mo, Usa, 2003.
  67. B. Ayar and H. Yaman, “An intermodal multicommodity routing problem with scheduled services,” Computational Optimization and Applications, vol. 53, no. 1, pp. 131–153, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  68. P. Vansteenwegen and D. van Oudheusden, “The mobile tourist guide: an OR opportunity,” OR Insights, vol. 20, no. 3, pp. 21–27, 2007. View at Publisher · View at Google Scholar
  69. H. N. Newton, Network design under budget constraints with application to the railroad blocking problem [Ph.D. thesis], Auburn University, Auburn, Ala, USA, 1996.
  70. C. I. Hsua, H. C. Lib, and L. H. Yanga, “Intertemporal demand for international tourist air travel,” Transportmetrica A, vol. 9, no. 5, pp. 385–407, 2013. View at Publisher · View at Google Scholar
  71. R. K. Ahuja, K. C. Jha, and J. Liu, “Solving real-life railroad blocking problems,” Interfaces, vol. 37, no. 5, pp. 404–419, 2007. View at Publisher · View at Google Scholar · View at Scopus
  72. F. Cornillier, F. F. Boctor, G. Laporte, and J. Renaud, “A heuristic for the multi-period petrol station replenishment problem,” European Journal of Operational Research, vol. 191, no. 2, pp. 295–305, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  73. M. R. Delavar, M. Hajiaghaei-Keshteli, and S. Molla-Alizadeh-Zavardehi, “Genetic algorithms for coordinated scheduling of production and air transportation,” Expert Systems with Applications, vol. 37, no. 12, pp. 8255–8266, 2010. View at Publisher · View at Google Scholar · View at Scopus
  74. K. Li, A. I. Sivakumar, and V. K. Ganesan, “Complexities and algorithms for synchronized scheduling of parallel machine assembly and air transportation in consumer electronics supply chain,” European Journal of Operational Research, vol. 187, no. 2, pp. 442–455, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  75. T. Jungai and X. Hongjun, “Optimizing arrival flight delay scheduling based on simulated annealing algorithm,” Physics Procedia, vol. 33, pp. 348–353, 2012. View at Publisher · View at Google Scholar
  76. P. Dell'Olmo and G. Lulli, “A dynamic programming approach for the airport capacity allocation problem,” IMA Journal of Management Mathematics, vol. 14, no. 3, pp. 235–249, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  77. L. Moreno, M. Poggi de Aragão, and E. Uchoa, “Column generation based heuristic for a helicopter routing problem,” in Experimental Algorithms, vol. 4007 of Lecture Notes in Computer Science, pp. 219–230, 2006. View at Google Scholar · View at Scopus
  78. F. Qian, I. Gribkovskaia, G. Laporte, and Ø. Halskau Sr., “Passenger and pilot risk minimization in offshore helicopter transportation,” Omega, vol. 40, no. 5, pp. 584–593, 2012. View at Publisher · View at Google Scholar · View at Scopus
  79. F. Qian, I. Gribkovskaia, and Ø. Halskau Sr., “Helicopter routing in the Norwegian oil industry: including safety concerns for passenger transport,” International Journal of Physical Distribution and Logistics Management, vol. 41, no. 4, pp. 401–415, 2011. View at Publisher · View at Google Scholar · View at Scopus
  80. F. Qian, “Genetic algorithm for solving a multi-objective helicopter routing problem,” in Proceedings of the 1st International Conference on Operations Research and Enterprise (ICORES '12), pp. 458–461, 2012.
  81. J. A. Ruiz-Vanoye, D. Ocotlán, F. Cocón, A. Buenabad-Arias, and A. Canepa Saenz, “A transgenic algorithm for the vehicle routing problem with time windows,” in Proceedings of the 4rth World Congress on Nature and Biologically Inspired Computing (NaBIC '12), pp. 138–143, Mexico City, Mexico, November 2012. View at Publisher · View at Google Scholar
  82. O. Díaz-Parra, J. A. Ruiz-Vanoye, A. Buenabad-Arias, and F. Cocón, “A vertical transfer algorithm for the school bus routing problem,” in Proceedings of the 4rth World Congress on Nature and Biologically Inspired Computing (NaBIC '12), pp. 66–71, Mexico City, Mexico, November 2012. View at Publisher · View at Google Scholar
  83. Z. Wang, J. Fan, J. Li, and C. Fan, “Research on improved hybrid particle swarm optimization for vehicle routing problem with time windows,” in Proceedings of the 2010 International Conference on Artificial Intelligence and Computational Intelligence (AICI '10), vol. 1, pp. 179–183, Sanya, China, October 2010. View at Publisher · View at Google Scholar · View at Scopus
  84. O. Díaz-Parra, J. A. Ruiz-Vanoye, and J. C. Zavala-Díaz, “Population pre-selection operators used for generating a non-random initial population to solve vehicle routing problem with time windows,” Scientific Research and Essays, vol. 5, no. 22, pp. 3529–3537, 2010. View at Google Scholar · View at Scopus
  85. E. Alba, F. Luna, A. J. Nebro, and J. M. Troya, “Parallel heterogeneous genetic algorithms for continuous optimization,” Parallel Computing, vol. 30, no. 5-6, pp. 699–719, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  86. J. F. Cordeau, G. Laporte, and A. Mercier, “A unified tabu search heuristic for vehicle routing problems with time windows,” Journal of the Operational Research Society, vol. 52, no. 8, pp. 928–936, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  87. O. Arbelaitz and C. Rodriguez, “Low cost parallel solutions for the VRPTW optimization problem,” International Journal of Computational Science and Engineering, vol. 1, no. 2–4, pp. 175–182, 2001. View at Google Scholar
  88. K. C. Tan, L. H. Lee, and K. Q. Zhu, “Heuristic methods for vehicle routing problem with time windows,” in Proceedings of the 6th International Symposium on Artificial Intelligence & Mathematics, Ft. Lauderdale, Fla, USA, 2000.
  89. J. Homberger and H. Gehring, “Two evolutionary metaheuristics for the vehicle routing problem with time windows,” INFOR Journal, vol. 37, pp. 297–318, 1999. View at Google Scholar · View at Scopus
  90. É. 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 Google Scholar · View at Zentralblatt MATH · View at Scopus
  91. J. Y. Potvin and S. Bengio, “The vehicle routing problem with time windows part II: genetic search,” INFORMS Journal on Computing, vol. 8, no. 2, pp. 165–172, 1996. View at Google Scholar · View at Scopus
  92. G. A. Kontoravdis and J. F. Bard, “A GRASP for the vehicle routing problem with time windows,” Journal on Computing, vol. 7, no. 1, pp. 10–23, 1995. View at Google Scholar · View at Zentralblatt MATH
  93. A. W. J. Kolen, A. H. G. Rinnooy Kan, and H. W. J. M. Trienekens, “Vehicle routing with time windows,” Operations Research, vol. 35, no. 2, pp. 266–273, 1987. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  94. D. Ripplinger, “Rural school vehicle routing problem,” Transportation Research Record, no. 1922, pp. 105–110, 2005. View at Google Scholar · View at Scopus
  95. P. Schittekat, K. Sörensen, M. Sevaux, and J. Springael, “A metaheuristic for solving large instances of the school bus routing problem,” in Proceedings of the 22nd European Conference on Operational Research (EURO '07), Prague, Czech Republic, July 2007.
  96. S. R. Thangiah and K. E. Nygard, “School bus routing using genetic algorithms,” in Applications of Artificial Intelligence X: Knowledge-Based Systems, vol. 1707 of Proceedings of SPIE, pp. 387–398, The International Society for Optical Engineering, April 1992. View at Scopus
  97. M. Yaghini, M. Momeni, and M. Sarmadi, “Solving train formation problem using simulated annealing algorithm in a simplex framework,” Journal of Advanced Transportation, 2012. View at Publisher · View at Google Scholar · View at Scopus
  98. D. Martinelli and H. Teng, “Genetic algorithm approach for solving the train formation problem,” Transportation Research Record, no. 1497, pp. 62–69, 1995. View at Google Scholar · View at Scopus
  99. D. R. Martinelli and H. Teng, “Optimization of railway operations using neural networks,” Transportation Research C, vol. 4, no. 1, pp. 33–49, 1996. View at Publisher · View at Google Scholar · View at Scopus
  100. N. Velasco, P. Castagliola, P. Dejax, C. Guéret, and C. Prins, “A memetic algorithm for a pick-up and delivery problem by helicopter,” Studies in Computational Intelligence, vol. 161, pp. 173–190, 2009. View at Publisher · View at Google Scholar · View at Scopus
  101. K. Ghoseiri and S. F. Ghannadpour, “A hybrid genetic algorithm for multi-depot homogenous locomotive assignment with time windows,” Applied Soft Computing Journal, vol. 10, no. 1, pp. 53–65, 2010. View at Publisher · View at Google Scholar · View at Scopus
  102. J. W. Chung, S. M. Oh, and I. C. Choi, “A hybrid genetic algorithm for train sequencing in the Korean railway,” Omega, vol. 37, no. 3, pp. 555–565, 2009. View at Publisher · View at Google Scholar · View at Scopus
  103. S. Rouillon, G. Desaulniers, and F. Soumis, “An extended branch-and-bound method for locomotive assignment,” Transportation Research B, vol. 40, no. 5, pp. 404–423, 2006. View at Publisher · View at Google Scholar · View at Scopus
  104. C. D. Tarantilis, F. Stavropoulou, and P. P. Repoussis, “The capacitated team orienteering problem: a bi-level filter-and-fan method,” European Journal of Operational Research, vol. 224, no. 1, pp. 65–78, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  105. H. Bouly, D. C. Dang, and A. Moukrim, “A memetic algorithm for the team orienteering problem,” 4OR, vol. 8, no. 1, pp. 49–70, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  106. S. Boussier, D. Feillet, and M. Gendreau, “An exact algorithm for team orienteering problems,” 4OR, vol. 5, no. 3, pp. 211–230, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  107. C. Archetti, A. Hertz, and M. G. Speranza, “Metaheuristics for the team orienteering problem,” Journal of Heuristics, vol. 13, no. 1, pp. 49–76, 2007. View at Publisher · View at Google Scholar · View at Scopus
  108. L. Ke, C. Archetti, and Z. Feng, “Ants can solve the team orienteering problem,” Computers and Industrial Engineering, vol. 54, no. 3, pp. 648–665, 2008. View at Publisher · View at Google Scholar · View at Scopus
  109. P. Vansteenwegen, W. Souffriau, G. Vanden Berghe, and D. van Oudheusden, “Iterated local search for the team orienteering problem with time windows,” Computers and Operations Research, vol. 36, no. 12, pp. 3281–3290, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  110. S. W. Lin and V. F. Yu, “A simulated annealing heuristic for the team orienteering problem with time windows,” European Journal of Operational Research, vol. 217, no. 1, pp. 94–107, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  111. W. Souffriau, P. Vansteenwegen, G. Vanden Berghe, and D. van Oudheusden, “A greedy randomized adaptive search procedure for the team orienteering problem,” in Proceedings of the 9th EU/Meeting on Metaheuristics for Logistics and Vehicle Routing, Troyes, France, October 2008.
  112. P. Vansteenwegen, W. Souffriau, G. vanden Berghe, and D. van Oudheusden, “Metaheuristics for tourist trip planning,” in Metaheuristics in the Service Industry, vol. 624 of Lecture Notes in Economics and Mathematical Systems, pp. 15–31, 2009. View at Publisher · View at Google Scholar · View at Scopus
  113. H. Tang and E. Miller-Hooks, “A TABU search heuristic for the team orienteering problem,” Computers and Operations Research, vol. 32, no. 6, pp. 1379–1407, 2005. View at Publisher · View at Google Scholar · View at Scopus
  114. I. M. Chao, “A tabu search method for the truck and trailer routing problem,” Computers and Operations Research, vol. 29, no. 1, pp. 33–51, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  115. S. W. Lin, V. F. Yu, and S. Y. Chou, “Solving the truck and trailer routing problem based on a simulated annealing heuristic,” Computers and Operations Research, vol. 36, no. 5, pp. 1683–1692, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  116. S. W. Lin, V. F. Yu, and C. C. Lu, “A simulated annealing heuristic for the truck and trailer routing problem with time windows,” Expert Systems with Applications, vol. 38, no. 12, pp. 15244–15252, 2011. View at Publisher · View at Google Scholar · View at Scopus
  117. J. G. Villegas, C. Prins, C. Prodhon, A. L. Medaglia, and N. Velasco, “A GRASP with evolutionary path relinking for the truck and trailer routing problem,” Computers and Operations Research, vol. 38, no. 9, pp. 1319–1334, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  118. J. H. Song and K. C. Furman, “A maritime inventory routing problem: practical approach,” Computers and Operations Research, vol. 40, no. 3, pp. 657–665, 2013. View at Publisher · View at Google Scholar · View at Scopus
  119. Y. Adulyasak, J. F. Cordeau, and R. Jans, “Formulations and branch-and-cut algorithms for multi-vehicle production and inventory routing problems,” Tech. Rep. G-2012-14, GERAD, Montreal, Canada, 2012. View at Google Scholar
  120. L. C. Coelho and G. Laporte, “The exact solution of several classes of inventory-routing problems,” Computers & Operations Research, vol. 40, no. 2, pp. 558–565, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  121. C. Archetti, L. Bertazzi, G. Laporte, and M. G. Speranza, “A branch-and-cut algorithm for a vendor-managed inventory-routing problem,” Transportation Science, vol. 41, no. 3, pp. 382–391, 2007. View at Publisher · View at Google Scholar · View at Scopus
  122. J. F. Bard and N. Nananukul, “A branch-and-price algorithm for an integrated production and inventory routing problem,” Computers & Operations Research, vol. 37, no. 12, pp. 2202–2217, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  123. T. Benoist, F. Gardi, A. Jeanjean, and B. Estellonbertrand, “Randomized local search for real-life inventory routing,” Transportation Science, vol. 45, no. 3, pp. 381–398, 2011. View at Publisher · View at Google Scholar · View at Scopus
  124. T. F. Abdelmaguid and M. M. Dessouky, “A genetic algorithm approach to the integrated inventory-distribution problem,” International Journal of Production Research, vol. 44, no. 21, pp. 4445–4464, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  125. S. Babaie-Kafaki, R. Ghanbari, S. H. Nasseri, and E. Ardil, “Solving bus terminal location problem using genetic algorithm,” World Academy of Science, Engineering and Technology, vol. 14, pp. 764–767, 2008. View at Google Scholar
  126. R. Grønhaug, M. Christiansen, G. Desaulniers, and J. Desrosiers, “A branch-and-price method for a liquefied natural gas inventory routing problem,” Transportation Science, vol. 44, no. 3, pp. 400–415, 2010. View at Publisher · View at Google Scholar · View at Scopus
  127. D. Popović, M. Vidović, and G. Radivojević, “Variable neighborhood search heuristic for the inventory routing problem in fuel delivery,” Expert Systems with Applications, vol. 39, no. 18, pp. 13390–13398, 2012. View at Publisher · View at Google Scholar
  128. K. L. Hoffman and M. Padberg, “Solving airline crew scheduling problems by branch-and-cut,” Management Science, vol. 39, no. 6, pp. 657–682, 1993. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  129. T. Emden-Weinert and M. Proksch, “Best practice simulated annealing for the airline crew scheduling problem,” Journal of Heuristics, vol. 5, no. 4, pp. 419–436, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  130. P. Lucic and D. Teodorovic, “Simulated annealing for the multi-objective aircrew rostering problem,” Tech. Rep., Faculty of Transport and Traffic Engineering, University of Belgrade, 1998. View at Google Scholar
  131. D. Levine, “Application of a hybrid genetic algorithm to airline crew scheduling,” Computers and Operations Research, vol. 23, no. 6, pp. 547–558, 1996. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  132. C. L. Huntley, D. E. Brown, D. E. Sappington, and B. P. Markowics, “Freight routing and scheduling at CSX transportation,” Interfaces, vol. 25, no. 3, pp. 58–71, 1995. View at Publisher · View at Google Scholar
  133. V. Salim and X. Cai, “A genetic algorithm for railway scheduling with environmental considerations,” Environmental Modelling and Software, vol. 12, no. 4, pp. 301–309, 1997. View at Publisher · View at Google Scholar · View at Scopus
  134. K. Nachtigall and S. Voget, “A genetic algorithm approach to periodic railway synchronization,” Computers and Operations Research, vol. 23, no. 5, pp. 453–463, 1996. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  135. L. Ping, N. Axin, J. Limin, and W. Fuzhang, “Study on intelligent train dispatching,” in Proceedings of the 2001 IEEE Intelligent Transportation Systems, pp. 949–953, Oakland, Calif, USA, August 2001. View at Publisher · View at Google Scholar · View at Scopus
  136. S. Wegele and E. Schnieder, “Dispatching of train operations using genetic algorithms,” in Proceedings of the 9th International Conference on Computer-Aided Scheduling of Public Transport (CASPT '04), San Diego, Calif, USA, 2004.
  137. M. Yaghini, A. Foroughi, and B. Nadjari, “Solving railroad blocking problem using ant colony optimization algorithm,” Applied Mathematical Modelling, vol. 35, no. 12, pp. 5579–5591, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  138. Y. Yue, L. Zhou, Q. Yue, and Z. Fan, “Multi-route railroad blocking problem by improved model and ant colony algorithm in real world,” Computers and Industrial Engineering, vol. 60, no. 1, pp. 34–42, 2011. View at Publisher · View at Google Scholar · View at Scopus
  139. A. Arias-Montano, C. A. C. Coello, and E. Mezura-Montes, “Multiobjective evolutionary algorithms in aeronautical and aerospace engineering,” IEEE Transactions on Evolutionary Computation, vol. 16, no. 5, pp. 662–694, 2012. View at Publisher · View at Google Scholar
  140. R. Salim and M. Bettayeb, “H2 and H optimal model reduction using genetic algorithms,” Journal of the Franklin Institute, vol. 348, no. 7, pp. 1177–1191, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  141. P. Schittekat, J. Kinable, K. Sörensen, M. Sevaux, F. Spieksma, and J. Springael, “A metaheuristic for the school bus routing problem with bus stop selection,” European Journal of Operational Research, vol. 229, no. 2, pp. 518–528, 2013. View at Publisher · View at Google Scholar
  142. J. Euchi and R. Mraihi, “The urban bus routing problem in the Tunisian case by the hybrid artificial ant colony algorithm,” Swarm and Evolutionary Computation, vol. 2, pp. 15–24, 2012. View at Publisher · View at Google Scholar · View at Scopus
  143. J. Park, H. Tae, and B. I. Kim, “A post-improvement procedure for the mixed load school bus routing problem,” European Journal of Operational Research, vol. 217, no. 1, pp. 204–213, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  144. J. Pacheco, R. Caballero, M. Laguna, and J. Molina, “Bi-objective bus routing: an application to school buses in rural areas,” Transportation Science, vol. 47, no. 3, pp. 397–411, 2013. View at Publisher · View at Google Scholar
  145. J. Riera-Ledesma and J. J. Salazar-González, “A column generation approach for a school bus routing problem with resource constraints,” Computers & Operations Research, vol. 40, no. 2, pp. 566–583, 2013. View at Publisher · View at Google Scholar