23 references, page 1 of 2
Augerat P., Belenguer J.M., Benavent E., Corberán A., Nadef D. Separating capacity inequalities in the CVRP using Tabu Search. European Journal of Operational Research, volumen 106 (número 2), febrero 1998: 546-557, doi:10.1016/S0377- 2217(97)00290-7
Ball M., Golden A., Assad A., Bodin L. Planning for truck fleet size in the presence of a common-carrier option. Decision Sciences, volumen 14, 1983: 103-120, doi: 10.1111/j.1540-5915.1983. tb00172.x
Bolduc M.C., Renaud J., Boctor F. A heuristic for the routing and carrier selection problem. European Journal Operations Research, volumen 183, diciembre 2007:926-932, doi:10.1016/j. ejor.2006.10.013
Bolduc M.C., Renaud J., Boctor F., Laporte G. A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers. Journal Operations Research Society, volumen 59, junio 2008: 776-787 [en línea]. Disponible en: htp:// www.jstor.org/stable/30132999
Chu C. A heuristic algorithm for the truckload and less thantruckload problem. European Journal Operations Research, volumen 165, 2005: 657-667, doi:10.1016/j.ejor.2003.08.067
Chu C., Chang R., Chang H. A heuristic algorithm for the multidepot vehicle routing problem with outsider carrier selection, Technical report, Department of shipping and Transportation Management, National Taiwan Ocean University, Keelung, Taiwan, 2007.
Clarke G., Wright J. Scheduling of vehicles from a central depot to a number of delivery points. Operation Research, volumen 12, 1964: 568-581 [en línea]. Disponible en: htp://www.jstor.org/ stable/167703
Cordeau J.F., Gendreau M., Laporte G. A tabu search heuristic for periodic and multi-depot vehicle routingproblems. Networks, volumen 30 (número 2), diciembre 1998: 105-119, doi: 10.1002/ (SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G [OpenAIRE]
Côté J.F. y Potvin J.Y. A tabu search heuristic for the vehicle routing problem with private fleet and common carrier. European Journal Operations Research, volumen 198, octubre 2009: 464- 469, doi: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 J., Luss H., Pilcher M. Fleet size planning when outside carrier service are available. Transportation Science, volumen 24, 1990:169-182, doi:10.1287/trsc.24.3.169 [OpenAIRE]
Kratica J., Kostic T., Tosic D., Dugosiga D., Filipovic V. A Genetic algorithm for the routing and carrier selection problem. ComSIS, volumen 9, (número 1), enero 2012: 49-62, doi: 10.2298/ CSIS100425067K [OpenAIRE]
Li F., Golden B., Wasil, E. The open vehicle routing problem: algorithms, large-scale test problems, and computational results. Computers and Operations Research, volumen 34, octubre 2007: 2918-2930, doi:10.1016/j.cor.2005.11.018 [OpenAIRE]
Liu R. y Zhibin J. The close-open mixed vehicle routing problem. European Journal of Operational research, volumen 220, febrero 2012: 349-360, doi:10.1016/j.ejor.2012.01.061
23 references, page 1 of 2
Copyright policy)
Powered by OpenAIRE Research Graph