PDF
FLIP
Cómo citar
Toro O., E. M., Escobar Z., A. H., & Granada E., M. (2016). Literature review on the vehicle routing problem in the green transportation context. Luna Azul, (42), 362–387. https://doi.org/10.17151/luaz.2016.42.21
Más formatos de cita
Autores/as
Resumen
In 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.
Palabras clave:
Citas
Acharya, 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.
Archetti, C., Savelsbergh, M. and Speranza, M. (2006). Worst-case analysis for Split delivery vehicle routing problems. Transportation Science, 40(2), 226-234.
Azi, N., Gendreau, M. and Potvin, J. (2010). An Adaptive large neighborhood search for a Vehicle Routing Problem with Multiple Trips. CIRRELT-2010-08.
Baldacci, R., Bartolini, E. and Laporte G. (2010). Some application of the generalized vehicle routing problem. Journal of the operational research society, 61,1072-1077.
Baldacci, 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.
Baldacci, R. and Mingozzi, A. (2004). A Unified Exact Algorithm For The CVRP Base On A Two-Commodity Network Flow Formulation. OR, 52, 723-738.
Baldacci, R., Toth, P. and Vigo, D. (2010). Exact Algorithms For Routing Problems Under Vehicle Capacity Constraints. Annals of Operations Research, 175(1), 213-245.
Beasley, J. (1983). Route first-cluster second methods for VRP. Omega, 1, 403-408.
Bektas, I. and Laporte, G. (2011). The Pollution-Routing Problem. Transportation Research Part B: Methodological, 45(8), 1232-1250.
Bertsimas, D. (1992). A vehicle routing problem with stochastic demand, Operations Research, 40, 574-585
Bodin, L. (1974). A taxonomic Structure for Vehicle Routing and Scheduling Problems. Computers and Urban Society, 1, 11-29.
Bodin, L. and Golden, B. (1981). Classification in Vechule Routing and Scheduling Problems. Networks, 11, 97-108.
Bodin, 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.
Bräysy, O. and Gendreau, M. (2005). Vehicle Routing Problem with time windows, Part II: Metaheuristics. Journal Transportation Science, 39(1), 119-139.
Cacchiani, V., Hemmelmayr, V. and Tricoire, F. (2014). A Set-Covering Based Heuristic Algorithm For The Periodic VRP. Discrete Applied Mathematics,163(1), 53-64.
Caramia, M. and Guerriero, F. (2010). A Heuristic Approach For the truck and trailer routing problem. JORS, 61, 1168-1180.
Chen, 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.
Clarke, G. and Wright, J. (1964). Scheduling of Vehicles from a Central Depot a Number of Delivery Points. Operations Research, 12, 568-581.
Contardo, C., Cordeau, J. F. and Gendron, B. (2014). A GRASP+ILP-Based Metaheuristic for the capacitated routing problem. J Heuristics, 20, 1-38.
Cordeau, J. (2006). A Branch-And-Cut Algorithm For The Dial-a ride problem. OR, 54(3), 573-586.
Cordeau, J. and Laporte, G. (2003). The Dial-a-ride problem (DARP): Variants, Modeling Issues And Algorithms. 4OR, 1, 89-101.
Corona, 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.
Crainic, 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.
Dantzing, G. and Ramser, J. (1959). The Truck Dispatching problem. Managment Sciencie, 6(1), 80-91.
Dekker, 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.
Demir, 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.
DETR 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.
Donati, 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.
Eilon, S., Watson, C. and Christofides, N. (1971). Distribution Management: Mathematical Modelling and Practical Analysis. London: Griffin.
Eksioglu, B., Vural, A. and Reisman, A. (2009). Survey: The Vehicle Routig Problem: A taxonomic review. Journal Computers and Industrial Enginnering, 57(4), 1472-1483.
Erdogan, S. and Miller-Hooks, E. (2012). A Green Vehicle Routing Problem. Transportation Research Part E, 48(1), 100-114.
Escobar, J., Linfati, R. and Toth, P. (2013). A two-phase hybrid algorithm for the capacitated location-routing problem. COR, 40(1), 70-79.
Euchi, 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.
Figliozzi, M. (2010). Vehicle Routing Problem for Emissions Minimization. Transportation Research Record, 2197, 1-7.
Fischetti, 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.
Fukasawa, 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.
Garcí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.
Gendreau, M., Hertz, A. and Laporte, G. (2001). New insertion and post-optimization procedures for TSP. OR, 40, 1086-1094.
Ghannadpour, 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.
Ghiani, 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.
Ghiani, G. and Improta, G. (2000). An Efficient Transformation Of The Generalized Vehicle Routing Problem. EJOR, 122(1), 11-17.
Giagli, G., Minis, I., Tatarakis, A. and Zeimpekis, V. (2004). Minimizing Logistics Risk Through RTVRP And Mobile Technologies: Research. IJPD & LM, 34(9), 749-764.
Golden, B., Magnanti, L. and Nguyan, H. (1972). Implementing Vehicle Routing Algorithms. Networks, 7(2), 113-148.
Golden, B. and Stewart, W. (1975). Vehicle Routing Problem with Probabilistic Demands. Computer Sciencie and statistics: tenth annual symposium on the interface, 503, 252-259.
Helsgaun, K. (2000). An effective implementation of the Lin-Kernighan traveling salesman heuristic. European Journal of Operational Research, 126, 106-130.
Hemmelmayr, V. and Doerner, K. (2009). A variable neighboorhood search heuristic for periodical vehicle routing problems. EJOR, 195(3), 791-802.
Hutton, 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.
Jaramillo, J. R. (2011). The green vehicle routing procedure. In Proceedings, informs annual meeting, October 5-7, Myrtle Beach, South Carolina, USA.
Jemai, 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.
Jorgensen, M. and Larsen, J. (2006). Solving Dial-a ride problem using Genetic Algorithm. JOR Society, 58, 1321-1331.
Kara, I. (2010). On the Miller-Tucker-Zemlin Based Formulations for the Distance-Constrained Capacitated Vehicle Routing Problem. AIP Conference Proceedings, 1309, 551-561.
Kara, I. (2011). Arc Based Integer Programming Formulations For Distance-Constrained Capacitated Vehicle Routing Problem. LINDI. 3rd IEEE International Symposium on IEEE.
Kara, I. and Bektas, T. (2003). Integer Linear Problem Formulation Of The Generalized Vehicle Routing Problem. In Proc. 5-th EURO/inf. JIM,2003.
Kara, 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.
Koskosidis, 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.
Kucukoglu, 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.
Kumar, S. and Pannerselvam, R. (2012). A survey on the Vehicle Routing Problem and its variants. Intelligent Information Management, 4, 66-74.
Kuo, Y. (2011). Using simulated annealing to minimize fuel consumption for the time dependent vehicle routing problem. Computers & Industrial Enginnering, 131, 44-51.
Kwon, Y., Choi, Y. and Lee, D. (2013). Heterogeneous fixed fleet vehicle routing considering carbon emission. Transportation Research Part D, 23, 81-89.
LabbÈ, M., Laporte, G. and Mercure, H. (1991). Capacitated Vehicle Routing Problems on trees. OR, 39, 616-622.
Lacomme, 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.
Laporte, G. (1992). The VRP: An Overview Of Exact And Approximate algorithms. EJOR, 59, 345-358.
Laporte, 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.
Laporte, G. and Nobert, Y. (1987). Exact algorithms for the Vehicle Routing Problem. Discrete Mathematics, 31, 147-184.
Lau, 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-569
Leal, 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.
Levin, A. (1971). Scheduling And Fleet Routing Models For Transportation Systems. Transportation Sciencie, 5(3), 232-256.
Li, 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.
Li, 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.
Liebman, J. and Marks, D. (1970). Mathematical analysis of solid waste collections. Public Health Service. Publ No 2065. Ms Depot of Health. Education and Welfare.
Lima, C., Goldbarg, M. and Goldbarg, E. (2004). A Memetic Algorithm for the HFVRP. Electronic Notes in Discrete Math, 18, 171-176.
Liong, Ch-.Y., Wan Rosmanira, I., Khairuddin, O. and Zirour, M. (2008). Vehicle Routing Problem: Models And Solutions. JQMA, 4 (1), 205-218.
Malandraki, C. and Daskin, M. (1992). Time Dependent Vehicle Routin Problem: Formulations, Solution Algorithms And Computational Experiments. Transportation Sciencie, 26(3), 185-200.
Marinakis, 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.
Marks, H. and Stricker, R. (1971). Routing For Public Service Vehicles. ASCE Journal of the Urban Planning and Development Division, 97(UP2), 165-178.
Martinelli, R., Pecin, D., Poggi, M. and Longo, H. (2010). Column generation bounds for Capacitated arc routing problem. In Proceedings of the XLII SOBRAPO.
Martinelli, 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.
Mbaraga, P., Langevin, A. and Laporte, G. (1999). Two exact algorithms for the vehicle routing problem on trees. Naval Research Logistics, 46, 75-89.
McKinnon, 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.
Minocha, 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.
Mole, R. and S. Jameson, S. (1976). A sequential route-building algorithm employingageneralized saving criterion. Operation Research Quarterly, 11, 503-511.
Nagy, 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.
Naud, M. and Potvin, J. (2009). Tabu Search with ejections chains for Vehicle Routing Problem with Private Fleet and Common Carrier. CIRRELT-2009-50.
Olivera, A. and Viera, O. (2007). Adaptive memory programming for the Vehicle routing problem with multiple trips. COR, 34(1), 28-47.
Ombuki-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.
Özyurt, Z., Aksen, D. and Aras, N. (2006). OVRP with time deadlines: solution methods and applications. OR Proceedings 2005. Springer Berlin Heidelberg, 73-78.
Palmer, A. (2008). The Development of an Integrated Routing and Carbon Dioxide Emissions Model for Goods Vehicles. PhD Thesis. Cranfield University.
Paraskevopoulos, 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.
Perboli, 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.
Pessoa, 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.
Piecyk, M. (2010). Analysis Of Long-Term Freight Transport, Logistics And Related CO2 Trendson A Business-As-Usual Basis. Doctor of Philosophy, Heriot-Watt University.
Pop, 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.
Pradenas, 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.
Prins, 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.
Qiu, 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.
Quariguasi, 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.
Reisman, A. (1992). Management Science Knowledge: Its Creation, Generalization, and Consolidation. Greenwood P.
Renaud, J., Laporte, G. and Boctor, F. (1996). A Tabu Search heuristic for the Multi Depot Vehicle Routing Problem. COR, 23, 229-235.
Romilly, 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.
Salhi, S. and Sari, M. (1997). A multi-level composite heuristic for the multidepot vehicle fleet mix problem. EJOR, 103, 95-112.
Sariklis, D. and Powell, S. (2000). A Heuristic Method The Open Vehicle Routing Problem. JORS, 51, 564-573.
Sarkis, 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.
Sbihi, 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.
Shen, 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.
Solomon, M. (1987). Algorithms For Vehicle Scheduling Routing Problem With Time Windows. Operations Research, 35(2), 354-265.
Srivastava, S. (2007). Green Supply-Chain Managment. A State Of The Art Literature Review. International Journal of Managment Reviews, 9(1), 53-80.
Subramanian, A. (2012). Heuristic, exact and hybrid approaches for VRP. PhD Thesis. Universidade Federal Fluminense. Niteroi.
Subramanian, 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.
Suzuki, 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.
Thangiah, 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-515
Thompson, P. M. and Psaraftis, H. N. (1993). Cyclic transfer algorithms for multivehicle routing and scheduling problems. Oper. Res., 41, 935-946.
Toth, P. and Vigo, D. (2002). Models, Relaxations And Exact Approaches For The Capacitated Arc Routing Problem. Discrete Applied Mathematics, 123(1-3), 487-512.
Ubeda, S., Arcelus, F. and Faulin, J. (2011). Green Logistics at eroski. A acse study. International Journal on Production Economics, 131, 44-51.
Vachon, 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.
Vidal, 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.
Vidal, 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.
Vigo, D. (1996). Heuristic Algorithm For The Arc Capacitated Vehicle Routing Problem. EJOR, 89, 108-126.
Villegas, 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.
Wade, 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.
Wilck 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.
Wilson, 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.
Wu, T.H., Low, Ch. and Bai, J.-W. (2002). Heuristic solutions to multi depot location vehicle routing problems. Computers & Operations Research, 29, 1393,1415.
Xiao, 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.
Yeun, 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.
Archetti, C., Savelsbergh, M. and Speranza, M. (2006). Worst-case analysis for Split delivery vehicle routing problems. Transportation Science, 40(2), 226-234.
Azi, N., Gendreau, M. and Potvin, J. (2010). An Adaptive large neighborhood search for a Vehicle Routing Problem with Multiple Trips. CIRRELT-2010-08.
Baldacci, R., Bartolini, E. and Laporte G. (2010). Some application of the generalized vehicle routing problem. Journal of the operational research society, 61,1072-1077.
Baldacci, 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.
Baldacci, R. and Mingozzi, A. (2004). A Unified Exact Algorithm For The CVRP Base On A Two-Commodity Network Flow Formulation. OR, 52, 723-738.
Baldacci, R., Toth, P. and Vigo, D. (2010). Exact Algorithms For Routing Problems Under Vehicle Capacity Constraints. Annals of Operations Research, 175(1), 213-245.
Beasley, J. (1983). Route first-cluster second methods for VRP. Omega, 1, 403-408.
Bektas, I. and Laporte, G. (2011). The Pollution-Routing Problem. Transportation Research Part B: Methodological, 45(8), 1232-1250.
Bertsimas, D. (1992). A vehicle routing problem with stochastic demand, Operations Research, 40, 574-585
Bodin, L. (1974). A taxonomic Structure for Vehicle Routing and Scheduling Problems. Computers and Urban Society, 1, 11-29.
Bodin, L. and Golden, B. (1981). Classification in Vechule Routing and Scheduling Problems. Networks, 11, 97-108.
Bodin, 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.
Bräysy, O. and Gendreau, M. (2005). Vehicle Routing Problem with time windows, Part II: Metaheuristics. Journal Transportation Science, 39(1), 119-139.
Cacchiani, V., Hemmelmayr, V. and Tricoire, F. (2014). A Set-Covering Based Heuristic Algorithm For The Periodic VRP. Discrete Applied Mathematics,163(1), 53-64.
Caramia, M. and Guerriero, F. (2010). A Heuristic Approach For the truck and trailer routing problem. JORS, 61, 1168-1180.
Chen, 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.
Clarke, G. and Wright, J. (1964). Scheduling of Vehicles from a Central Depot a Number of Delivery Points. Operations Research, 12, 568-581.
Contardo, C., Cordeau, J. F. and Gendron, B. (2014). A GRASP+ILP-Based Metaheuristic for the capacitated routing problem. J Heuristics, 20, 1-38.
Cordeau, J. (2006). A Branch-And-Cut Algorithm For The Dial-a ride problem. OR, 54(3), 573-586.
Cordeau, J. and Laporte, G. (2003). The Dial-a-ride problem (DARP): Variants, Modeling Issues And Algorithms. 4OR, 1, 89-101.
Corona, 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.
Crainic, 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.
Dantzing, G. and Ramser, J. (1959). The Truck Dispatching problem. Managment Sciencie, 6(1), 80-91.
Dekker, 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.
Demir, 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.
DETR 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.
Donati, 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.
Eilon, S., Watson, C. and Christofides, N. (1971). Distribution Management: Mathematical Modelling and Practical Analysis. London: Griffin.
Eksioglu, B., Vural, A. and Reisman, A. (2009). Survey: The Vehicle Routig Problem: A taxonomic review. Journal Computers and Industrial Enginnering, 57(4), 1472-1483.
Erdogan, S. and Miller-Hooks, E. (2012). A Green Vehicle Routing Problem. Transportation Research Part E, 48(1), 100-114.
Escobar, J., Linfati, R. and Toth, P. (2013). A two-phase hybrid algorithm for the capacitated location-routing problem. COR, 40(1), 70-79.
Euchi, 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.
Figliozzi, M. (2010). Vehicle Routing Problem for Emissions Minimization. Transportation Research Record, 2197, 1-7.
Fischetti, 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.
Fukasawa, 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.
Garcí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.
Gendreau, M., Hertz, A. and Laporte, G. (2001). New insertion and post-optimization procedures for TSP. OR, 40, 1086-1094.
Ghannadpour, 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.
Ghiani, 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.
Ghiani, G. and Improta, G. (2000). An Efficient Transformation Of The Generalized Vehicle Routing Problem. EJOR, 122(1), 11-17.
Giagli, G., Minis, I., Tatarakis, A. and Zeimpekis, V. (2004). Minimizing Logistics Risk Through RTVRP And Mobile Technologies: Research. IJPD & LM, 34(9), 749-764.
Golden, B., Magnanti, L. and Nguyan, H. (1972). Implementing Vehicle Routing Algorithms. Networks, 7(2), 113-148.
Golden, B. and Stewart, W. (1975). Vehicle Routing Problem with Probabilistic Demands. Computer Sciencie and statistics: tenth annual symposium on the interface, 503, 252-259.
Helsgaun, K. (2000). An effective implementation of the Lin-Kernighan traveling salesman heuristic. European Journal of Operational Research, 126, 106-130.
Hemmelmayr, V. and Doerner, K. (2009). A variable neighboorhood search heuristic for periodical vehicle routing problems. EJOR, 195(3), 791-802.
Hutton, 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.
Jaramillo, J. R. (2011). The green vehicle routing procedure. In Proceedings, informs annual meeting, October 5-7, Myrtle Beach, South Carolina, USA.
Jemai, 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.
Jorgensen, M. and Larsen, J. (2006). Solving Dial-a ride problem using Genetic Algorithm. JOR Society, 58, 1321-1331.
Kara, I. (2010). On the Miller-Tucker-Zemlin Based Formulations for the Distance-Constrained Capacitated Vehicle Routing Problem. AIP Conference Proceedings, 1309, 551-561.
Kara, I. (2011). Arc Based Integer Programming Formulations For Distance-Constrained Capacitated Vehicle Routing Problem. LINDI. 3rd IEEE International Symposium on IEEE.
Kara, I. and Bektas, T. (2003). Integer Linear Problem Formulation Of The Generalized Vehicle Routing Problem. In Proc. 5-th EURO/inf. JIM,2003.
Kara, 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.
Koskosidis, 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.
Kucukoglu, 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.
Kumar, S. and Pannerselvam, R. (2012). A survey on the Vehicle Routing Problem and its variants. Intelligent Information Management, 4, 66-74.
Kuo, Y. (2011). Using simulated annealing to minimize fuel consumption for the time dependent vehicle routing problem. Computers & Industrial Enginnering, 131, 44-51.
Kwon, Y., Choi, Y. and Lee, D. (2013). Heterogeneous fixed fleet vehicle routing considering carbon emission. Transportation Research Part D, 23, 81-89.
LabbÈ, M., Laporte, G. and Mercure, H. (1991). Capacitated Vehicle Routing Problems on trees. OR, 39, 616-622.
Lacomme, 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.
Laporte, G. (1992). The VRP: An Overview Of Exact And Approximate algorithms. EJOR, 59, 345-358.
Laporte, 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.
Laporte, G. and Nobert, Y. (1987). Exact algorithms for the Vehicle Routing Problem. Discrete Mathematics, 31, 147-184.
Lau, 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-569
Leal, 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.
Levin, A. (1971). Scheduling And Fleet Routing Models For Transportation Systems. Transportation Sciencie, 5(3), 232-256.
Li, 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.
Li, 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.
Liebman, J. and Marks, D. (1970). Mathematical analysis of solid waste collections. Public Health Service. Publ No 2065. Ms Depot of Health. Education and Welfare.
Lima, C., Goldbarg, M. and Goldbarg, E. (2004). A Memetic Algorithm for the HFVRP. Electronic Notes in Discrete Math, 18, 171-176.
Liong, Ch-.Y., Wan Rosmanira, I., Khairuddin, O. and Zirour, M. (2008). Vehicle Routing Problem: Models And Solutions. JQMA, 4 (1), 205-218.
Malandraki, C. and Daskin, M. (1992). Time Dependent Vehicle Routin Problem: Formulations, Solution Algorithms And Computational Experiments. Transportation Sciencie, 26(3), 185-200.
Marinakis, 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.
Marks, H. and Stricker, R. (1971). Routing For Public Service Vehicles. ASCE Journal of the Urban Planning and Development Division, 97(UP2), 165-178.
Martinelli, R., Pecin, D., Poggi, M. and Longo, H. (2010). Column generation bounds for Capacitated arc routing problem. In Proceedings of the XLII SOBRAPO.
Martinelli, 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.
Mbaraga, P., Langevin, A. and Laporte, G. (1999). Two exact algorithms for the vehicle routing problem on trees. Naval Research Logistics, 46, 75-89.
McKinnon, 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.
Minocha, 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.
Mole, R. and S. Jameson, S. (1976). A sequential route-building algorithm employingageneralized saving criterion. Operation Research Quarterly, 11, 503-511.
Nagy, 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.
Naud, M. and Potvin, J. (2009). Tabu Search with ejections chains for Vehicle Routing Problem with Private Fleet and Common Carrier. CIRRELT-2009-50.
Olivera, A. and Viera, O. (2007). Adaptive memory programming for the Vehicle routing problem with multiple trips. COR, 34(1), 28-47.
Ombuki-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.
Özyurt, Z., Aksen, D. and Aras, N. (2006). OVRP with time deadlines: solution methods and applications. OR Proceedings 2005. Springer Berlin Heidelberg, 73-78.
Palmer, A. (2008). The Development of an Integrated Routing and Carbon Dioxide Emissions Model for Goods Vehicles. PhD Thesis. Cranfield University.
Paraskevopoulos, 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.
Perboli, 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.
Pessoa, 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.
Piecyk, M. (2010). Analysis Of Long-Term Freight Transport, Logistics And Related CO2 Trendson A Business-As-Usual Basis. Doctor of Philosophy, Heriot-Watt University.
Pop, 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.
Pradenas, 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.
Prins, 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.
Qiu, 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.
Quariguasi, 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.
Reisman, A. (1992). Management Science Knowledge: Its Creation, Generalization, and Consolidation. Greenwood P.
Renaud, J., Laporte, G. and Boctor, F. (1996). A Tabu Search heuristic for the Multi Depot Vehicle Routing Problem. COR, 23, 229-235.
Romilly, 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.
Salhi, S. and Sari, M. (1997). A multi-level composite heuristic for the multidepot vehicle fleet mix problem. EJOR, 103, 95-112.
Sariklis, D. and Powell, S. (2000). A Heuristic Method The Open Vehicle Routing Problem. JORS, 51, 564-573.
Sarkis, 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.
Sbihi, 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.
Shen, 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.
Solomon, M. (1987). Algorithms For Vehicle Scheduling Routing Problem With Time Windows. Operations Research, 35(2), 354-265.
Srivastava, S. (2007). Green Supply-Chain Managment. A State Of The Art Literature Review. International Journal of Managment Reviews, 9(1), 53-80.
Subramanian, A. (2012). Heuristic, exact and hybrid approaches for VRP. PhD Thesis. Universidade Federal Fluminense. Niteroi.
Subramanian, 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.
Suzuki, 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.
Thangiah, 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-515
Thompson, P. M. and Psaraftis, H. N. (1993). Cyclic transfer algorithms for multivehicle routing and scheduling problems. Oper. Res., 41, 935-946.
Toth, P. and Vigo, D. (2002). Models, Relaxations And Exact Approaches For The Capacitated Arc Routing Problem. Discrete Applied Mathematics, 123(1-3), 487-512.
Ubeda, S., Arcelus, F. and Faulin, J. (2011). Green Logistics at eroski. A acse study. International Journal on Production Economics, 131, 44-51.
Vachon, 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.
Vidal, 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.
Vidal, 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.
Vigo, D. (1996). Heuristic Algorithm For The Arc Capacitated Vehicle Routing Problem. EJOR, 89, 108-126.
Villegas, 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.
Wade, 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.
Wilck 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.
Wilson, 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.
Wu, T.H., Low, Ch. and Bai, J.-W. (2002). Heuristic solutions to multi depot location vehicle routing problems. Computers & Operations Research, 29, 1393,1415.
Xiao, 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.
Yeun, 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.
Descargas
Los datos de descargas todavía no están disponibles.
