Mostrar el registro sencillo del ítem

Literature review on the vehicle routing problem in the green transportation context

dc.contributor.authorToro O., Eliana M.spa
dc.contributor.authorEscobar Z., Antonio H.spa
dc.contributor.authorGranada E., Mauriciospa
dc.date.accessioned2016-02-09 00:00:00
dc.date.available2016-02-09 00:00:00
dc.date.issued2016-02-09
dc.identifier.urihttps://revistasojs.ucaldas.edu.co/index.php/lunazul/article/view/1623
dc.description.abstractIn the efficient management of the supply chain the optimal management of transport of consumables and finished products appears. The costs associated with transport have direct impact on the final value consumers must pay, which in addition to requiring competitive products also demand that they are generated in environmentally friendly organizations. Aware of this reality, this document is intended to be a starting point for Master’s and Doctoral degree students who want to work in a line of research recently proposed: green routing. The state of the art of the vehicle routing problem is presented in this paper, listing its variants, models and methodologies for solution. Furthermore, the proposed interaction between variants of classical routing problems and environmental effects of its operations, known in the literature as Green- VRP is presented. The goal is to generate a discussion in which mathematical models and solution strategies that can be applied within organizations that consider within their objectives an efficient and sustainable operation are posed.spa
dc.description.abstractEn el gerenciamiento eficiente de la cadena de suministro aparece la gestión óptima del transporte de insumos y productos terminados. Los costos asociados al transporte tienen impacto directo sobre el valor final que deben pagar los consumidores, que además de requerir productos competitivos también exigen que los mismos sean generados en organizaciones amigables con el medioambiente. Consientes de esa realidad este documento pretende ser un punto de partida para estudiantes de maestría y doctorado que quieran trabajar en una línea de investigación propuesta recientemente: el ruteo verde. En este trabajo se muestra un estado del arte del problema de ruteo de vehículos, enumerando sus variantes, modelos y metodologías de solución. Además, se presenta la interacción que se ha propuesto entre variantes clásicas de los problemas de ruteo y los efectos ambientales de su operación, denominados en la literatura como Green-VRP. El objetivo es generar una discusión donde se planteen modelos matemáticos y estrategias de solución que puedan ser aplicadas en organizaciones que consideren dentro de sus objetivos una operación eficiente y sustentable.eng
dc.format.mimetypeapplication/pdfeng
dc.language.isoengeng
dc.publisherUniversidad de Caldasspa
dc.rightsDerechos de autor 2016 Luna Azuleng
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/eng
dc.sourcehttps://revistasojs.ucaldas.edu.co/index.php/lunazul/article/view/1623eng
dc.subjectHeuristics for the vehicle routing problemeng
dc.subjectvehicle routing problemeng
dc.subjectEmission estimation techniqueseng
dc.subjectgreen transportationeng
dc.subjectHeurísticas para el problema de ruteo de vehículosspa
dc.subjectproblema de ruteo de vehículosspa
dc.subjecttécnicas de estimación de emisionesspa
dc.subjecttransporte verdespa
dc.titleLiterature review on the vehicle routing problem in the green transportation contextspa
dc.typeSección Artículos de revisiónspa
dc.typeArtículo de revistaspa
dc.typeJournal Articleeng
dc.identifier.eissn1909-2474
dc.relation.citationendpage387
dc.relation.citationissue42spa
dc.relation.citationstartpage362
dc.relation.ispartofjournalRevista Luna Azul (On Line)spa
dc.relation.referencesAcharya, S. (2013). Vehicle Routing and Scheduling Problems with time window constraints-Optimization Based Models. Int Jr. of Mathematical Sciences & Applications, 3(1). ISSN No: 2230-9888.eng
dc.relation.referencesArchetti, C., Savelsbergh, M. and Speranza, M. (2006). Worst-case analysis for Split delivery vehicle routing problems. Transportation Science, 40(2), 226-234.eng
dc.relation.referencesAzi, N., Gendreau, M. and Potvin, J. (2010). An Adaptive large neighborhood search for a Vehicle Routing Problem with Multiple Trips. CIRRELT-2010-08.eng
dc.relation.referencesBaldacci, R., Bartolini, E. and Laporte G. (2010). Some application of the generalized vehicle routing problem. Journal of the operational research society, 61,1072-1077.eng
dc.relation.referencesBaldacci, R., Christofides, N. and Mingozzi, A. (2008). An exact algorithm for VRP based on a the set partitioning formulation with additional cuts. Math. Programming, 115(2), 351-385.eng
dc.relation.referencesBaldacci, R. and Mingozzi, A. (2004). A Unified Exact Algorithm For The CVRP Base On A Two-Commodity Network Flow Formulation. OR, 52, 723-738.eng
dc.relation.referencesBaldacci, R., Toth, P. and Vigo, D. (2010). Exact Algorithms For Routing Problems Under Vehicle Capacity Constraints. Annals of Operations Research, 175(1), 213-245.eng
dc.relation.referencesBeasley, J. (1983). Route first-cluster second methods for VRP. Omega, 1, 403-408.eng
dc.relation.referencesBektas, I. and Laporte, G. (2011). The Pollution-Routing Problem. Transportation Research Part B: Methodological, 45(8), 1232-1250.eng
dc.relation.referencesBertsimas, D. (1992). A vehicle routing problem with stochastic demand, Operations Research, 40, 574-585eng
dc.relation.referencesBodin, L. (1974). A taxonomic Structure for Vehicle Routing and Scheduling Problems. Computers and Urban Society, 1, 11-29.eng
dc.relation.referencesBodin, L. and Golden, B. (1981). Classification in Vechule Routing and Scheduling Problems. Networks, 11, 97-108.eng
dc.relation.referencesBodin, L. and Sexton, T. (1979). The Subscriber Dial-a-Ride Problem. Final report. U.S. Department of Transportation, Urban Mass Transportation Administration, Washington, D.C.eng
dc.relation.referencesBräysy, O. and Gendreau, M. (2005). Vehicle Routing Problem with time windows, Part II: Metaheuristics. Journal Transportation Science, 39(1), 119-139.eng
dc.relation.referencesCacchiani, V., Hemmelmayr, V. and Tricoire, F. (2014). A Set-Covering Based Heuristic Algorithm For The Periodic VRP. Discrete Applied Mathematics,163(1), 53-64.eng
dc.relation.referencesCaramia, M. and Guerriero, F. (2010). A Heuristic Approach For the truck and trailer routing problem. JORS, 61, 1168-1180.eng
dc.relation.referencesChen, J. F. and Wu, T. H. (2006). Vehicle routing problem with simultaneous deliveries and pickups. Journal of the Operational Research Society, 57(5), 579-587.eng
dc.relation.referencesClarke, G. and Wright, J. (1964). Scheduling of Vehicles from a Central Depot a Number of Delivery Points. Operations Research, 12, 568-581.eng
dc.relation.referencesContardo, C., Cordeau, J. F. and Gendron, B. (2014). A GRASP+ILP-Based Metaheuristic for the capacitated routing problem. J Heuristics, 20, 1-38.eng
dc.relation.referencesCordeau, J. (2006). A Branch-And-Cut Algorithm For The Dial-a ride problem. OR, 54(3), 573-586.eng
dc.relation.referencesCordeau, J. and Laporte, G. (2003). The Dial-a-ride problem (DARP): Variants, Modeling Issues And Algorithms. 4OR, 1, 89-101.eng
dc.relation.referencesCorona, J. A. (2005). Hiperheurísticas a través de programación genética para la resolución de problemas de ruteo de vehÌculos. Master Thesis. Instituto Tecnológico de Monterrey.eng
dc.relation.referencesCrainic, T., Perboli, G., Mancini, S. and Tadei, R. (2010). Two-Echelon VRP: A Satellite Location Analisis. PROCEDIA Social and Behavioral Sciencies, 2(3), 5944-5955.eng
dc.relation.referencesDantzing, G. and Ramser, J. (1959). The Truck Dispatching problem. Managment Sciencie, 6(1), 80-91.eng
dc.relation.referencesDekker, R., Bloemhof, J. and Mallidis, I. (2012). OR for Green-Logistics-An Overwiev of Aspects, Issues, Contributions and Challenges. Operations Research in Health Care, EJOR, 219, 671-679.eng
dc.relation.referencesDemir, E., Bektas, T. and Laporte, G. (2012). An adaptative large neighborhood search heuristics for the pollution routing problem. European Journal of Operations Research, 223, 346-359.eng
dc.relation.referencesDETR Circular 02/2000, Contaminated Land: Implementation of Part IIA of the Enviromental Protection Act 1990, 1990. Feb-14-2014. [Online]. Available on http://www.eugris.info/displayresource.aspx?r=4460.eng
dc.relation.referencesDonati, A., Montemanni, R., Casagrande, N., Rizzoli, A. and Gambardella, L. (2008). Time Dependent VRP With A Multi Ant Colony System. EJOR, 185(3),1174-1191.eng
dc.relation.referencesEilon, S., Watson, C. and Christofides, N. (1971). Distribution Management: Mathematical Modelling and Practical Analysis. London: Griffin.eng
dc.relation.referencesEksioglu, B., Vural, A. and Reisman, A. (2009). Survey: The Vehicle Routig Problem: A taxonomic review. Journal Computers and Industrial Enginnering, 57(4), 1472-1483.eng
dc.relation.referencesErdogan, S. and Miller-Hooks, E. (2012). A Green Vehicle Routing Problem. Transportation Research Part E, 48(1), 100-114.eng
dc.relation.referencesEscobar, J., Linfati, R. and Toth, P. (2013). A two-phase hybrid algorithm for the capacitated location-routing problem. COR, 40(1), 70-79.eng
dc.relation.referencesEuchi, J., Chabchoub, H. and Yassine, A. (2011). New Evolutionary Algorithm Based On 2-Opt Local Search To Solve The Vehicle Routing Problem with Private fleet and common carrier. International Journal of Applied Metaheuristic, 2(1) 58-82.eng
dc.relation.referencesFigliozzi, M. (2010). Vehicle Routing Problem for Emissions Minimization. Transportation Research Record, 2197, 1-7.eng
dc.relation.referencesFischetti, M., Toth P. and Vigo, D. (1994). A branch and bound algorithm for the capacitated vehicle routing problem on direct graphs. Operations Research, 42, 846-859.eng
dc.relation.referencesFukasawa, R., Lysgaard, J., de Aragão, M. P., Reis, M., Uchoa, E. and Werneck, R. F. (2004). Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Lecture Notes in Computer Science, 3064, 1-15.eng
dc.relation.referencesGarcía-Nájera, A. (2012). The vehicle routing problem with backhauls: a multi-objective evolutionary approach. In Hao, J.-K. and Middendorf, M. (Eds.), Evolutionary Computation in Combinatorial Optimization. Lecture Notes in Computer Science, 7245, 255-266. Springer.eng
dc.relation.referencesGendreau, M., Hertz, A. and Laporte, G. (2001). New insertion and post-optimization procedures for TSP. OR, 40, 1086-1094.eng
dc.relation.referencesGhannadpour, S. F., Noori, S., T.-Moghaddam R. and Ghoseiri, K. (2014). A multi-objective dynamic vehicle routing problem with fuzzy time windows: Model, solution and application. Applied Soft Computing, 14, Part C, 504-527.eng
dc.relation.referencesGhiani, G., Guerriero, F., Laporte, G. and Musmanno, R. (2003). Real-Time Vehicle Routing: Solution Concepts, Algorithms And Parallel Computing Strategies. EJOR, 151(1), 1-11.eng
dc.relation.referencesGhiani, G. and Improta, G. (2000). An Efficient Transformation Of The Generalized Vehicle Routing Problem. EJOR, 122(1), 11-17.eng
dc.relation.referencesGiagli, G., Minis, I., Tatarakis, A. and Zeimpekis, V. (2004). Minimizing Logistics Risk Through RTVRP And Mobile Technologies: Research. IJPD & LM, 34(9), 749-764.eng
dc.relation.referencesGolden, B., Magnanti, L. and Nguyan, H. (1972). Implementing Vehicle Routing Algorithms. Networks, 7(2), 113-148.eng
dc.relation.referencesGolden, B. and Stewart, W. (1975). Vehicle Routing Problem with Probabilistic Demands. Computer Sciencie and statistics: tenth annual symposium on the interface, 503, 252-259.eng
dc.relation.referencesHelsgaun, K. (2000). An effective implementation of the Lin-Kernighan traveling salesman heuristic. European Journal of Operational Research, 126, 106-130.eng
dc.relation.referencesHemmelmayr, V. and Doerner, K. (2009). A variable neighboorhood search heuristic for periodical vehicle routing problems. EJOR, 195(3), 791-802.eng
dc.relation.referencesHutton, B. (2002). The importance of relating fuel consumption rates and driving cycles, measuring, modelling, monitoring and motivation changes in fuel consumption. Transport Research Institute Workshop.eng
dc.relation.referencesJaramillo, J. R. (2011). The green vehicle routing procedure. In Proceedings, informs annual meeting, October 5-7, Myrtle Beach, South Carolina, USA.eng
dc.relation.referencesJemai, J., Zekri, M. and Mellouli, K. (2012). An NSGA-II Algorithm for the Green Vehicle Routing Problem. 12th European Conference. M·laga, Spain. Springer Berlin Heidelberg, 37-48.eng
dc.relation.referencesJorgensen, M. and Larsen, J. (2006). Solving Dial-a ride problem using Genetic Algorithm. JOR Society, 58, 1321-1331.eng
dc.relation.referencesKara, I. (2010). On the Miller-Tucker-Zemlin Based Formulations for the Distance-Constrained Capacitated Vehicle Routing Problem. AIP Conference Proceedings, 1309, 551-561.eng
dc.relation.referencesKara, I. (2011). Arc Based Integer Programming Formulations For Distance-Constrained Capacitated Vehicle Routing Problem. LINDI. 3rd IEEE International Symposium on IEEE.eng
dc.relation.referencesKara, I. and Bektas, T. (2003). Integer Linear Problem Formulation Of The Generalized Vehicle Routing Problem. In Proc. 5-th EURO/inf. JIM,2003.eng
dc.relation.referencesKara, I. and Pop, C. (2008). New Mathematical Models of the Generalized Vehicle Routing Problems and extensionsInt. Conf. on Applied Mahematical Programming and Modelling, Bratislava, Slovakia.eng
dc.relation.referencesKoskosidis, Y., Powell, W. and Solomon, M. (1982). An optimization-based heuristic for vehicle routing and scheduling problem with soft time windows constraints. Transportation Sciencie, 26(2), 69-85.eng
dc.relation.referencesKucukoglu, I., Ene, S., Askoy, A. and Ozturk, N. (2013). A green capacitated vehicle routing problem with fuel consumption optimization model. International Journal of Computational Engineering Research, 3(7), 16-23.eng
dc.relation.referencesKumar, S. and Pannerselvam, R. (2012). A survey on the Vehicle Routing Problem and its variants. Intelligent Information Management, 4, 66-74.eng
dc.relation.referencesKuo, Y. (2011). Using simulated annealing to minimize fuel consumption for the time dependent vehicle routing problem. Computers & Industrial Enginnering, 131, 44-51.eng
dc.relation.referencesKwon, Y., Choi, Y. and Lee, D. (2013). Heterogeneous fixed fleet vehicle routing considering carbon emission. Transportation Research Part D, 23, 81-89.eng
dc.relation.referencesLabbÈ, M., Laporte, G. and Mercure, H. (1991). Capacitated Vehicle Routing Problems on trees. OR, 39, 616-622.eng
dc.relation.referencesLacomme, P., Prins, C. and Ramdane, W. (2001). A Genetic Algorithm for the Capacitated arc routing problem and its extensions. In AEC, E.J.W. Boers (Ed.), Lecture Notes in Computer Sciencies, 2037, 473-483. Springer.eng
dc.relation.referencesLaporte, G. (1992). The VRP: An Overview Of Exact And Approximate algorithms. EJOR, 59, 345-358.eng
dc.relation.referencesLaporte, G., Gendreau, M., Potvin, J. and Semet, F. (2002). Classical and modern heuristics for the vehicle routing problem. International Transactions in OR, 7, 285-300.eng
dc.relation.referencesLaporte, G. and Nobert, Y. (1987). Exact algorithms for the Vehicle Routing Problem. Discrete Mathematics, 31, 147-184.eng
dc.relation.referencesLau, C. H. Sim, M. and Teo M. K. (2003). Vehicle routing problem with time windows and limited number of vehicles. European Journal of Operational Research, 148, 3,559-569eng
dc.relation.referencesLeal, I. and D'Agosto, M. (2011). Choice For Transportation Of Hazardous Materials: The Case Of Land Modes Of Transport Of Bio-Ethanol In Brazil. Journal of Cleaner Production, 19(2-3), 229-240.eng
dc.relation.referencesLevin, A. (1971). Scheduling And Fleet Routing Models For Transportation Systems. Transportation Sciencie, 5(3), 232-256.eng
dc.relation.referencesLi, F., Golden, B. and Wasil, E. (2007). The open vehicle routing problem : algorithms large-scale test problem, and computational results. Computers & Operations Research, 34, 2918-2930.eng
dc.relation.referencesLi, X., Leung, S.C.H. and Tian, P. (2012). A multistart adaptative memory based tabu search algorithm for the heterogeneous fixed fleet open vehicle routing problem. Experts Systems with Application, 39, 365-374.eng
dc.relation.referencesLiebman, J. and Marks, D. (1970). Mathematical analysis of solid waste collections. Public Health Service. Publ No 2065. Ms Depot of Health. Education and Welfare.eng
dc.relation.referencesLima, C., Goldbarg, M. and Goldbarg, E. (2004). A Memetic Algorithm for the HFVRP. Electronic Notes in Discrete Math, 18, 171-176.eng
dc.relation.referencesLiong, Ch-.Y., Wan Rosmanira, I., Khairuddin, O. and Zirour, M. (2008). Vehicle Routing Problem: Models And Solutions. JQMA, 4 (1), 205-218.eng
dc.relation.referencesMalandraki, C. and Daskin, M. (1992). Time Dependent Vehicle Routin Problem: Formulations, Solution Algorithms And Computational Experiments. Transportation Sciencie, 26(3), 185-200.eng
dc.relation.referencesMarinakis, Y., Migdalas, A. and Pardalos, P. (2007). A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm. J Glob Optim, 38, 555-580.eng
dc.relation.referencesMarks, H. and Stricker, R. (1971). Routing For Public Service Vehicles. ASCE Journal of the Urban Planning and Development Division, 97(UP2), 165-178.eng
dc.relation.referencesMartinelli, R., Pecin, D., Poggi, M. and Longo, H. (2010). Column generation bounds for Capacitated arc routing problem. In Proceedings of the XLII SOBRAPO.eng
dc.relation.referencesMartinelli, R., Poggi, M. and Subramanian, A. (2011). Improved bounds for large scale capacitated arc routing problem. Technical report MCC14/11, Dep. de Inform·tica, (PUC-Rio), Brazil.eng
dc.relation.referencesMbaraga, P., Langevin, A. and Laporte, G. (1999). Two exact algorithms for the vehicle routing problem on trees. Naval Research Logistics, 46, 75-89.eng
dc.relation.referencesMcKinnon, A. and Woodburn, A. (1996). Logistical Restructuring And Road Freight Traffic Growth: An Empirical Assessment. Transportation, 23(2), 141-161.Bhawna Minocha et al / (IJCSIT) International Journal of Computer Science and Information Technologies, Vol. 2 (6) , 2011, 2671-2676.eng
dc.relation.referencesMinocha, B.; Tripathi, S.; Mohan, C., Solving. (2011). Vehicle Routing and scheduling problems using hybrid genetic algorithm. Electronics Computer Technology (ICECT), 2011 3rd International Conference on , vol.2, 189-193.eng
dc.relation.referencesMole, R. and S. Jameson, S. (1976). A sequential route-building algorithm employingageneralized saving criterion. Operation Research Quarterly, 11, 503-511.eng
dc.relation.referencesNagy, G. and Salhi, S. (2003). Heuristic algorithms for single and multiple depot vehicle routing problems with pick ups and deliveries. Working Paper no. 42, Canterbury Business School.eng
dc.relation.referencesNaud, M. and Potvin, J. (2009). Tabu Search with ejections chains for Vehicle Routing Problem with Private Fleet and Common Carrier. CIRRELT-2009-50.eng
dc.relation.referencesOlivera, A. and Viera, O. (2007). Adaptive memory programming for the Vehicle routing problem with multiple trips. COR, 34(1), 28-47.eng
dc.relation.referencesOmbuki-Berman, B. and Hanshar, F. (2009). Using GA for multi-depot vehicle routing. In Bio-Inspired Algorithms for the VRP (161, 77-99). Ed: Springer - Studies in Computational Int.eng
dc.relation.referencesÖzyurt, Z., Aksen, D. and Aras, N. (2006). OVRP with time deadlines: solution methods and applications. OR Proceedings 2005. Springer Berlin Heidelberg, 73-78.eng
dc.relation.referencesPalmer, A. (2008). The Development of an Integrated Routing and Carbon Dioxide Emissions Model for Goods Vehicles. PhD Thesis. Cranfield University.eng
dc.relation.referencesParaskevopoulos, D., Repoussis, P., Tarantilis, C., Ioannou, G. and Prastacos, G. (2008). A Reactive VNSTS For The HFVRP With Time Windows. Journal of Heuristics, 14(5), 425-455.eng
dc.relation.referencesPerboli, G. and Tadei, R. (2010). New Families Of Valid Inequalities For The Two-Echelon Vehicle Routing Problem. Electronic Notes in Discrete Mathematics, 36, 639-646.eng
dc.relation.referencesPessoa, A., Uchoa, E. and de Aragão, P. (2008). The VRP: Latest advances and New Challenges. Robust Branch-Cut-Price Algorithms for VRP. Springer, 297-325.eng
dc.relation.referencesPiecyk, M. (2010). Analysis Of Long-Term Freight Transport, Logistics And Related CO2 Trendson A Business-As-Usual Basis. Doctor of Philosophy, Heriot-Watt University.eng
dc.relation.referencesPop, P., Pintea, C. and Zelina, I. (2008). Solving The Generalized Vehicle Routing Problem with an ACS-based Algorithm. AIP Conference Proceedings: BICS,1117(1), 157-162.eng
dc.relation.referencesPradenas, L., Oportus, B. and Parada, V. (2013). Mitigation of greenhouse gas emissions in vehicle routing problems with backhauling. ES with Applications, 40(8), 2985-2991.eng
dc.relation.referencesPrins, C., Prodhon, C., Ruiz, A., Soriano, P. and Wolfler, R. (2007). Solving the CLRP by a Coop. Lagrangean Relaxation-Granular Heuristic. Transportation Sciencie, 41(4), 470-483.eng
dc.relation.referencesQiu, L., Hsu, W., Huang, S. and Wangz, H. (2002). Scheduling and routing algorithms for AGVs: a Survey. International Journal Production Research, 40(3), 745,760.eng
dc.relation.referencesQuariguasi, F., Walther, G., Bloemho, J., Nunnen, J. and Spengler, T. (2009). A Methodology for assesing eco-efficiency in logistics networks. European Journal Operations Research, 193, 670-682.eng
dc.relation.referencesReisman, A. (1992). Management Science Knowledge: Its Creation, Generalization, and Consolidation. Greenwood P.eng
dc.relation.referencesRenaud, J., Laporte, G. and Boctor, F. (1996). A Tabu Search heuristic for the Multi Depot Vehicle Routing Problem. COR, 23, 229-235.eng
dc.relation.referencesRomilly, P. (1999). Substitution of bus for car travel in urban britain: an economic evaluation of bus and car exhaust emission and other costs. Transportation Research part D: Transport and Enviroment, 4(2), 109-125.eng
dc.relation.referencesSalhi, S. and Sari, M. (1997). A multi-level composite heuristic for the multidepot vehicle fleet mix problem. EJOR, 103, 95-112.eng
dc.relation.referencesSariklis, D. and Powell, S. (2000). A Heuristic Method The Open Vehicle Routing Problem. JORS, 51, 564-573.eng
dc.relation.referencesSarkis, J., Zhu, Q. and Lai, K. (2011). An organizational theoretic review of green supply chain management literature. International Journal of Production Economics, 130, 1-15.eng
dc.relation.referencesSbihi, A. and Eglease, W. (2007). The relationship between VRP and Scheduling and Green Logistics - A Literature Survey.Working paper. The Department of Management Science Lancaster University Management School, UK.eng
dc.relation.referencesShen, Z., Ordoñez, F. and Dessouky, M. M. (2009). The stochastic vehicle routing problem for minimum unmet demand; chap. IV. Springer Optimization and Its Applications. Springer US, Boston, MA, 349-37.eng
dc.relation.referencesSolomon, M. (1987). Algorithms For Vehicle Scheduling Routing Problem With Time Windows. Operations Research, 35(2), 354-265.eng
dc.relation.referencesSrivastava, S. (2007). Green Supply-Chain Managment. A State Of The Art Literature Review. International Journal of Managment Reviews, 9(1), 53-80.eng
dc.relation.referencesSubramanian, A. (2012). Heuristic, exact and hybrid approaches for VRP. PhD Thesis. Universidade Federal Fluminense. Niteroi.eng
dc.relation.referencesSubramanian, A., Drummon, L., Bentes, C., Ochu, L. S. and Farias, R. (2010). A parallel heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery. Computers & Operations Research, 37(11), 1899-1911.eng
dc.relation.referencesSuzuki, Y. (2011). A new truck-routing approach for reducing fuel consumption and pollutants emission. Transportation Research Part D: Transport and E, 16(1), 73-77.eng
dc.relation.referencesThangiah, S. Vinayagamoorty, R. and Gubbi A. (1993). Vehicle routing and time deadlines using genetic and loca algorithms. Proceedings of the 5th International Conference on Genetic Algorithms, 506-515eng
dc.relation.referencesThompson, P. M. and Psaraftis, H. N. (1993). Cyclic transfer algorithms for multivehicle routing and scheduling problems. Oper. Res., 41, 935-946.eng
dc.relation.referencesToth, P. and Vigo, D. (2002). Models, Relaxations And Exact Approaches For The Capacitated Arc Routing Problem. Discrete Applied Mathematics, 123(1-3), 487-512.eng
dc.relation.referencesUbeda, S., Arcelus, F. and Faulin, J. (2011). Green Logistics at eroski. A acse study. International Journal on Production Economics, 131, 44-51.eng
dc.relation.referencesVachon, S. and Klassen, R. (2008). Enviromental Managment And Manufacturing Performance: The Role Of Collaboration In The Supply Chain. International Journal Production Economics, 111(2), 299-315.eng
dc.relation.referencesVidal, T., Crainic, T. G., Gendreau, M. and Prins, C. (2013). Heuristics for multi-attribute vehicle routing problems: a survey and synthesis. EJOR, 231(1), 1-21.eng
dc.relation.referencesVidal, T., Crainic, T. G., Gendreau, M. and Prins, C. (2014). Implicit depot assigments and rotations in vehicle routing heuristics. European Journal of Operational Research, 237(1), 15-28.eng
dc.relation.referencesVigo, D. (1996). Heuristic Algorithm For The Arc Capacitated Vehicle Routing Problem. EJOR, 89, 108-126.eng
dc.relation.referencesVillegas, J. G., Prins, C., Prodhon, C., Medaglia, A. L. and Velasco, N. (2010). GRASP/VND and multi-start evolutionary local search for the single TTVRP with satellite depots. Engineering Applications of Artificial Intelligence, 23(5), 780-794.eng
dc.relation.referencesWade, A. and Salhi, S. (2003). Anant system algorithm for the mixed vehicle routing problem with backhauls. In Resende, M. G. C and de Sousa, J. P. (Eds.): Metaheuristics: Computer Decision-Making (Chapter 33, 699-719). Kluwer.eng
dc.relation.referencesWilck IV, J. H. and Cavalier, T. M. (2012). Construction Heuristic for the Split Delivery. American Journal of Operations Research, 2, 153-162. http://dx.doi.org/10.4236/ajor.2012.22018.eng
dc.relation.referencesWilson, N., Sussman, J., Wang, H. and Higonnet, B. (1971). Scheduling algorithms for dial-a-ride Systems. Massachusetts Institute of Technology, Cambridge. Technical report USL TR-70-13.eng
dc.relation.referencesWu, T.H., Low, Ch. and Bai, J.-W. (2002). Heuristic solutions to multi depot location vehicle routing problems. Computers & Operations Research, 29, 1393,1415.eng
dc.relation.referencesXiao, Y., Zhao, Q., Kaku, I. and Xu, Y. (2012). Development of a fuel consumption optimization model for the capacitated vehicle routing problem. Computers and Operations Research, 39(7), 1419-1431.eng
dc.relation.referencesYeun, C. L., Ismail W.R., Omar K., Zirour, M. (2008) Vehicle routing problem: models and solutions. Journal of Quality Measurement and Analysis. 4(1), 205-218.eng
dc.rights.accessrightsinfo:eu-repo/semantics/openAccesseng
dc.title.translatedRevisión de la literatura del problema de ruteo de vehículos en un contexto de transporte verdeeng
dc.type.coarhttp://purl.org/coar/resource_type/c_6501eng
dc.type.contentTexteng
dc.type.driverinfo:eu-repo/semantics/articleeng
dc.type.versioninfo:eu-repo/semantics/publishedVersioneng
dc.relation.citationeditionNúm. 42 , Año 2016 : Enero - Juniospa
dc.relation.bitstreamhttps://revistasojs.ucaldas.edu.co/index.php/lunazul/article/download/1623/1540
dc.type.coarversionhttp://purl.org/coar/version/c_970fb48d4fbd8a85eng
dc.rights.coarhttp://purl.org/coar/access_right/c_abf2eng


Ficheros en el ítem

FicherosTamañoFormatoVer
-1623.pdf824.6Kbapplication/pdfVer/

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem

Derechos de autor 2016 Luna Azul
Excepto si se señala otra cosa, la licencia del ítem se describe como Derechos de autor 2016 Luna Azul