Descripción de la clasificación de publicaciones y los modelos utilizados en la solución del problema de enrutamiento vehicular con entregas y recogidas
- Articles
- Enviado: agosto 11, 2015
-
Publicado: octubre 14, 2016
Resumen
Esta revisión presenta la descripción del estado de arte del problema de enrutamiento vehicular con entregas y recogidas (VRPPD), producto obtenido de la revisión de literatura de la mayoría de modelos reportados en la literatura técnica internacional y utilizados por muchos años por investigadores especializados en el campo. Esta clasificación considera los diferentes métodos de solución, el tratamiento del problema en el tiempo y las futuras tendencias del mismo en cuanto a su formulación y propuesta de nuevos métodos de solución como la metaheurística causada por la complejidad del problema. Finalmente, se dejan para discusión diferentes elementos sobre herramientas existentes y disponibles para la solución de este problema.
Referencias
[1] P. Toth, D. Vigo, “The Vehicle Routing Problem”. Society of Industrial and Applied Mathematics (SIAM) monographs on discrete mathematics and applications. Philadelphia, USA, pp. 1-23, 109-149, 2002.
[2] J. K. Lenstra, A. H. G. Rinnooy Kant. “Complexity of vehicle routing and scheduling problems”. Networks. 11 (2), pp. 221-227, 1981.
[3] A. Subramanian. “Heuristics exact and hybrid approaches for vehicle routing problems”. Universidad Federal Fluminense. Tesis Doctoral. Niteroi, pp. 13, 17, 19, 2012.
[4] G. Berbeglia, J. F. Cordeau, G. Laporte. “Dynamic pick up and delivery problems”. European Journal of Operational Research- ELSEVIER, pp. 8-15, 2009.
[5] K. Ganesh, T. T. Narendram. “Cloves: A cluster and search heuristic to solve the vehicle routing problem with delivery and pick-up”. European Journal of Operational Research- ELSEVIER, pp. 699-717, 2009.
[6] G. Gutiérrez, G. Desaulniers, G. Laporte, V. Marianov. “A branch and price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows”. European Journal of Operational Research-ELSEVIER, pp. 341-349, 2010.
[7] Z. Liu, N. Li, X. Mi, B. Zhang, H. Ma. “Improvement Research on Vehicle Routing Problem with Simultaneous Delivery and Pickup with time windows for Barreled Water”. IEEE, pp. 1347-1350, 2010.
[8] L. Chun-Hua, Z. Hong, Z. Jian. “Vehicle Routing Problem with Time Windows and Pickups and Deliveries”. IEEE, pp. 685-689, 2009.
[9] K. Wang, C. Ye, A. Ning. “Competitive Decision Algorithm for the Split Vehicle Routing Problem with Simultaneous Pickup and Delivery and Time Windows”. International Conference on Future Technology and Management Engineering. IEEE, pp. 371-375, 2010.
[10] Q. Chen, K. Li, Z. Liu. “Model and algorithm for an unpaired pickup and delivery vehicle routing problem with split loads”. Transportation Research Part E: Logistics and Transportation Review, Volume 69, pp. 218-235, 2014.
[11] M. Avci, S. Topaloglu. “An Adaptive Local Search Algorithm for Vehicle Routing Problem with Simultaneous and Mixed Pickups and Deliveries”. Computers & Industrial Engineering, Volume 83, pp. 15-29, 2015.
[12] E. Zachariadis, C. Tarantilis, C. Kiranoudis. “ The Vehicle Routing Problem with Simultaneous Pick-ups and Deliveries and Two-Dimensional Loading Constraints”, European Journal of Operational Research - ELSEVIER, Volume 251, Issue 2, 1, pp. 369-386, 2016.
[13] H. Min. “The multiple vehicle routing problem with simultaneous delivery and pick up points”. Transportation Research.Vol. 23. No. 5, pp. 377-386, 1989.
[14] K.K. Ruland, E. Y. Rodin. “The pickup and delivery problem: Faces and branch and cut algorithm”. European Journal of Operational Reserarch – ELSEVIER. Vol. 33. No. 12, pp. 1-13, 1997.
[15] H. Hernandez Perez, J. J. “A branch and cut algorithm for a traveling salesman problem with pickup and delivery”. European Journal of Operational Research-ELSEVIER, pp. 126-139, 2004.
[16] A. Subramanian, E. Uchoa, A. Alves Pessoa, L. Satoru Ochi. “Branch and cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery”. European Journal of Operational Research-ELSEVIER, pp. 338-341, 2011.
[17] I. Karaoglan, F. Altiparmak, I. Kara, B. Dengiz. “A branch and cut algorithm for the location routing problem with simultaneous pickup and delivery”. European Journal of Operational Research-ELSEVIER, pp. 318-332, 2011.
[18] R. Masson, S. Ropke, F. Lehuédé, O. Péton. “A branch and cut and price approach for the pickup and delivery problem with shuttle routes”. European Journal of Operational Research-ELSEVIER, articulo en proceso, 2013.
[19] G. Gutiérrez Jarpa, G. Desaulniers, G. Laporte, V. Mariano. “A branch and price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows”. European Journal of Operational Research-ELSEVIER, pp. 341-349, 2010.
[20] M. Cherkesly, G. Desaulniers, G. Laporte. “A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading”. Computers & Operations Research, Volume 62, pp. 23-35, 2015.
[21] P. Venkateshan, K. Mathur. “An efficient column generation based algorithm for solving a pickup and delivery problem”. European Journal of Operational Research-ELSEVIER, pp.1647-1655, 2011.
[22] M. R. Swihart, J. D. Papastavrou. “A stochastic and dynamic model for the single vehicle pickup and delivery problem”. European Journal of Operational Research-ELSEVIER, 1999. pp. 447-464, 1999.
[23] C. Y. Lee, X. Qi.” Vehicle scheduling with combinable delivery and pickup operations”. European Journal of Operational Research-ELSEVIER, pp. 399-404, 2009.
[24] I. Minis, A. Tatarakis. “Stochastic single vehicle routing problem with delivery and pickup and a predefined customer sequence”. European Journal of Operational Research-ELSEVIER, pp. 37-51, 2011.
[25] H. N. Psaraftis. “A multi-commodity, capacitated pickup and delivery problem: The single and two vehicle cases”. European Journal of Operational Research-ELSEVIER, pp. 572-580, 2011.
[26] M. Mahmoudi, X. Zhou. “Finding optimal solutions for Vehicle Routing Problem with Pickup and Delivery Services with Time Windows: A dynamic programming approach based on state–space–time network representations”. Transportation Research Part B: Methodological, Volume 89, pp. 19-42, 2016.
[27] T. E. Tzore, D. Granot, F. Granot, G. Sosic. “The vehicle routing problem with pickups and deliveries on some special graphs”. European Journal of Operational Research-ELSEVIER, pp. 193-229, 2002.
[28] N. Tajik, R. Tavakkoli-Moghaddam, B. Vahdani, S. Meysam Mousavi. “A robust optimization approach for pollution routing problem with pickup and delivery under uncertainty”. Journal of Manufacturing Systems, Volume 33, Issue 2, pp. 277-286, 2014.
[29] J. Rieck, C. Ehrenberg, J. Zimmermann. “Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery”. European Journal of Operational Research – ELSEVIER. Volume 236, Issue 3, pp. 863-878, 2014.
[30] T.D. Dimitrakos, E.G. Kyriakidis. “A single vehicle routing problem with pickups and deliveries, continuous random demands and predefined customer order”. European Journal of Operational Research – ELSEVIER. Volume 244, Issue 3, 1, pp. 990-993, 2015.
[31] S. Madankumar, C. Rajendran. “Mathematical models for green vehicle routing problems with pickup and delivery: A case of semiconductor supply chain”. Computers & Operations Research, available online 4 April 2016. Paper in Press.
[32] M. Nowak, O. Ergun, C. White III Chelsea. “An empirical study on the benefit of split loads with the pickup and delivery problem”. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 734-740, 2009.
[33] Y. Dumas, J. Desrosiers, F. Soumis. “The pickup and delivery problem with time windows”. European Journal of Operational Research-ELSEVIER. Vol. 54, pp. 7-22, 1991.
[34] E. Domenjoud, C. Kirchner, J. Zhou. “Generating Feasible Schedules for a Pickup and Delivery Problem”. European Journal of Operational Research-ELSEVIER, pp.1-12, 2009.
[35] Y. Gajpal, A. Prakash. “An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup”. European Journal of Operational Research-ELSEVIER, pp. 321-322, 2009.
[36] J. F. Bard, A. I. Jarrah. “Integrating commercial and residential pickup and delivery networks: A case study”. European Journal of Operational Research-ELSEVIER, pp. 706-720, 2013.
[37] C. Fiegl, C. Pontow. “Online scheduling of pickup and delivery tasks in hospitals” European Journal of Operational Research-ELSEVIER, pp. 624-632, 2009.
[38] L.B. Rocha, E.C Gonzalez, C. J. A Orjuela. “Una revisión al estado del arte del problema de ruteo de vehículos: Evolución histórica y métodos de solución”. Ingeniería Universidad Distrital. Vol. 16. No.2, pp. 45, 2011.
[39] G. Mosheiov. “The Travelling Salesman Problem with pickup and delivery”. European Journal of Operational Research-ELSEVIER. Vol. 79. Issue 2, pp. 299-310, 1994.
[40] J. S. Shang, C. K. Cuff. “Multicriteria pickup and delivery problem with transfer opportunity”. European Journal of Operational Research-ELSEVIER. Vol. 30. No. 4, pp. 631-645, 1996.
[41] R. Hall. “Pickup and delivery systems for overnight carriers”. European Journal of Operational Research-ELSEVIER. Vol. 30. No. 3, pp. 173-187, 1996.
[42] G. Mosheiov. “Vehicle routing with pickup and delivery: Tour partitioning heuristics”. European Journal of Operational Research-ELSEVIER. Vol. 34. No. 3, pp. 669-684, 1998.
[43] G. Nagy, S. Salhi. “ Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries”. European Journal of Operational Research-ELSEVIER,
pp. 126-141, 2005.
[44] C.G Lee, M.A. Epelman, C.C. White III, Y. A. Bozer. “A shortest path approach to the multiple-vehicle routing problem with split pickups”. European Journal of Operational Research-ELSEVIER, Part B 40. pp. 265-284, 2006.
[45] N. Katoh, T. Yano. “An approximation algorithm for the pickup and delivery vehicle routing problem on trees”. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 265–284, 2006.
[46] A. Fabri, P. Recht. “On dynamic pickup and delivery vehicle routing with several time windows and waiting times”. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 335–350, 2006.
[47] C. K. Y. Lin. “A vehicle routing problem with pickup and delivery time windows, and coordination of transportable resources”. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 1596-1609, 2011.
[48]. Gendreau, F. Guertin, J. Potvin, R. Seguin. “Neighborhood search heuristics for a dynamic vehicle dispatching problem with pickups and deliveries”. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 157-174, 2006.
[49] N. Mladenović, D. Urosevic, S. Hanafi, A. Ilić.”A general variable neighborhood search for the one-commodity pickup and delivery travelling salesman problem”. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 270-285, 2012.
[50] D. Sáeza, C. Cortés, E. Núñez. “A. Hybrid adaptive predictive control for the multi-vehicle dynamic pickup and delivery problem based on genetic algorithms and fuzzy clustering”. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 3412-3438, 2008.
[51] I. Gribkovskaia, O. Halskau, G. Laporte, M. Vicek. “General solutions to the single vehicle routing problem with pickups and deliveries.” European Journal of Operational Research-ELSEVIER, Part B 40, pp. 568-584, 2007.
[52] I. Gribkovskaiaa, G. Laporte, A. Shyshou. “The single vehicle routing problem with deliveries and selective pickups”. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 2908-2924, 2008.
[53] T. Sheng Chang, Y. F. Liao. “Path finding with stowage planning consideration in a mixed pickup delivery and specified-node network”. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 970-985, 2008.
[54] G. Erdogan, J. F. Cordeau, G. Laporte. “The pickup and delivery traveling salesman problem with first in first out loading”. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 1800-1808, 2009.
[55] J. F. Bard, A. I. Jarrah. “Large scale constrained clustering for rationalizing pickupand delivery operations”. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 542-561, 2009.
[56] A. Subramanian, L. M. A Drummond, C. Bentes, L. S. Och, R. Farias. “A parallel heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery”. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 1899-1911, 2010.
[57] Y. Li, A. Lim, W. Chong Oon, H. Qin., D. Tu. “The tree representation for the pickup and delivery traveling salesman problem with LIFO loading”. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 482-496, 2011.
[58] I. Karaoglan, F. Altiparmak, I. Kara, B. Dengiz. “ The location routing problem with simultaneous pickup and delivery: Formulations and a heuristic approach”. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 465-477, 2012.
[59] P. Y. Yang, J. F Tang, Y. Yu, J. X. Pei. “Minimizing Carbon Emissions through Vehicle Routing and Scheduling in the Shuttle Service of Picking up and Delivering Customers to the Airport”. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 424-432, 2013.
[60] P. K. Sheridan, E. Gluck, Q. Guan, T. Pickles, B. Balcıoglu, B. Benhabib. “ The dynamic nearest neighbor policy for the multivehicle pickup and delivery problem”. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 178-194, 2013.
[61] P. Belfiorea, H. Yoshizaki. “Heuristic methods for the fleet size and mix vehicle routing problem with time windows and split deliveries”. European Journal of Operational Research-ELSEVIER. 2013. Part B 40, pp. 589-601, 2013.
[62] R. Dondo, J. Cerdá. “A sweep heuristic based formulation for the vehicle routing problem with cross-docking”. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 293-311, 2013.
[63] G. Tang, A. Ning, K. Wang, X. Qi. “A Practical Split Vehicle Routing Problem with Simultaneous Pickup and Delivery”. The Institute of Electrical and Electronics Engineers. IEEE, pp. 26-30, 2009.
[64] K. Wangl, C. Vel., A. Ning. “Competitive Decision Algorithm for the Split Vehicle Routing Problem with Simultaneous Pickup and Delivery and Time Windows”. The Institute of Electrical and Electronics Engineers. IEEE, pp. 371-375, 2010.
[65] T. Zhang, Y. J. Zhang, W. Lai, J. Y. Hu. “Research on Time Dependent Vehicle Routing Problem with Simultaneous Delivery and Pickup”. The Institute of Electrical and Electronics Engineers. IEEE, pp. 66-70, 2009.
[66] C. Shi Liu, Q. J. Tang. “A Hybrid Heuristics for Vehicle Routing Problem with Simultaneous Pickup and Delivery Service”. The Institute of Electrical and Electronics Engineers. IEEE, pp. 1422-1426, 2010.
[67] K. Ganesh, T. T. Narendran. “CLOVES: A cluster and search heuristic to solve the vehicle routing problem with delivery and pickup”. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 699-717, 2007.
[68] W. Nanry, J. W. Barnes.” Solving the pickup and delivery problem with time windows using reactive tabu search”. European Journal of Operational Research-ELSEVIER, Part B 34, pp. 107-121, 2000.
[69] F. Ferrucci, S. Bock. “Real-time control of express pickup and delivery processes in a dynamic environment”. Transportation Research Part B: Methodological, Volume 63, pp. 1-14, 2014.
[70] M. Jin, K. Liu, R.O. Bowden. “A two stage algorithm with valid inequalities for the split delivery vehicle routing problem”. European Journal of Operational Research-ELSEVIER, pp. 228-242, 2007.
[71] A. Hoff, I. Gribkovskaia, G. Laporte, A. Lokketangen. “Lasso solution strategies for the vehicle routing problem with pickups and deliveries”. European Journal of Operational Research-ELSEVIER, pp. 755-766, 2009.
[72] J. Fan. “The Vehicle Routing Problem with Simultaneous Pickup and Delivery Based on Customer Satisfaction”. European Journal of Operational Research-ELSEVIER, pp. 5284- 5289, 2011.
[73] N. Bianchessi, G. Righini. “Heuristic algorithms for the vehicle routing problem with simultaneous pick up and delivery”. European Journal of Operational Research-ELSEVIER, pp. 578-594, 2007.
[74] G. Erdogan, M. Battarra, G. Laporte, D. Vigo. “Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs”. European Journal of Operational Research-ELSEVIER, pp. 1074-1086, 2012.
[75] D. Ai-min, M. Chao, Z. Yan-ting. “Optimizing Research of an Improved Simulated Annealing Algorithm to Soft Time Windows Vehicle Routing Problem with Pickup and Delivery”. Systems Engineering Theory & Practice, pp. 186-194, 2009.
[76] E. Zachariadis, C. Tarantilis, C. Kiranoudis. “A hybrid metaheuristic algorithm for the vehicle routing problem with simultaneous delivery and pick-up service”. European Journal of Operational Research-ELSEVIER, pp. 1074-1086, 2012.
[77] L. Meng, X. Guo. “A new hybrid metaheuristics for the vehicle routing problem with simultaneous pick-up and delivery”. Institute of Electrical and Electronics Enginners-IEEE, pp. 1198-1202, 2008.
[78] M. Karlafti, K. Kepaptsoglou, E. Sambracos. “Containership routing with time deadlines and simultaneous deliveries and pickups”. European Journal of Operational Research– ELSEVIER. Part E: Logistics and Transportation, pp. 210-221, 2009.
[79] Y. Gajpal, P. Abad. “An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup”. European Journal of Operational Research-ELSEVIER. Computers & Operations Research, pp. 3215-3223, 2009.
[80] E. Zachariadis, C. Tarantilis, C. Kiranoudis. “An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries”. European Journal of Operational Research-ELSEVIER, pp. 401- 411, 2010.
[81] B. Çatay. “A new saving based ant algorithm for the Vehicle Routing Problem with Simultaneous Pickup and Delivery”. European Journal of Operational Research-ELSEVIER. Experts Systems with Aplications, pp. 6809- 6817, 2010.
[82] L. Boubahri, A. Addouche, E. Mhamedi. “Multi-Ant Colonies algorithms for the VRPSPDTW”. Institute of Electrical and Electronics Enginners-IEEE, pp. 1-6, 2011.
[83] L. Mingyong, C. Erbao. “An improved differential evolution algorithm for vehicle routing problem with simultaneous pickups and deliveries and time windows”. European Journal of Operational Research-ELSEVIER. Engineering Applications of Artificial Intelligence, pp. 188-195, 2010.
[84] E. Zachariadis, C. Kiranoudis. “A local search metaheuristic algorithm for the vehicle routing problem with simultaneous pickups and deliveries”. Experts Systems with Applications: An International Journal. Vol. 38. N° 3, pp. 2717-2726, 2011.
[85] L. Chun-Hua, Z. Hong, Z. Jian. “Vehicle Routing Problem with Time Window and Simultaneous Pickups and Deliveries”. Industrial Engineering and Engineering Management. IE&EM ‘09. 16th International Conference on 2009. pp. 685-689.
[86] L. Hou, H. Zhou. “Stochastic Vehicle Routing Problem with Uncertain Demand and Travel Time and Simultaneous Pickups and Deliveries”. Industrial Engineering and Engineering Management. IEEE, pp. 32-35, 2010.
[87] Z. Liu, N. Li, X Mi, B. Zhang, H. Ma. “Improvement Research on Vehicle Routing Problem with Simultaneous Delivery and Pickup with time windows for Barreled Water”. Industrial Engineering and Engineering Management. IEEE, pp. 1347-1350, 2010.
[88] A. Serdar Tasana, M. Gen. “A genetic algorithm based approach to vehicle routing problem with simultaneous pickup and deliveries”. European Journal of Operational Research- ELSEVIER. Computers & Industrial Engineering, pp. 755-761, 2012.
[89] T. Zhanga, W. A. Chaovalitwongse, Y. Zhang. “Scatter search for the stochastic travel time vehicle routing problem with simultaneous pick-ups and deliveries”. European Journal of Operational Research-ELSEVIER. Computers & Operations Research, pp. 2277-2290, 2012.
[90] H. Wang, Y. Chen. “A genetic algorithm for the simultaneous delivery and pickup problems with time windows”. European Journal of Operational Research-ELSEVIER. Computers & Industrial Engineering, pp. 84-85, 2012.
[91] H. Wang, Y. Chen. “A coevolutionary algorithm for the flexible delivery and pickup problem with time windows”. European Journal of Operational Research-ELSEVIER. International Journal of Production Economics, pp. 4-13, 2013.
[92] Y. Chen. “Fuzzy Flexible Delivery and Pickup Problem with Time Windows”. European Journal of Operational Research-ELSEVIER. Procedia Computer Science, pp. 379-386, 2013.
[93] M. Şahin, G. Çavuşlar, T. Öncan, G. Şahin, T. Aksu. “An efficient heuristic for the Multivehicle One to one Pickup and Delivery Problem with Split Loads”. European Journal of Operational Research-ELSEVIER. Transportation Research Part C. Emerging Technologies, pp. 169-188, 2013.
[94] C. Ting, X. Liao. “The selective pickup and delivery problem: Formulation and a memetic algorithm”. European Journal of Operational Research-ELSEVIER. International Journal of Production Economics, pp. 199-211, 2013.
[95] F. Goksal, F. Altiparmak, I. Karaoglan. “A Hybrid Particle Swarm Optimization for Vehicle Routing Problem with Simultaneous Pickup and Delivery”. Industrial Engineering and Enginnersing Management. IEEE, pp. 1-6, 2010.
[96] I. Karaoglan, F. Altiparmak. “A Hybrid Genetic Algorithm for the Location Routing Problem with Simultaneous Pickup and Delivery”. Institute of Electrical and Electronics Enginners Management-IEEE.Computers and Industrial Engineering, p.p 1-6, 2010.
[97] F. Zhao, D. Mei, J. Sun, W. Liu. “A hybrid genetic algorithm for the vehicle routing problem with simultaneous pickup and delivery”. Institute of Electrical and Electronics Enginners-IEEE. Control and Decision Conference, p.p 3928-3933, 2009.
[98] N. Zhang, G. Sun, Y. Wu, F. Geng. “A modified particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery”. Institute of Electrical and Electronics Enginners-IEEE. Asian Control Conference, pp. 1679-1684, 2009.
[99] H. Feng-jun, W. Bin. “Quantum Evolutionary Algorithm for Vehicle Routing Problem with Simultaneous Delivery and Pickup”. Institute of Electrical and Electronics Enginners- IEEE. Decision and Control, 28th Chinese Control conference, pp. 5097-5101, 2009.
[100] T. Jin Ai, V. Kachitvichyanukul. “A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery”. European Journal of Operational Research-ELSEVIER, Computers & Operations Research, pp. 1693-1702, 2009.
[101] M. Avci, S. Topaloglu. “A hybrid metaheuristic algorithm for heterogeneous vehicle routing problem with simultaneous pickup and delivery”. Expert Systems with Applications, Volume 53, pp. 160-171, 2016.
[102] S. Mitrović Minić, G. Laporte. “Waiting strategies for the dynamic pickup and delivery problem with time windows”. European Journal of Operational Research-ELSEVIER. Transportation Research Part B. Methodological, pp. 635-655, 2004.
[103] C.K.Y. Lin. “A cooperative strategy for a vehicle routing problem with pickup and delivery time windows”. European Journal of Operational Research-ELSEVIER. Computers & Industrial Engineering, pp. 766-782, 2008.
[104] G. Berbeglia, G. Hahn. “Counting feasible solutions of the traveling salesman problem with pickups and deliveries is NP-complete”. European Journal of Operational Research-ELSEVIER. Discrete Applied Mathematics, pp. 2541-2547, 2009.
[105] D. Männel, A. Bortfeldt. “A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints”. European Journal of Operational Research – ELSEVIER, Volume 254, Issue 3, 1, pp. 840-858, 2016.
[106] R. C. Cruz, T. C. B. Silva, M J. F. Souza, V. N. Coelho, M. T. Mine, A. X. Martins. “GENVNSTS-CL-PR: A heuristic approach for solving the vehicle routing problem with simultaneous”. European Journal of Operational Research- ELSEVIER. Electronics Notes in Discrete Mathematics, pp. 217-224, 2012.
[107] S. N. D’Souza Omkar, J. Senthilnath. “Pickup and delivery problem using metaheuristics techniques”. European Journal of Operational Research-ELSEVIER. Experts Systems with Applications, pp. 328-334, 2012.
[108] R. Liu, X. Xie, V. Augusto, C. Rodríguez. “Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care”. European Journal of Operational Research-ELSEVIER, p.p 475-486, 2013.
[109] Y. Qu, J. F. Bard. “The heterogeneous pickup and delivery problem with configurable vehicle capacity”. European Journal of Operational Research-ELSEVIER. Transportation Research Part C. Emerging Technologies, pp. 1-20, 2013.
[110] P. Chen, H. Huang, X. Dong. “An Ant Colony System Based Heuristic Algorithm for the Vehicle Routing Problem with Simultaneous Delivery and Pickup”. Institute of Electrical and Electronics Enginners-IEEE. Industrial Electronics and Applications, pp. 136-141, 2007.
[111] T. Zhang, Y. J. Zhang,, Q. I. Chen, Y. Sun. “The Mixed Algorithm for vehicle routing problem with simultaneous pickup and delivery”. Institute of Electrical and Electronics Enginners-IEEE, Machine Learning and Cybernetics, pp. 1871-1876, 2009.
[112] A. Subramanian. “Metaheristica Iterated Local Search aplicada ao problema de Rotetamento de veículos com coleta e entrega Simultanâa. Master´s Thesis, Programa de Pósgraduçâo em Engenharia de Produçâo. Universidade Federal da Paraiba, João Pessoa, PB. Brazil, (in Portuguese), 2008.
[2] J. K. Lenstra, A. H. G. Rinnooy Kant. “Complexity of vehicle routing and scheduling problems”. Networks. 11 (2), pp. 221-227, 1981.
[3] A. Subramanian. “Heuristics exact and hybrid approaches for vehicle routing problems”. Universidad Federal Fluminense. Tesis Doctoral. Niteroi, pp. 13, 17, 19, 2012.
[4] G. Berbeglia, J. F. Cordeau, G. Laporte. “Dynamic pick up and delivery problems”. European Journal of Operational Research- ELSEVIER, pp. 8-15, 2009.
[5] K. Ganesh, T. T. Narendram. “Cloves: A cluster and search heuristic to solve the vehicle routing problem with delivery and pick-up”. European Journal of Operational Research- ELSEVIER, pp. 699-717, 2009.
[6] G. Gutiérrez, G. Desaulniers, G. Laporte, V. Marianov. “A branch and price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows”. European Journal of Operational Research-ELSEVIER, pp. 341-349, 2010.
[7] Z. Liu, N. Li, X. Mi, B. Zhang, H. Ma. “Improvement Research on Vehicle Routing Problem with Simultaneous Delivery and Pickup with time windows for Barreled Water”. IEEE, pp. 1347-1350, 2010.
[8] L. Chun-Hua, Z. Hong, Z. Jian. “Vehicle Routing Problem with Time Windows and Pickups and Deliveries”. IEEE, pp. 685-689, 2009.
[9] K. Wang, C. Ye, A. Ning. “Competitive Decision Algorithm for the Split Vehicle Routing Problem with Simultaneous Pickup and Delivery and Time Windows”. International Conference on Future Technology and Management Engineering. IEEE, pp. 371-375, 2010.
[10] Q. Chen, K. Li, Z. Liu. “Model and algorithm for an unpaired pickup and delivery vehicle routing problem with split loads”. Transportation Research Part E: Logistics and Transportation Review, Volume 69, pp. 218-235, 2014.
[11] M. Avci, S. Topaloglu. “An Adaptive Local Search Algorithm for Vehicle Routing Problem with Simultaneous and Mixed Pickups and Deliveries”. Computers & Industrial Engineering, Volume 83, pp. 15-29, 2015.
[12] E. Zachariadis, C. Tarantilis, C. Kiranoudis. “ The Vehicle Routing Problem with Simultaneous Pick-ups and Deliveries and Two-Dimensional Loading Constraints”, European Journal of Operational Research - ELSEVIER, Volume 251, Issue 2, 1, pp. 369-386, 2016.
[13] H. Min. “The multiple vehicle routing problem with simultaneous delivery and pick up points”. Transportation Research.Vol. 23. No. 5, pp. 377-386, 1989.
[14] K.K. Ruland, E. Y. Rodin. “The pickup and delivery problem: Faces and branch and cut algorithm”. European Journal of Operational Reserarch – ELSEVIER. Vol. 33. No. 12, pp. 1-13, 1997.
[15] H. Hernandez Perez, J. J. “A branch and cut algorithm for a traveling salesman problem with pickup and delivery”. European Journal of Operational Research-ELSEVIER, pp. 126-139, 2004.
[16] A. Subramanian, E. Uchoa, A. Alves Pessoa, L. Satoru Ochi. “Branch and cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery”. European Journal of Operational Research-ELSEVIER, pp. 338-341, 2011.
[17] I. Karaoglan, F. Altiparmak, I. Kara, B. Dengiz. “A branch and cut algorithm for the location routing problem with simultaneous pickup and delivery”. European Journal of Operational Research-ELSEVIER, pp. 318-332, 2011.
[18] R. Masson, S. Ropke, F. Lehuédé, O. Péton. “A branch and cut and price approach for the pickup and delivery problem with shuttle routes”. European Journal of Operational Research-ELSEVIER, articulo en proceso, 2013.
[19] G. Gutiérrez Jarpa, G. Desaulniers, G. Laporte, V. Mariano. “A branch and price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows”. European Journal of Operational Research-ELSEVIER, pp. 341-349, 2010.
[20] M. Cherkesly, G. Desaulniers, G. Laporte. “A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading”. Computers & Operations Research, Volume 62, pp. 23-35, 2015.
[21] P. Venkateshan, K. Mathur. “An efficient column generation based algorithm for solving a pickup and delivery problem”. European Journal of Operational Research-ELSEVIER, pp.1647-1655, 2011.
[22] M. R. Swihart, J. D. Papastavrou. “A stochastic and dynamic model for the single vehicle pickup and delivery problem”. European Journal of Operational Research-ELSEVIER, 1999. pp. 447-464, 1999.
[23] C. Y. Lee, X. Qi.” Vehicle scheduling with combinable delivery and pickup operations”. European Journal of Operational Research-ELSEVIER, pp. 399-404, 2009.
[24] I. Minis, A. Tatarakis. “Stochastic single vehicle routing problem with delivery and pickup and a predefined customer sequence”. European Journal of Operational Research-ELSEVIER, pp. 37-51, 2011.
[25] H. N. Psaraftis. “A multi-commodity, capacitated pickup and delivery problem: The single and two vehicle cases”. European Journal of Operational Research-ELSEVIER, pp. 572-580, 2011.
[26] M. Mahmoudi, X. Zhou. “Finding optimal solutions for Vehicle Routing Problem with Pickup and Delivery Services with Time Windows: A dynamic programming approach based on state–space–time network representations”. Transportation Research Part B: Methodological, Volume 89, pp. 19-42, 2016.
[27] T. E. Tzore, D. Granot, F. Granot, G. Sosic. “The vehicle routing problem with pickups and deliveries on some special graphs”. European Journal of Operational Research-ELSEVIER, pp. 193-229, 2002.
[28] N. Tajik, R. Tavakkoli-Moghaddam, B. Vahdani, S. Meysam Mousavi. “A robust optimization approach for pollution routing problem with pickup and delivery under uncertainty”. Journal of Manufacturing Systems, Volume 33, Issue 2, pp. 277-286, 2014.
[29] J. Rieck, C. Ehrenberg, J. Zimmermann. “Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery”. European Journal of Operational Research – ELSEVIER. Volume 236, Issue 3, pp. 863-878, 2014.
[30] T.D. Dimitrakos, E.G. Kyriakidis. “A single vehicle routing problem with pickups and deliveries, continuous random demands and predefined customer order”. European Journal of Operational Research – ELSEVIER. Volume 244, Issue 3, 1, pp. 990-993, 2015.
[31] S. Madankumar, C. Rajendran. “Mathematical models for green vehicle routing problems with pickup and delivery: A case of semiconductor supply chain”. Computers & Operations Research, available online 4 April 2016. Paper in Press.
[32] M. Nowak, O. Ergun, C. White III Chelsea. “An empirical study on the benefit of split loads with the pickup and delivery problem”. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 734-740, 2009.
[33] Y. Dumas, J. Desrosiers, F. Soumis. “The pickup and delivery problem with time windows”. European Journal of Operational Research-ELSEVIER. Vol. 54, pp. 7-22, 1991.
[34] E. Domenjoud, C. Kirchner, J. Zhou. “Generating Feasible Schedules for a Pickup and Delivery Problem”. European Journal of Operational Research-ELSEVIER, pp.1-12, 2009.
[35] Y. Gajpal, A. Prakash. “An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup”. European Journal of Operational Research-ELSEVIER, pp. 321-322, 2009.
[36] J. F. Bard, A. I. Jarrah. “Integrating commercial and residential pickup and delivery networks: A case study”. European Journal of Operational Research-ELSEVIER, pp. 706-720, 2013.
[37] C. Fiegl, C. Pontow. “Online scheduling of pickup and delivery tasks in hospitals” European Journal of Operational Research-ELSEVIER, pp. 624-632, 2009.
[38] L.B. Rocha, E.C Gonzalez, C. J. A Orjuela. “Una revisión al estado del arte del problema de ruteo de vehículos: Evolución histórica y métodos de solución”. Ingeniería Universidad Distrital. Vol. 16. No.2, pp. 45, 2011.
[39] G. Mosheiov. “The Travelling Salesman Problem with pickup and delivery”. European Journal of Operational Research-ELSEVIER. Vol. 79. Issue 2, pp. 299-310, 1994.
[40] J. S. Shang, C. K. Cuff. “Multicriteria pickup and delivery problem with transfer opportunity”. European Journal of Operational Research-ELSEVIER. Vol. 30. No. 4, pp. 631-645, 1996.
[41] R. Hall. “Pickup and delivery systems for overnight carriers”. European Journal of Operational Research-ELSEVIER. Vol. 30. No. 3, pp. 173-187, 1996.
[42] G. Mosheiov. “Vehicle routing with pickup and delivery: Tour partitioning heuristics”. European Journal of Operational Research-ELSEVIER. Vol. 34. No. 3, pp. 669-684, 1998.
[43] G. Nagy, S. Salhi. “ Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries”. European Journal of Operational Research-ELSEVIER,
pp. 126-141, 2005.
[44] C.G Lee, M.A. Epelman, C.C. White III, Y. A. Bozer. “A shortest path approach to the multiple-vehicle routing problem with split pickups”. European Journal of Operational Research-ELSEVIER, Part B 40. pp. 265-284, 2006.
[45] N. Katoh, T. Yano. “An approximation algorithm for the pickup and delivery vehicle routing problem on trees”. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 265–284, 2006.
[46] A. Fabri, P. Recht. “On dynamic pickup and delivery vehicle routing with several time windows and waiting times”. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 335–350, 2006.
[47] C. K. Y. Lin. “A vehicle routing problem with pickup and delivery time windows, and coordination of transportable resources”. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 1596-1609, 2011.
[48]. Gendreau, F. Guertin, J. Potvin, R. Seguin. “Neighborhood search heuristics for a dynamic vehicle dispatching problem with pickups and deliveries”. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 157-174, 2006.
[49] N. Mladenović, D. Urosevic, S. Hanafi, A. Ilić.”A general variable neighborhood search for the one-commodity pickup and delivery travelling salesman problem”. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 270-285, 2012.
[50] D. Sáeza, C. Cortés, E. Núñez. “A. Hybrid adaptive predictive control for the multi-vehicle dynamic pickup and delivery problem based on genetic algorithms and fuzzy clustering”. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 3412-3438, 2008.
[51] I. Gribkovskaia, O. Halskau, G. Laporte, M. Vicek. “General solutions to the single vehicle routing problem with pickups and deliveries.” European Journal of Operational Research-ELSEVIER, Part B 40, pp. 568-584, 2007.
[52] I. Gribkovskaiaa, G. Laporte, A. Shyshou. “The single vehicle routing problem with deliveries and selective pickups”. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 2908-2924, 2008.
[53] T. Sheng Chang, Y. F. Liao. “Path finding with stowage planning consideration in a mixed pickup delivery and specified-node network”. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 970-985, 2008.
[54] G. Erdogan, J. F. Cordeau, G. Laporte. “The pickup and delivery traveling salesman problem with first in first out loading”. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 1800-1808, 2009.
[55] J. F. Bard, A. I. Jarrah. “Large scale constrained clustering for rationalizing pickupand delivery operations”. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 542-561, 2009.
[56] A. Subramanian, L. M. A Drummond, C. Bentes, L. S. Och, R. Farias. “A parallel heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery”. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 1899-1911, 2010.
[57] Y. Li, A. Lim, W. Chong Oon, H. Qin., D. Tu. “The tree representation for the pickup and delivery traveling salesman problem with LIFO loading”. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 482-496, 2011.
[58] I. Karaoglan, F. Altiparmak, I. Kara, B. Dengiz. “ The location routing problem with simultaneous pickup and delivery: Formulations and a heuristic approach”. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 465-477, 2012.
[59] P. Y. Yang, J. F Tang, Y. Yu, J. X. Pei. “Minimizing Carbon Emissions through Vehicle Routing and Scheduling in the Shuttle Service of Picking up and Delivering Customers to the Airport”. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 424-432, 2013.
[60] P. K. Sheridan, E. Gluck, Q. Guan, T. Pickles, B. Balcıoglu, B. Benhabib. “ The dynamic nearest neighbor policy for the multivehicle pickup and delivery problem”. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 178-194, 2013.
[61] P. Belfiorea, H. Yoshizaki. “Heuristic methods for the fleet size and mix vehicle routing problem with time windows and split deliveries”. European Journal of Operational Research-ELSEVIER. 2013. Part B 40, pp. 589-601, 2013.
[62] R. Dondo, J. Cerdá. “A sweep heuristic based formulation for the vehicle routing problem with cross-docking”. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 293-311, 2013.
[63] G. Tang, A. Ning, K. Wang, X. Qi. “A Practical Split Vehicle Routing Problem with Simultaneous Pickup and Delivery”. The Institute of Electrical and Electronics Engineers. IEEE, pp. 26-30, 2009.
[64] K. Wangl, C. Vel., A. Ning. “Competitive Decision Algorithm for the Split Vehicle Routing Problem with Simultaneous Pickup and Delivery and Time Windows”. The Institute of Electrical and Electronics Engineers. IEEE, pp. 371-375, 2010.
[65] T. Zhang, Y. J. Zhang, W. Lai, J. Y. Hu. “Research on Time Dependent Vehicle Routing Problem with Simultaneous Delivery and Pickup”. The Institute of Electrical and Electronics Engineers. IEEE, pp. 66-70, 2009.
[66] C. Shi Liu, Q. J. Tang. “A Hybrid Heuristics for Vehicle Routing Problem with Simultaneous Pickup and Delivery Service”. The Institute of Electrical and Electronics Engineers. IEEE, pp. 1422-1426, 2010.
[67] K. Ganesh, T. T. Narendran. “CLOVES: A cluster and search heuristic to solve the vehicle routing problem with delivery and pickup”. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 699-717, 2007.
[68] W. Nanry, J. W. Barnes.” Solving the pickup and delivery problem with time windows using reactive tabu search”. European Journal of Operational Research-ELSEVIER, Part B 34, pp. 107-121, 2000.
[69] F. Ferrucci, S. Bock. “Real-time control of express pickup and delivery processes in a dynamic environment”. Transportation Research Part B: Methodological, Volume 63, pp. 1-14, 2014.
[70] M. Jin, K. Liu, R.O. Bowden. “A two stage algorithm with valid inequalities for the split delivery vehicle routing problem”. European Journal of Operational Research-ELSEVIER, pp. 228-242, 2007.
[71] A. Hoff, I. Gribkovskaia, G. Laporte, A. Lokketangen. “Lasso solution strategies for the vehicle routing problem with pickups and deliveries”. European Journal of Operational Research-ELSEVIER, pp. 755-766, 2009.
[72] J. Fan. “The Vehicle Routing Problem with Simultaneous Pickup and Delivery Based on Customer Satisfaction”. European Journal of Operational Research-ELSEVIER, pp. 5284- 5289, 2011.
[73] N. Bianchessi, G. Righini. “Heuristic algorithms for the vehicle routing problem with simultaneous pick up and delivery”. European Journal of Operational Research-ELSEVIER, pp. 578-594, 2007.
[74] G. Erdogan, M. Battarra, G. Laporte, D. Vigo. “Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs”. European Journal of Operational Research-ELSEVIER, pp. 1074-1086, 2012.
[75] D. Ai-min, M. Chao, Z. Yan-ting. “Optimizing Research of an Improved Simulated Annealing Algorithm to Soft Time Windows Vehicle Routing Problem with Pickup and Delivery”. Systems Engineering Theory & Practice, pp. 186-194, 2009.
[76] E. Zachariadis, C. Tarantilis, C. Kiranoudis. “A hybrid metaheuristic algorithm for the vehicle routing problem with simultaneous delivery and pick-up service”. European Journal of Operational Research-ELSEVIER, pp. 1074-1086, 2012.
[77] L. Meng, X. Guo. “A new hybrid metaheuristics for the vehicle routing problem with simultaneous pick-up and delivery”. Institute of Electrical and Electronics Enginners-IEEE, pp. 1198-1202, 2008.
[78] M. Karlafti, K. Kepaptsoglou, E. Sambracos. “Containership routing with time deadlines and simultaneous deliveries and pickups”. European Journal of Operational Research– ELSEVIER. Part E: Logistics and Transportation, pp. 210-221, 2009.
[79] Y. Gajpal, P. Abad. “An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup”. European Journal of Operational Research-ELSEVIER. Computers & Operations Research, pp. 3215-3223, 2009.
[80] E. Zachariadis, C. Tarantilis, C. Kiranoudis. “An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries”. European Journal of Operational Research-ELSEVIER, pp. 401- 411, 2010.
[81] B. Çatay. “A new saving based ant algorithm for the Vehicle Routing Problem with Simultaneous Pickup and Delivery”. European Journal of Operational Research-ELSEVIER. Experts Systems with Aplications, pp. 6809- 6817, 2010.
[82] L. Boubahri, A. Addouche, E. Mhamedi. “Multi-Ant Colonies algorithms for the VRPSPDTW”. Institute of Electrical and Electronics Enginners-IEEE, pp. 1-6, 2011.
[83] L. Mingyong, C. Erbao. “An improved differential evolution algorithm for vehicle routing problem with simultaneous pickups and deliveries and time windows”. European Journal of Operational Research-ELSEVIER. Engineering Applications of Artificial Intelligence, pp. 188-195, 2010.
[84] E. Zachariadis, C. Kiranoudis. “A local search metaheuristic algorithm for the vehicle routing problem with simultaneous pickups and deliveries”. Experts Systems with Applications: An International Journal. Vol. 38. N° 3, pp. 2717-2726, 2011.
[85] L. Chun-Hua, Z. Hong, Z. Jian. “Vehicle Routing Problem with Time Window and Simultaneous Pickups and Deliveries”. Industrial Engineering and Engineering Management. IE&EM ‘09. 16th International Conference on 2009. pp. 685-689.
[86] L. Hou, H. Zhou. “Stochastic Vehicle Routing Problem with Uncertain Demand and Travel Time and Simultaneous Pickups and Deliveries”. Industrial Engineering and Engineering Management. IEEE, pp. 32-35, 2010.
[87] Z. Liu, N. Li, X Mi, B. Zhang, H. Ma. “Improvement Research on Vehicle Routing Problem with Simultaneous Delivery and Pickup with time windows for Barreled Water”. Industrial Engineering and Engineering Management. IEEE, pp. 1347-1350, 2010.
[88] A. Serdar Tasana, M. Gen. “A genetic algorithm based approach to vehicle routing problem with simultaneous pickup and deliveries”. European Journal of Operational Research- ELSEVIER. Computers & Industrial Engineering, pp. 755-761, 2012.
[89] T. Zhanga, W. A. Chaovalitwongse, Y. Zhang. “Scatter search for the stochastic travel time vehicle routing problem with simultaneous pick-ups and deliveries”. European Journal of Operational Research-ELSEVIER. Computers & Operations Research, pp. 2277-2290, 2012.
[90] H. Wang, Y. Chen. “A genetic algorithm for the simultaneous delivery and pickup problems with time windows”. European Journal of Operational Research-ELSEVIER. Computers & Industrial Engineering, pp. 84-85, 2012.
[91] H. Wang, Y. Chen. “A coevolutionary algorithm for the flexible delivery and pickup problem with time windows”. European Journal of Operational Research-ELSEVIER. International Journal of Production Economics, pp. 4-13, 2013.
[92] Y. Chen. “Fuzzy Flexible Delivery and Pickup Problem with Time Windows”. European Journal of Operational Research-ELSEVIER. Procedia Computer Science, pp. 379-386, 2013.
[93] M. Şahin, G. Çavuşlar, T. Öncan, G. Şahin, T. Aksu. “An efficient heuristic for the Multivehicle One to one Pickup and Delivery Problem with Split Loads”. European Journal of Operational Research-ELSEVIER. Transportation Research Part C. Emerging Technologies, pp. 169-188, 2013.
[94] C. Ting, X. Liao. “The selective pickup and delivery problem: Formulation and a memetic algorithm”. European Journal of Operational Research-ELSEVIER. International Journal of Production Economics, pp. 199-211, 2013.
[95] F. Goksal, F. Altiparmak, I. Karaoglan. “A Hybrid Particle Swarm Optimization for Vehicle Routing Problem with Simultaneous Pickup and Delivery”. Industrial Engineering and Enginnersing Management. IEEE, pp. 1-6, 2010.
[96] I. Karaoglan, F. Altiparmak. “A Hybrid Genetic Algorithm for the Location Routing Problem with Simultaneous Pickup and Delivery”. Institute of Electrical and Electronics Enginners Management-IEEE.Computers and Industrial Engineering, p.p 1-6, 2010.
[97] F. Zhao, D. Mei, J. Sun, W. Liu. “A hybrid genetic algorithm for the vehicle routing problem with simultaneous pickup and delivery”. Institute of Electrical and Electronics Enginners-IEEE. Control and Decision Conference, p.p 3928-3933, 2009.
[98] N. Zhang, G. Sun, Y. Wu, F. Geng. “A modified particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery”. Institute of Electrical and Electronics Enginners-IEEE. Asian Control Conference, pp. 1679-1684, 2009.
[99] H. Feng-jun, W. Bin. “Quantum Evolutionary Algorithm for Vehicle Routing Problem with Simultaneous Delivery and Pickup”. Institute of Electrical and Electronics Enginners- IEEE. Decision and Control, 28th Chinese Control conference, pp. 5097-5101, 2009.
[100] T. Jin Ai, V. Kachitvichyanukul. “A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery”. European Journal of Operational Research-ELSEVIER, Computers & Operations Research, pp. 1693-1702, 2009.
[101] M. Avci, S. Topaloglu. “A hybrid metaheuristic algorithm for heterogeneous vehicle routing problem with simultaneous pickup and delivery”. Expert Systems with Applications, Volume 53, pp. 160-171, 2016.
[102] S. Mitrović Minić, G. Laporte. “Waiting strategies for the dynamic pickup and delivery problem with time windows”. European Journal of Operational Research-ELSEVIER. Transportation Research Part B. Methodological, pp. 635-655, 2004.
[103] C.K.Y. Lin. “A cooperative strategy for a vehicle routing problem with pickup and delivery time windows”. European Journal of Operational Research-ELSEVIER. Computers & Industrial Engineering, pp. 766-782, 2008.
[104] G. Berbeglia, G. Hahn. “Counting feasible solutions of the traveling salesman problem with pickups and deliveries is NP-complete”. European Journal of Operational Research-ELSEVIER. Discrete Applied Mathematics, pp. 2541-2547, 2009.
[105] D. Männel, A. Bortfeldt. “A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints”. European Journal of Operational Research – ELSEVIER, Volume 254, Issue 3, 1, pp. 840-858, 2016.
[106] R. C. Cruz, T. C. B. Silva, M J. F. Souza, V. N. Coelho, M. T. Mine, A. X. Martins. “GENVNSTS-CL-PR: A heuristic approach for solving the vehicle routing problem with simultaneous”. European Journal of Operational Research- ELSEVIER. Electronics Notes in Discrete Mathematics, pp. 217-224, 2012.
[107] S. N. D’Souza Omkar, J. Senthilnath. “Pickup and delivery problem using metaheuristics techniques”. European Journal of Operational Research-ELSEVIER. Experts Systems with Applications, pp. 328-334, 2012.
[108] R. Liu, X. Xie, V. Augusto, C. Rodríguez. “Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care”. European Journal of Operational Research-ELSEVIER, p.p 475-486, 2013.
[109] Y. Qu, J. F. Bard. “The heterogeneous pickup and delivery problem with configurable vehicle capacity”. European Journal of Operational Research-ELSEVIER. Transportation Research Part C. Emerging Technologies, pp. 1-20, 2013.
[110] P. Chen, H. Huang, X. Dong. “An Ant Colony System Based Heuristic Algorithm for the Vehicle Routing Problem with Simultaneous Delivery and Pickup”. Institute of Electrical and Electronics Enginners-IEEE. Industrial Electronics and Applications, pp. 136-141, 2007.
[111] T. Zhang, Y. J. Zhang,, Q. I. Chen, Y. Sun. “The Mixed Algorithm for vehicle routing problem with simultaneous pickup and delivery”. Institute of Electrical and Electronics Enginners-IEEE, Machine Learning and Cybernetics, pp. 1871-1876, 2009.
[112] A. Subramanian. “Metaheristica Iterated Local Search aplicada ao problema de Rotetamento de veículos com coleta e entrega Simultanâa. Master´s Thesis, Programa de Pósgraduçâo em Engenharia de Produçâo. Universidade Federal da Paraiba, João Pessoa, PB. Brazil, (in Portuguese), 2008.
Cómo citar
Ballesteros Silva, P. P., & Escobar Zuluaga, A. H. (2016). Descripción de la clasificación de publicaciones y los modelos utilizados en la solución del problema de enrutamiento vehicular con entregas y recogidas. Revista Ingenierías Universidad De Medellín, 15(28), 287-306. https://doi.org/10.22395/rium.v15n28a14
Descargas
La descarga de datos todavía no está disponible.
