Modelo matemático para resolver el problema de localización y ruteo con restricciones de capacidad considerando flota propia y subcontratada

Augerat, 1998, Separating capacity inequalities in the CVRP using Tabu Search, European Journal of Operational Research, 106, 546, 10.1016/S0377-2217(97)00290-7 Ball, 1983, Planning for truck fleet size in the presence of a common-carrier option, Decision Sciences, 14, 103, 10.1111/j.1540-5915.1983.tb00172.x Bolduc, 2007, A heuristic for the routing and carrier selection problem, European Journal Operations Research, 183, 926, 10.1016/j.ejor.2006.10.013 Bolduc, 2008, A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers, Journal Operations Research Society, 59, 776, 10.1057/palgrave.jors.2602390 Chu, 2005, A heuristic algorithm for the truckload and less than- truckload problem, European Journal Operations Research, 165, 657, 10.1016/j.ejor.2003.08.067 Chu, 2007, A heuristic algorithm for the multi-depot vehicle routing problem with outsider carrier selection, Technical report Clarke, 1964, Scheduling of vehicles from a central depot to a number of delivery points, Operation Research, 12, 568, 10.1287/opre.12.4.568 Cordeau, 1998, A tabu search heuristic for periodic and multi-depot vehicle routingproblems, Networks, 30, 105 Côté, 2009, A tabu search heuristic for the vehicle routing problem with private fleet and common carrier, European Journal Operations Research, 198, 464, 10.1016/j.ejor.2008.09.009 CPLEX optimization subroutine library guide and reference, version 11.0, 2008 Fourer R., Gay D.M., Kernighan B.W. AMPL: A Modeling Language for Mathematical Programming, 2a ed., Brooks/Cole-Thomson, 2002. Klincewicz, 1990, Fleet size planning when outside carrier service are available, Transportation Science, 24, 169, 10.1287/trsc.24.3.169 Kratica, 2012, A Genetic algorithm for the routing and carrier selection problem, ComSIS, 9, 49, 10.2298/CSIS100425067K Li, 2007, The open vehicle routing problem: algorithms, large-scale test problems, and computational results, Computers and Operations Research, 34, 2918, 10.1016/j.cor.2005.11.018 Liu, 2012, The close-open mixed vehicle routing problem, European Journal of Operational research, 220, 349, 10.1016/j.ejor.2012.01.061 Potvin, 2011, Tabu Search with ejection chains for the vehicle routing problem with private fleet and common carrier, Journal Operations Research Society, 62, 326, 10.1057/jors.2010.102 Potvin, 2011, Tabu search with ejection chains for the vehicle routing problem with private fleet and common carrier, Journal of the operational research society, 62, 326, 10.1057/jors.2010.102 Prins, 2006, The capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking, 4-OR, AQuarterly journal of Operations research, 4, 221 Prodhon, 2014, A survey of recent research on location routing problems, European Journal of Operational Research, 128, 1, 10.1016/j.ejor.2014.01.005 Stenger, 2013, An adaptative variable neighboorhod search algorithm for a vehicle routing problem arising in small package shipping, Transportation Science, 47, 64, 10.1287/trsc.1110.0396 Toro-Ocampo, 2016, Modelo matemático para resolver el problema de localización y ruteo con restricciones de capacidad, considerando flota propia y subcontratada, Ingeniería Investigación y Tecnología, XVII, 357, 10.1016/j.riit.2016.07.006 Toro-Ocampo, 2016, Modelo matemático para resolver el problema de localización y ruteo con restricciones de capacidad, considerando flota propia y subcontratada, Ingeniería Investigación y Tecnología, XVII, 357, 10.1016/j.riit.2016.07.006