The close–open mixed multi depot vehicle routing problem considering internal and external fleet of vehicles

References

• Afshar-Nadjafi, B., and A. Afshar-Nadjafi. 2014. “A Constructive Heuristic for Time-dependent Multi-depot Vehicle Routing Problem with Time-windows and Heterogeneous Fleet.” Journal of King Saud University-Engineering Sciences, 29(1): 29–34.
   Google Scholar
• Ai, T. J., and V. Kachitvichyanukul. 2009. “A Particle Swarm Optimisation for Vehicle Routing Problem with Time Windows.” International Journal of Operational Research 6 (4): 519–537.10.1504/IJOR.2009.027156
   Google Scholar
• Akgüngör, A. P., and E. Doğan. 2009. “An Artificial Intelligent Approach to Traffic Accident Estimation: Model Development and Application.” Transport 24 (2): 135–142.10.3846/1648-4142.2009.24.135-142
   Web of Science ®Google Scholar
• Amiama, C., J. M. Pereira, L. Carpente, and J. Salgado. 2015. “Spatial Decision Support System for the Route Management for Milk Collection from Dairy Farms.” Transportation Letters 7 (5): 279–288.10.1179/1942787515Y.0000000001
   Web of Science ®Google Scholar
• Azi, N., M. Gendreau, and J.-Y. Potvin. 2010. “An Exact Algorithm for a Vehicle Routing Problem with Time Windows and Multiple Use of Vehicles.” European Journal of Operational Research 202 (3): 756–763.10.1016/j.ejor.2009.06.034
   Web of Science ®Google Scholar
• Baykasoglu, A., V. Kaplanoglu, R. Erol, and C. Sahin. 2011. “A Multi-agent Framework for Load Consolidation in Logistics.” Transport 26 (3): 320–328.10.3846/16484142.2011.622141
   Web of Science ®Google Scholar
• Bodin, L., Golden, B., Assad, A., and M. Ball. 1983. The State of the Art in the Routing and Scheduling of Vehicles and Crews (No. UMTA-MD-11-0004-81-2Final Rpt.). Computers and Operations Research 10 (2): 63–212.
   Google Scholar
• Bräysy, O., and M. Gendreau. 2005a. “Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms.” Transportation Science 39 (1): 104–118.
   Web of Science ®Google Scholar
• Bräysy, O., and M. Gendreau. 2005b. “Vehicle Routing Problem with Time Windows, Part II: Metaheuristics.” Transportation Science 39 (1): 119–139.
   Web of Science ®Google Scholar
• Carlsson, J., D. Ge, A. Subramaniam, A. Wu, and Y. Ye. 2009. “Solving Min-max Multi-depot Vehicle Routing Problem: Lectures on Global Optimization.” Fields Institute Communications 55: 31–46.
   Google Scholar
• Clarke, G. u., and J. Wright. 1964. “Scheduling of Vehicles from a Central Depot to a Number of Delivery Points.” Operations Research 12 (4): 568–581.10.1287/opre.12.4.568
   Web of Science ®Google Scholar
• Cordeau, J.-F., M. Gendreau, and G. Laporte. 1997. “A Tabu Search Heuristic for Periodic and Multi-depot Vehicle Routing Problems.” Networks 30 (2): 105–119.10.1002/(ISSN)1097-0037
   Web of Science ®Google Scholar
• Crevier, B., J.-F. Cordeau, and G. Laporte. 2007. “The Multi-depot Vehicle Routing Problem with Inter-depot Routes.” European Journal of Operational Research 176 (2): 756–773.10.1016/j.ejor.2005.08.015
   Web of Science ®Google Scholar
• Dantzig, G. B., and J. H. Ramser. 1959. The Truck Dispatching Problem: Management Science 6 (1): 80–91.
   Google Scholar
• Desrochers, M., and G. Laporte. 1991. “Improvements and Extensions to the Miller–Tucker–Zemlin Subtour Elimination Constraints.” Operations Research Letters 10 (1): 27–36.10.1016/0167-6377(91)90083-2
   Web of Science ®Google Scholar
• Falkenauer, E., and S. Bouffouix. 1991. “A Genetic Algorithm for Job Shop.” Proceedings 1991 IEEE International Conference on Robotics and Automation: Sacramento, California, 824–829.
   Google Scholar
• Fleszar, K., I. H. Osman, and K. S. Hindi. 2009. “A Variable Neighbourhood Search Algorithm for the Open Vehicle Routing Problem.” European Journal of Operational Research 195 (3): 803–809.10.1016/j.ejor.2007.06.064
   Web of Science ®Google Scholar
• Geetha, S., G. Poonthalir, and P. Vanathi. 2013. “Nested Particle Swarm Optimisation for Multi-depot Vehicle Routing Problem.” International Journal of Operational Research 16 (3): 329–348.10.1504/IJOR.2013.052336
   Google Scholar
• Gen, M., and R. Cheng. 2000. Genetic Algorithms and Engineering optimization. (Vol. 7). New York: John Wiley &Sons.
   Google Scholar
• Gen, Mitsuo, and Admi Syarif. 2003. “Multi-stage Supply Chain Network by Hybrid Genetic Algorithms.” In Fuzzy Sets Based Heuristics for Optimization, edited by J. L.Verdegay, 181–196. Berlin Heidelberg: Springer.
   Google Scholar
• Gendreau, M., J.-Y. Potvin, O. Bräumlaysy, G. Hasle, and A. Løkketangen. 2008. Metaheuristics for the Vehicle Routing Problem and Its Extensions: A Categorized Bibliography. In The vehicle routing problem: latest advances and new challenges (pp. 143–169). New York: Springer.
   Google Scholar
• Goldberg, D. E. 1989. Genetic Algorithms in Search, Optimization, and Machine Learning. Reading, MA: Addison-wesley.
   Google Scholar
• Goldberg, D. E., and R. Lingle. 1985. “Alleles, Loci, and the Traveling Salesman Problem.” Proceedings of the First International Conference on Genetic Algorithms and Their Applications, 154–159. Hillsdale, NJ: Lawrence Erlbaum Associates.
   Google Scholar
• Ho, W., G. T. Ho, P. Ji, and H. C. Lau. 2008. “A Hybrid Genetic Algorithm for the Multi-depot Vehicle Routing Problem.” Engineering Applications of Artificial Intelligence 21 (4): 548–557.10.1016/j.engappai.2007.06.001
   Web of Science ®Google Scholar
• Ho, W., and P. Ji. 2003. “Component Scheduling for Chip Shooter Machines: A Hybrid Genetic Algorithm Approach.” Computers & Operations Research 30 (14): 2175–2189.10.1016/S0305-0548(02)00129-6
   Web of Science ®Google Scholar
• Ho, W., and P. Ji. 2004. “A Hybrid Genetic Algorithm for Component Sequencing and Feeder Arrangement.” Journal of Intelligent Manufacturing 15 (3): 307–315.10.1023/B:JIMS.0000026569.88191.46
   Web of Science ®Google Scholar
• Kallehauge, B. 2008. “Formulations and Exact Algorithms for the Vehicle Routing Problem with Time Windows.” Computers & Operations Research 35 (7): 2307–2330.10.1016/j.cor.2006.11.006
   Web of Science ®Google Scholar
• Kallehauge, B., J. Larsen, O. B. Madsen, and M. M. Solomon. 2005. Vehicle Routing Problem with Time Windows. In Column generation (pp. 67–98). New York: Springer.10.1007/b135457
   Google Scholar
• Kara, I., G. Laporte, and T. Bektas. 2004. “A Note on the Lifted Miller–Tucker–Zemlin Subtour Elimination Constraints for the Capacitated Vehicle Routing Problem.” European Journal of Operational Research 158 (3): 793–795.10.1016/S0377-2217(03)00377-1
   Web of Science ®Google Scholar
• Küçükoğlu, I., and N. Öztürk. 2013. “A Differential Evolution Approach for the Vehicle Routing Problem with Backhauls and Time Windows.” Journal of Advanced Transportation, 48(8): 942–956.
   Web of Science ®Google Scholar
• Laporte, G. 2009. Fifty Years of Vehicle Routing: Transportation Science 43 (4): 408–416.
   Web of Science ®Google Scholar
• Li, F., B. Golden, and E. Wasil. 2007. “The Open Vehicle Routing Problem: Algorithms, Large-scale Test Problems, and Computational Results.” Computers & Operations Research 34 (10): 2918–2930.10.1016/j.cor.2005.11.018
   Web of Science ®Google Scholar
• Li, X., S. C. Leung, and P. Tian. 2012. “A Multistart Adaptive Memory-based Tabu Search Algorithm for the Heterogeneous Fixed Fleet Open Vehicle Routing Problem.” Expert Systems with Applications 39 (1): 365–374.10.1016/j.eswa.2011.07.025
   Web of Science ®Google Scholar
• Lin, C., K. Choy, G. Ho, S. Chung, and H. Lam. 2014. “Survey of Green Vehicle Routing Problem: Past and Future Trends.” Expert Systems with Applications 41 (4): 1118–1138.10.1016/j.eswa.2013.07.107
   Web of Science ®Google Scholar
• Liu, R., and Z. Jiang. 2012. “The Close–Open Mixed Vehicle Routing Problem.” European Journal of Operational Research 220 (2): 349–360.10.1016/j.ejor.2012.01.061
   Web of Science ®Google Scholar
• Liu, R., Z. Jiang, H. Hu, and S. Yao. 2010. “A Memetic Algorithm for the Close–Open Mixed Vehicle Routing Problem.” IEEE International Conference on Industrial Engineering and Engineering Management (IEEM), IEEE, 728–732.
   Google Scholar
• Marinakis, Y., and A. Migdalas. 2007. Annotated Bibliography in Vehicle Routing: Operational Research 7 (1): 27–46.
   Google Scholar
• Oliver, I., D. Smith, and J. R. Holland. 1987. “Study of Permutation Crossover Operators on the Traveling Salesman Problem.” Proceedings Genetic algorithms and their applications: proceedings of the second International Conference on Genetic Algorithms: July 28–31, 1987 at the Massachusetts Institute of Technology, Cambridge, MA. Hillsdale, NJ: L. Erlhaum Associates.
   Google Scholar
• Pichpibul, T. and Kawtummachai, R. 2012. “A modified savings heuristic for the close-open mixed vehicle routing problem.”. In Proceedings of the Asia pacific Industrial Engineerings and Management Systems Conference, Phuket, Thailand.
   Google Scholar
• Polacek, M., R. F. Hartl, K. Doerner, and M. Reimann. 2004. A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows: Journal of Heuristics 10 (6): 613–627.
   Google Scholar
• Quirion-Blais, O., M. Trépanier, and A. Langevin. 2015. “A Case Study of Snow Plow Routing Using an Adaptive Large Hood Search Metaheuristic.” Transportation Letters 7 (4): 201–209.10.1179/1942787514Y.0000000042
   Web of Science ®Google Scholar
• Rabbani, M., H. Farrokhi-asl, and H. Rafiei. 2016. “A Hybrid Genetic Algorithm for Waste Collection Problem by Heterogeneous Fleet of Vehicles with Multiple Separated Compartments.” Journal of Intelligent & Fuzzy Systems 30 (3): 1817–1830.10.3233/IFS-151893
   Web of Science ®Google Scholar
• Repoussis, P. P., C. D. Tarantilis, O. Bräysy, and G. Ioannou. 2010. “A Hybrid Evolution Strategy for the Open Vehicle Routing Problem.” Computers & Operations Research 37 (3): 443–455.10.1016/j.cor.2008.11.003
   Web of Science ®Google Scholar
• Saaty, T. L. 1977. A Scaling Method for Priorities in Hierarchical Structures: Journal of Mathematical Psychology 15 (3): 234–281.
   Web of Science ®Google Scholar
• Saaty, T. L. 2003. “Decision-making with the AHP: Why is the Principal Eigenvector Necessary.” European Journal of Operational Research 145 (1): 85–91.10.1016/S0377-2217(02)00227-8
   Web of Science ®Google Scholar
• Sariklis, Dimitrios, and Susan Powell. 2000. “A heuristic method for the open vehicle routing problem.” Journal of the Operational Research Society 51 (5): 564–573.
   Web of Science ®Google Scholar
• Salhi, S., A. Imran, and N. A. Wassan. 2014. “The Multi-depot Vehicle Routing Problem with Heterogeneous Vehicle Fleet: Formulation and a Variable Neighborhood Search Implementation.” Computers & Operations Research 52: 315–325.
   Web of Science ®Google Scholar
• Schrage, L. 1981. “Formulation and Structure of More Complex/Realistic Routing and Scheduling Problems.” Networks 11 (2): 229–232.10.1002/(ISSN)1097-0037
   Web of Science ®Google Scholar
• Sumichras, R. T., and I. S. Markham. 1995. “A Heuristic and Lower Bound for a Multi-depot Routing Problem.” Computers & Operations Research 22 (10): 1047–1056.
   Web of Science ®Google Scholar
• Toth, P., and D. Vigo. 2002. The Vehicle Routing Problem, Volume 9 of SIAM Monographs on Discrete Mathematics and Applications. Philadelphia, PA: SIAM.
   Google Scholar
• Tsai, J. T., J. H. Chou, and T. K. Liu. 2006 January. “Tuning the Structure and Parameters of a Neural Network by Using Hybrid Taguchi-genetic Algorithm.” IEEE Transactions on Neural Networks 17 (1): 69–80.10.1109/TNN.2005.860885
   PubMed Web of Science ®Google Scholar
• Wang, X., M. Dessouky, and F. Ordonez 2016. “A Pickup and Delivery Problem for Ridesharing Considering Congestion.” Transportation Letters: The International Journal of Transportation Research, 8(5), pp. 259–269.
   Web of Science ®Google Scholar
• Zheng, H. 2014. “Optimization of Bus Routing Strategies for Evacuation.” Journal of Advanced Transportation 48 (7): 734–749.10.1002/atr.v48.7
   Web of Science ®Google Scholar