Variants of VRP to optimize logistics management problems

Logistics Management and Optimization through Hybrid Artificial Intelligence Systems

Volumn , Issue , 2012, Pages 207-237

  Santillán, Claudia Gómez ^a   Barbosa, Juan Javier González ^a   Reyes, Laura Cruz ^a   López, Oscar Castillo ^b   Rodríguez, María Lucila Morales ^a   Zarate, Gilberto Rivera ^a   Hernández, Paula ^a  

^a INSTITUTO TECNOLÓGICO DE CIUDAD MADERO   (Mexico)

^b TIJUANA INSTITUTE OF TECHNOLOGY   (Mexico)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84898252320     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.4018/978-1-4666-0297-7.ch008     Document Type: Chapter

References (55)

1. Archetti, C., Mansini, R., & Speranza, M. G. (2001). The vehicle routing problem with capacity 2 and 3, general distances and multiple customer visits. In Proceedings of the Conference on Operational Research in Land and Resources Management (p. 102).
2. Bianchi, L. (2000). Notes in dynamic vehicle routing (Tech. Rep. No. IDSIA-05-01). Ticino, Switzerland: Instituto Dalle Molle di Studi Sull'intelligenza Artificiale.
3. Bianchi, L., Birattari, M., Chiarandini, M., Manfrin, M., Mastrolilli, M., & Schiavinotto, T. (2006). Hybrid metaheuristics for the vehicle routing problemwith stochastic demands. Journal of Mathematical Modelling and Algorithms, 5, 91-110. doi:10.1007/s10852-005-9033-y
4. Blasum, U., & Hochstätter, W. (2002). Application of the branch and cut method to the vehicle routing problem (Tech. Rep.). Hagen, Germany: FernUniversität in Hagen.
5. Bock, W. (1958). An algorithm for solving traveling salesman and related network optimization problems. In Proceedings of the Fourteenth National Meeting of the Operational Research Society of America, St. Louis, MO.
6. Bräysy, O. (2001). A reactive variable neighbor-hood search algorithm for the vehicle routing problem with Time Windows (Tech. Rep.). Oslo, Norway: SINTEF Applied Mathematics, Department of Optimization.
7. Cano, I., Litvinchev, I., Palacios, R., & Naranjo, G. (2005). Modeling vehicle routing in a star-case transportation network. In Proceedings of the 16th Congreso Internacional de Computación (pp. 373-377).
8. Coffman, J. E. G., Courboubetis, C., Garey, M. R., Johnson, D. S., Shor, P. W., & Weber, R. R. (2002). Perfect Packing: Theorems and the average case behavior of optimal and online bin packing. Society for Industrial and Applied Mathematics Review, 44, 95-108.
9. Cook, S. A. (1971). The complexity of theoremproving procedures. In Proceedings of the Third Annual ACM Symposium on Theory of Computing (pp. 151-158). New York, NY: ACM Press.
10. Cordeau, F., Desaulniers, G., Desrosiers, J., Solomon, M., & Soumis, F. (1999). The VRP with time windows (Tech. Rep. No. GERAD G-99-13). Montreal, QC, Canada: Ecole des Hautes 'Etudes Commerciales de Montreal.
11. Cordeau, J., Desaulniers, G., Desrosiers, J., Solomon, M., & Soumis, F. (2002). The VRP with time windows. In Murphy, S. (Ed.), Monographs on discrete mathematics and applications (pp. 157-193). Philadelphia, PA: Society for Industrial and Applied Mathematic.
12. Croes, G.A. (1958).Amethod for solving traveling salesman problems. Operations Research, 6(6), 791-812. doi:10.1287/opre.6.6.791
13. Dantzig, G. B., & Ramser, R. H. (1959). The truck dispatching problem. Management Science, 6, 80-91. doi:10.1287/mnsc.6.1.80
14. Dorigo, M., & Gambardella, L. (1997).Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation, 1(1), 53-66. doi:10.1109/4235.585892
15. Dorigo, M., & Stützle, T. (2004). Ant colony optimization. Cambridge, MA: MIT Press.
16. Dorronsoro, B. (2005). The VRP Web. Retrieved from http://neo.lcc.uma.es/radiaeb/WebVRP/index.html
17. Duarte, A., Pantrigo, J. J., & Gallego, M. (2007). Metaheurísticas. Madrid, Spain: Dykinson.
18. Fleischmann, B. (1990). The vehicle routing problem with multiple use of vehicles (Tech. Rep.). Hamburg, Germany: Fachbereigh Wirtschaftswis-senschaften, University of Hamburg.
19. Gambardella, L., Taillar, E., &Agazzi, G. (1999). MACS-VRPTW: A multiple ant colony system for vehicle routing problems with Time Windows (Technical Report IDSIA-06-99). Ticino, Switzerland: IDSIA.
20. Gendreau, M., Laporte, G., Musaraganyi, C., & Taillard, E. (1999). A tabu search heuristic for the heterogeneous fleet vehicle routing problem. PER-GAMON Computer & Operations Research, 26, 1153-1173. doi:10.1016/S0305-0548(98)00100-2
21. Goel, A., & Grum, V. (2005). Solving a dynamic real life vehicle routing problem. In Haasis, H.-D., Kopfer, H., & Schönberger, J. (Eds.), Operations research proceedings (pp. 367-372). New York, NY: Springer. doi:10.1007/3-540-32539-5_58
22. Gómez, C. G. (2010). Afinación Estática Global de Redes Complejas y Control Dinámico Local de la Función Tiempo de Vida en el Problema de Direccionamiento de Consultas Semánticas (Unpublished doctoral dissertation). Instituto Politécnico Nacional, CICATA, UA, México.
23. Hasle, G., Koster, O., Nilssen, E. J., Riise, A., & Flatberg, T. (2007). Dynamic and stochastic vehicle routing in practice. In Zeimpekis, V., Tarantilis, C. D., Giaglis, G. M., &Minis, I. (Eds.), Dynamic Fleet Management, Operation Research/ Computer Science Interfaces Series (Vol. 38, pp. 45-68). New York, NY: Springer.
24. Herrera, J. A. (2006). Desarrollo de una Metodología Basada en Heuristicas para la Solución Integral de Problemas de Asignación de Rutas, Horarios y Cargas en el Proceso de Distribución y Entrega de Productos (Unpublished master's thesis). Posgrado en Ciencias de la Computación, Instituto Tecnológico de Ciudad Madero, México.
25. Jin, T., Guo, S., Wang, F., & Lim, A. (2004). One-stage search for multi-depot vehicle routing problem. In Proceedings of the Conference on Intelligent Systems and Control (pp. 446-129).
26. Johnson, D. S., & McGeoch, L. A. (1995). The traveling salesman problem: A case study in local optimization. In Aarts, E. H. L., & Lenstra, J. K. (Eds.), Local search and combinatorial optimization. New York, NY: John Wiley & Sons.
27. Jong, C., Kant, G., & Vliet, A. V. (1996). On finding minimal route duration in the vehicle routing problem with multiple time windows (Tech. Rep.). Utrecht, The Netherlands: Department of Computer Science, Utrecht University.
28. Lawler, E. (1985). Combinatorial optimization: Networks and matroids. New York, NY: Dover.
29. Lenstra, J. K., & Rinnooy Kan, A. H. G. (1981). Complexity of vehicle routing and scheduling problems. Networks, 11, 221-227. doi:10.1002/net.3230110211
30. Marinakis, Y., & Migdalas, A. (2002). Heuristic solutions of vehicle routing problems in supply chain management. In Pardalos, P. M., & Migdalas, A. (Eds.), Combinatorial and global optimization (1st ed.). Singapore:World Scientific. doi:10.1142/9789812778215_0014
31. Martello, S., & Toth, P. (1990). Knapsack problems-algorithms and computer implementations. Chichester, UK: John Wiley & Sons.
32. Michalewicz, Z., & Fogel, D. B. (2204). How to solve it: Modern heuristics (2nd ed.). Berlin, Germany: Springer-Verlag.
33. Mingozzi, A., &Vallet, A. (2003). An exact algorithm for period and multi-depot vehicle routing problems. Proceedings of the 16th Symposium on Mathematical Programming.
34. Ombuki, B. M., Runka,A., & Hanshar, F. T. (2007) Waste collection vehicle routing problemwith time windows using multi-objetive genetic algorithms. In Proceedings of the Third IASTED International Conference on Computational Intelligence (pp. 91-97). New York, NY: ACM.
35. Pisinger, D., & Ropke, S. (2005). A general heuristic for vehicle routing problems (Tech. Rep.). Copenhagen, Denmark: Department of Computer Science, University of Copenhagen.
36. Potvin, J. Y., & Rousseau, J. M. (1995). An exchange heuristic for routing problems with time windows. The Journal of the Operational Research Society, 46, 1433-1446.
37. Prosser, P., & Shaw, P. (1996). Study of greedy search with multiple improvement heuristics for vehicle routing problems (Tech. Rep.). Glasgow, UK: University of Strathclyde.
38. Quiroz, M. (2009). Caracterización de factores de desempeño de algoritmos de solución de BPP (Unpublished master's thesis). Posgrado en Ciencias de la Computación, Instituto Tecnológico de Ciudad Madero, Tamaulipas, México.
39. Ralphs, T., Kopman, L., Pulleyblank, W., & Trotter, L. (2003). On the capacitated vehicle routing problem. Mathematical Programming, Series B, 94, 343-359 doi:10.1007/s10107-002-0323-0
40. Rangel, N. (2005). Análisis de los Problemas de Asignación de Rutas, Horarios y Cargas en una Distribuidora de Productos (Unpublished master's thesis). Posgrado en Ciencias de la Computación, Instituto Tecnológico de Ciudad Madero, Tamaulipas, México.
41. Reimann, M., Doerner, K., & Hartl, R. (2003). Analyzing a unified ant system for the VRP and some of its variants. In Proceedings of the International Conference on Applications of Evolutionary Computing (pp. 300-310).
42. Rizzoli, A. E., Oliverio, F., Montemanni, R., & Gambardella, L. M. (2004). Ant colony optimisation for vehicle routing problems: from theory to applications. Ticino, Switzerland: IDSIA.
43. Secomandi, N. (2000). Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands. Computers & Operations Research, 27, 1171-1200 doi:10.1016/S0305-0548(99)00146-X
44. Secomandi, N. (2001). A rollout policy for the vehicle routing problem with stochastic demands. Operations Research, 49, 796-802. doi:10.1287/ opre.49.5.796.10608
45. Shaw, P. (1998). Using constraint programming and local search methods to solve vehicle routing problems. In M. Maher & J. F. Puget (Eds.), Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming (LNCS 1520, pp. 417-431).
46. Solomon, M. (1987). Algorithms for the vehicle routing and scheduling problemwith time window constraints. Operations Research, 35(2), 254-265 doi:10.1287/opre.35.2.254
47. Sycara, K. (1998). Multiagent systems. AI Magazine, 19(2), 79-92.
48. Taillard, E. (1999). A heuristic column generation method for the heterogeneous fleet VRP. Operations Research, 33(1), 1-14. doi:10.1051/ro:1999101
49. Taillard, E., Badeau, P., Gendreu, M., Guertin, F., & Potvin, J. Y. (1997). A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Science, 31, 170-186 doi:10.1287/trsc.31.2.170
50. Taillard, E., Laport, G., & Gendreau, M. (1996). Vehicle routing problem with multiple use of vehicles. The Journal of the Operational Research Society, 47, 1065-1070.
51. Thangiah, V. (2003). A site dependent vehicle routing problem with complex road constraints. Paper presented at the Colloquium at the Institute of Mathematics, University of Malaya, Kuala Lumpur, Malaysia.
52. Toth, P., & Vigo, D. (2000). An overview of vehicle routing problems. In Murphy, S. (Ed.), Monographs on discrete mathematics and applications (pp. 1-26). Philadelphia, PA: SIAM.
53. Toth, P., & Vigo, D. (2002). The vehicle routing problem. In Proceedings of the SIAMMonographs on Discrete Mathematics and Applications.
54. Vehicle routing software survey. (2006). OR/MS Today. Retrieved from http://www.lionhrtpub.com/orms/surveys/Vehicle-Routing/vrss.html
55. Yang, W. H., Kamlesh, M., & Ronald, H. B. (2000). Stochastic vehicle routing problem with restocking. Transportation Science, 34, 99-112 doi:10.1287/trsc.34.1.99.12278