A bi-objective transportation-location arc routing problem

References

• Albareda-Sambola, M. 2015. Location Science. Edited by, G. Laporte, S. Nickel, and F. Saldanha Da Gama. Cham: Springer International Publishing. Print ISBN: 978-3-319-13110-8. Online ISBN: 978-3-319-13111-5.
   Google Scholar
• Amini, A., R. Tavakkoli-Moghaddam, and S. Ebrahimnejad (2017) “Scenario-Based Location Arc Routing Problems: Introducing Mathematical Models.” in Proceedings of the Eleventh International Conference on Management Science and Engineering Management, 511–521. Japan: Springer.
   Google Scholar
• Amiri, M., S. Hassanzadeh Amin, and R. Tavakkoli-Moghaddam. 2019. “A Lagrangean Decomposition Approach for a Novel Two-echelon Node-based Location-routing Problem in an Offshore Oil and Gas Supply Chain.” Transportation Research Part E: Logistics and Transportation Review 128: 96-114. doi: 10.1016/j.tre.2019.05.014.
   Web of Science ®Google Scholar
• Angueira, J., K. C. Konduri, V. Chakour, and N. Eluru. 2017. “Exploring the Relationship between Vehicle Type Choice and Distance Traveled: A Latent Segmentation Approach.” Transportation Letters 11 (3): 1–12.
   Web of Science ®Google Scholar
• Azadeh, A., and H. Farrokhi-Asl. 2019. “The Close – Open Mixed Multi Depot Vehicle Routing Problem considering Internal and External Fleet of Vehicles.” Transportation Letters 11 (2): 78–92. doi:10.1080/19427867.2016.1274468.
   Web of Science ®Google Scholar
• Beullens, P., L. Muyldermans, D. Cattrysse, and D. Van Oudheusden. 2003. “A Guided Local Search Heuristic for the Capacitated Arc Routing Problem.” European Journal of Operational Research 147 (3): 629–643. doi:10.1016/S0377-2217(02)00334-X.
   Web of Science ®Google Scholar
• Burke, E. K., and Y. Bykov. 2017. “The Late Acceptance Hill-Climbing Heuristic.” European Journal of Operational Research 258 (1): 70–78. doi:10.1016/j.ejor.2016.07.012.
   Web of Science ®Google Scholar
• Calvete, H. I., C. Gal, and L. Polo. 2016. Modeling and Simulation in Engineering, Economics and Management. Edited by, R. León, M. J. Muñoz-Torres, and J. M. Moneva. Cham: Springer International Publishing (Lecture Notes in Business Information Processing). ISBN: 978-3-319-40506-3.
   Google Scholar
• Dantzig, G. B., and J. H. Ramser. 1959. “The Truck Dispatching Problem.” Management Science 6 (1): 80–91. doi:10.1287/mnsc.6.1.80.
   Web of Science ®Google Scholar
• Deb, K., A. Pratap, S. Agarwal, and T. Meyarivan. 2002. “A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II.” IEEE Transactions on Evolutionary Computation 6 (2): 182–197. doi:10.1109/4235.996017.
   Web of Science ®Google Scholar
• Drexl, M., and M. Schneider. 2014. “A Survey of the Standard Location-Routing Problem.” Annals of Operations Research 259 (1–2): 389–414.
   Google Scholar
• Fallah, M., R. Tavakkoli-Moghaddam, M. Alinaghian, and A. Salamatbakhsh-Varjovi. 2019. “A Robust Approach for a Green Periodic Competitive VRP under Uncertainty: DE and PSO Algorithms.” Journal of Intelligent & Fuzzy Systems 36 (6): 5213–5225. doi: 0.3233/JIFS-179323.
   Web of Science ®Google Scholar
• Farrokhi-Asl, H., R. Tavakkoli-Moghaddam, B. Asgarian, and E. Sangari. 2017. “Metaheuristics for a Bi-objective Location-routing-problem in Waste Collection Management.” Journal of Industrial and Production Engineering 34 (4): 239–252. doi:10.1080/21681015.2016.1253619.
   Web of Science ®Google Scholar
• Gendreau, M., G. Ghiani, and E. Guerriero. 2015. “Time-dependent Routing Problems: A Review.” Computers & Operations Research 64: 189–197. doi:10.1016/j.cor.2015.06.001.
   Web of Science ®Google Scholar
• Ghiani, G., and G. Laporte. 1999. “Eulerian Location Problems.” Networks 34 (4): 291–302. doi:10.1002/(ISSN)1097-0037.
   Web of Science ®Google Scholar
• Ghiani, G., and G. Laporte. 2001. “Location-arc Routing Problems.” Opsearch 38 (2): 151–159. doi:10.1007/BF03399222.
   Google Scholar
• Hashemi Doulabi, S. H., and A. Seifi. 2013. “Lower and Upper Bounds for Location-arc Routing Problems with Vehicle Capacity Constraints.” European Journal of Operational Research 224 (1): 189–208. doi:10.1016/j.ejor.2012.06.015.
   Web of Science ®Google Scholar
• Levy, L., and L. Bodin. 1989. “The Arc Oriented Location Routing Problem.” INFOR: Information Systems and Operational Research 27 (1): 74–94.
   Web of Science ®Google Scholar
• Lopes, R. B., C. Carlos Ferreira, B. Sousa Santos, and S. Barreto. 2013. “A Taxonomical Analysis, Current Methods and Objectives on Location-routing Problems.” International Transactions in Operational Research 20 (6): 795–822.
   Web of Science ®Google Scholar
• Lopes, R. B., F. Plastria, C. Ferreira, and B. Sousa Santos. 2014. “Location-arc Routing Problem: Heuristic Approaches and Test Instances.” Computers and Operations Research 43: 309–317. doi:10.1016/j.cor.2013.10.003.
   Web of Science ®Google Scholar
• Martínez-Salazar, I. A., J. Molina, F. Angel-Bello, T. Gomez, and R. Caballero. 2014. “Solving a Bi-objective Transportation Location Routing Problem by Metaheuristic Algorithms.” European Journal of Operational Research 234 (1): 25–36. doi:10.1016/j.ejor.2013.09.008.
   Web of Science ®Google Scholar
• Mavrotas, G. 2009. “Effective Implementation of the ε-constraint Method in Multi-Objective Mathematical Programming Problems.” Applied Mathematics and Computation 213 (2): 455–465. doi:10.1016/j.amc.2009.03.037.
   Web of Science ®Google Scholar
• Musolino, G., A. Polimeni, and A. Vitetta. 2016. “Freight Vehicle Routing with Reliable Link Travel Times: A Method Based on Network Fundamental Diagram.” Transportation Letters 10 (3): 159–171. doi:10.1080/19427867.2016.1241040.
   Web of Science ®Google Scholar
• Nadizadeh, A., and B. Kafash. 2019. “Fuzzy Capacitated Location-routing Problem with Simultaneous Pickup and Delivery Demands.” Transportation Letters 11 (1): 1–19. doi:10.1080/19427867.2016.1270798.
   Web of Science ®Google Scholar
• Pia, A., and C. Filippi. 2006. “A Variable Neighborhood Descent Algorithm for A Real Waste Collection Problem with Mobile Depots.” International Transactions in Operational Research 13 (2): 125–141. doi:10.1111/itor.2006.13.issue-2.
   Google Scholar
• Prodhon, C., and C. Prins. 2014. “A Survey of Recent Research on Location-routing Problems.” European Journal of Operational Research 238 (1): 1–17. doi:10.1016/j.ejor.2014.01.005.
   Web of Science ®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. doi:10.1179/1942787514Y.0000000042.
   Web of Science ®Google Scholar
• Rabbani, M., R. Heidari, H. Farrokhi-Asl, and N. Rahimi. 2018. “Using Metaheuristic Algorithms to Solve a Multi-objective Industrial Hazardous Waste Location-routing Problem considering Incompatible Waste Types.” Journal of Cleaner Production 170: 227–241. doi:10.1016/j.jclepro.2017.09.029.
   Web of Science ®Google Scholar
• Riquelme-Rodríguez, J. P., M. Gamache, and A. Langevin. 2016. “Location Arc Routing Problem with Inventory Constraints.” Computers and Operations Research 76: 84–94. doi:10.1016/j.cor.2016.06.012.
   Web of Science ®Google Scholar
• Tavakkoli-Moghaddam, R., A. Amini, and S. Ebrahimnejad. 2018. “A New Mathematical Model for A Multi-product Location-arc Routing Problem.” in 2018 4th International Conference on Optimization and Applications (ICOA). Morocco: IEEE.
   Google Scholar
• Yao, B., Y. Cao, Z. Wang, P. Hu, M. Zhang, and B. Yu. 2016. “Routing Problem with Mixed Load Plan A Two-stage Heuristic Algorithm for the School Bus Routing Problem with Mixed Load Plan.” Transportation Letters 8 (4): 205–219. doi:10.1080/19427867.2015.1110953.
   Web of Science ®Google Scholar
• Zitzler, E., and L. Thiele. 1999. “Multiobjective Evolutionary Algorithms: A Comparative Case Study and the Strength Pareto Approach.” IEEE Trans. On Evolutionary Computation 3 (4): 257–271. doi:10.1109/4235.797969.
   Web of Science ®Google Scholar