Baldacci, R., Mingozzi, A., & Roberti, R. (2012). Recent exact algorithms for solving the vehicle routing
problem under capacity and time window constraints. European Journal of Operational Research, 1(218), 1-6.
https://doi.org/10.1016/j.ejor.2011.07.037
BID - Banco Interamericano de Desarrollo (2011a). Un Espacio Para el Desarrollo de los Mercados de
Vivienda. Ideas Para el Desarrollo en las Américas, 26(3), 26-28.
BID - Banco Interamericano de Desarrollo (2011b). Una Libreta de Notas Para la Vivienda. Ideas Para el
Desarrollo en las Américas, 26(3), 27-30.
Blumenberg, E., & Ong, P. (2001). Cars, Buses, and Jobs: Welfare Participants and Employment Access in
Los Angeles. Transportation Research Record, 1756, 22-31. https://doi.org/10.3141/1756-03
Cabrerizo, C. (2013). Ciudad y territorio en clave de paisaje urbano contemporáneo en España y México.
Cuadernos de Vivienda y Urbanismo, 3(6).
Campos, V., & Mota, E. (2000) Heuristic Procedures for the Capacitated Vehicle Routing Problem.
Computational Optimization and Applications, 16(3), 265-277. https://doi.org/10.1023/A:1008768313174
Cordeau, J., & Laporte, G. (2005). Tabu Search Heuristics for the Vehicle Routing Problem. In Sharda, R.,
Stefan, V., Rego, C., & Alidaee, B. (Eds.). Metaheuristics Optimization via Memory and Evolution. Springer US.
145-163. https://doi.org/10.1007/0-387-23667-8_6
Dantzig, G.B. (1951). Application of the simplex method to a transportation problem, Activity Analysis of Production
and Allocation. Cowles Commission Monograph No. 13. John Wiley & Sons, Inc., New York, N.Y.;
Chapman & Hall, Ltd., London, 359-373.
Dantzig, G.B., Fulkerson, D.R., & Johnson, S.M. (1954). Solution of a large scale traveling salesman problem.
Technical Report P-510, RAND Corporation, Santa Monica, California.
https://doi.org/10.1287/opre.2.4.393
Fink, A., & Vob, S. (1999). Generic Metaheuristics Application to Industrial Engineering Problems.
Computers & Industrial Engineering, 37, 281-284. https://doi.org/10.1016/S0360-8352(99)00074-1
Garrido, P., & Castro, C. (2009). Stable solving of CVRPs using hyperheuristics. Association for Computing
Machinery, 255-262. https://doi.org/10.1145/1569901.1569938
Garzón-Garnica et al. (2015). Automated Data Acquisition for a Large Scale Capacitated Vehicle Routing
Problem. IFAC-PapersOnLine, 48(3), 1393-1398. https://doi.org/10.1016/j.ifacol.2015.06.281Gillett, B.E., & Miller, L.R. (1974). A Heuristic Algorithm for the Vehicle-Dispatch Problem. Operations
Research, 22(2), 340-349. https://doi.org/10.1287/opre.22.2.340
Kazimírová, I., & Kazimír, M. (2015). Proposal of Logistic Cost Reduction in Consignment
Consolidation. The International Journal of Transport & Logistics, 15(35), 1-6.
Kim, Y.K., & Lee, K. (2015). Different Impacts of Scientific and Technological Knowledge on Economic
Growth: Contrasting Science and Technology Policy in East Asia and Latin America. Asian Economic
Policy Review, 10(1), 43-66. https://doi.org/10.1111/aepr.12081
Kirci, P. (2016). An optimization algorithm for a capacitated vehicle routing problem with time windows.
Sadhana, Academy Proceedings in Engineering Sciences, 41(5), 519-529.
Laporte, G., Gendreau, M., Potvin, J.Y., & Semet, F. (2000) Classical and modern heuristics for the vehicle
routing problem. International Transactions in Operational Research, 7, 285-300. https://doi.org/10.1111/j.1475-
3995.2000.tb00200.x
Li, C.S., & Simchi-Levi, D. (1990). Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle
Routing Problems. ORSA Journal on Computing, 2, 64-73. https://doi.org/10.1287/ijoc.2.1.64
Lin, S.W., Lee, Z.-J., Ying, K.-C., & Lee, C.-Y. (2009) Applying hybrid meta-heuristics for capacitated
vehicle routing problem. Expert Systems with Applications, 36, 1505-1512.
https://doi.org/10.1016/j.eswa.2007.11.060
Nazif, H., & Lee, L. (2012). Optimised crossover genetic algorithm for capacitated vehicle routing
problem. Applied Mathematical Modelling, 36, 2110-2117. https://doi.org/10.1016/j.apm.2011.08.010
Orloff, C., & Caprera, D. (1976). Reduction and Solution of Large Scale Vehicle Routing Problems.
Transportation Science, 10(4), 361-373. https://doi.org/10.1287/trsc.10.4.361
Osman, I.H., & Kelly, J.P. (1996) Meta-Heuristics: An overview. In Osman, I.H., & Kelly, J.P. (Eds.). Meta-
Heuristics: Theory & Applications. Klumer, Boston. 1-21. https://doi.org/10.1007/978-1-4613-1361-8_1
Restrepo, J.H., & Medina, P.D. (2008). A logistic case, the capacited vehicle routing problem. Scientia et
Technica, 14(38), 253-258.
Rodrik, D. (2006). Goodbye Washington Consensus Hello Washington confusion? A review of the World
Bank’s Economic Growth in the 1990s: Learning from a Decade of Reform (2005). Journal of Economic
Literature, 44 (4), 973-987. https://doi.org/10.1257/jel.44.4.973
Schrage, L. (1999). Optimization Modelling with Lingo. Chicago, Illinois, USA: Lindo Systems Inc.Steinhaus, M. (2015). The Application of the Self Organizing Map to the Vehicle Routing Problem. PhD
Dissertation. Rhode Island, US: University of Rhode Island.
Takes, F., & Kosters, W. (2010). Applying Monte Carlo Techniques to the Capacitated Vehicle Routing
Problem. Proceedings of the 22nd Benelux Conference on Artificial Intelligence (BNAIC 2010) . Luxembourg:
University of Luxembourg - Public Research Center Henri Tudor. 1-8.
Wink, S., Bäck, T., & Emmerich, M. (2012). A Meta-Genetic Algorithm for Solving the Capacitated
Vehicle Routing Problem. Proceedings of the 2012 IEEE World Congress on Computational Intelligence (WCCI
2012). Brisbane, Australia, June 10-15. 1-8. https://doi.org/10.1109/CEC.2012.6253010
Zhang, D.Z., & Lee, C.K.M. (2015). An Improved Artificial Bee Colony Algorithm for the Capacitated
Vehicle Routing Problem. Proceedings of the 2015 IEEE International Conference on Systems, Man, and
Cybernetics. 2124-2128. https://doi.org/10.1109/SMC.2015.371
Thank you for copying data from http://www.arastirmax.com