Journal of Transportation Research

Journal of Transportation Research

Developing a nonlinear programming model for scheduling and routing of transportation systems

Document Type : Original Article

Authors
Shahriar Afandizadeh 1
Ashkan Safari 2
Hamid Bigdeli Rad 3
1 Professor, School of Civil Engineering, Iran University of Science and Technology, Tehran, Iran.
2 M.Sc., Student, Islamic Azad University, South Tehran Branch, Tehran, Iran.
3 Ph.D., Student, School of Civil Engineering, Iran University of Science and Technology, Tehran, Iran.
10.22034/tri.2023.409583.3178
Abstract
The vehicle routing problem is one of the most important optimization problems. Routing issues refer to a set of issues in which a number of concentrated vehicles are stationed at one or more bars and must visit a set of customers, each of whom has a certain demand, and provide services. The purpose of this study is to provide a routing and scheduling model of the transportation system for long routes. For this purpose, after studying the sources and references related to the design of integrated distribution systems, the investigated problem was modeled in the form of mixed integer nonlinear programming considering the limitations and assumptions. After the exact solution of the model, and due to the problem being NP-hard, two meta-heuristic algorithms of harmony search and refrigeration simulation algorithm were used to solve the problem in large dimensions. It should be noted that the four criteria of cost, carbon dioxide gas emission, start-up time and level were evaluated, and the results indicated the high performance of the refrigeration simulation algorithm compared to the search for harmony. Specifically, to solve the model in large dimensions, it was found that the refrigeration simulation algorithm with a 2% improvement compared to the harmony search algorithm has reduced the costs of the chain. On the other hand, in the cargo transfer time, the refrigeration simulation algorithm has transferred the products between the factory and the customer with an average time of 90.227 minutes compared to the Harmony search algorithm by 2%.
Keywords
Supply Chain
Vehicle Routing Problem
Forward Propagation
Harmony Search Algorithm
Subjects
-Abdi, A., Mosadeq, Z., & Bigdeli Rad, H. (2020). Prioritizing Factors Affecting Road Safety Using Fuzzy Hierarchical Analysis. Journal of Transportation Research, 17(3), 33-44.
-Afandizadeh Zargari, S., Bigdeli Rad, H., & Shaker, H. (2019). Using optimization and metaheuristic method to reduce the bus headway (Case study: Qazvin Bus Routes). Quarterly Journal of Transportation Engineering, 10(4), 833-849.
-Afandizadeh, S., & Bigdeli Rad, H. (2021). Developing a model to determine the number of vehicles lane changing on freeways by Brownian motion method. Nonlinear Engineering, 10(1),450-460.
-Afandizadeh, S., Aziz Jalali, D., & Bigdeli Rad, H. (2023). Optimal routing for shared autonomous vehicles feeder services in urban networks. Journal of Transportation Research.
-Afandizadeh, S., Ourmazdi Khoramshahi, S., & Bigdeli Rad, H. (2023). Evaluation of road diet strategy as one of the methods of demand management for non-motorized vehicles and pedestrians in the cities center. Road.
-Braaten, S., Gjønnes, O., Hvattum, L. M., & Tirado, G. (2017). Heuristics for the robust vehicle routing problem with time windows. Expert Systems with Applications, 77, 136-147.
-Brandão, J. (2020). A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem. European Journal of Operational Research, 284(2), 559-571.
-Chen, X., Zhou, M., Shen, W., Zhu, G., & Ge, X. (2018). Mechanical properties and microstructure of metakaolin-based geopolymer compound-modified by polyacrylic emulsion and polypropylene fibers. Construction and Building Materials, 190, 680-690.
-Coelho, L. C., Cordeau, J. F., & Laporte, G. (2012). Consistency in multi-vehicle inventory-routing. Transportation Research Part C: Emerging Technologies, 24, 270-287.
-Eydi, A. R., & Abdorahimi, H. (2022). Model and Solution Approach for Multi-Period and Multi-Depot Vehicle Routing Problem with Flexibility in Specifying the Last Depot of Each Route. International Journal of Industrial Engineering, 23(3), 333-349.
-Feillet, D., Garaix, T., Lehuédé, F., Péton, O., & Quadri, D. (2014). A new consistent vehicle routing problem for the transportation of people with disabilities. Networks, 63(3), 211-224.
-Fu, L. L., Aloulou, M. A., & Triki, C. (2017). Integrated production scheduling and vehicle routing problem with job splitting and delivery time windows. International Journal of Production Research, 55(20), 5942-5957.
-Groër, C., Golden, B., & Wasil, E. (2009). The consistent vehicle routing problem. Manufacturing & Service Operations Management, 11(4), 630-643.
-Gulczynski, D., Golden, B., & Wasil, E. (2021). The multi-depot split delivery vehicle routing problem: An integer programming-based heuristic, new test problems, and computational results. Computers & Industrial Engineering, 61(3), 794-804.
-Hajisoleimani, M. M., Abdi, A., & Bigdeli Rad, H. (2021). Intermodal Non-Motorized Transportation Mode Choice; Case Study: Qazvin City. Space Ontology International Journal, 10(3), 31-46.
-Hu, C., Lu, J., Liu, X., & Zhang, G. (2018). Robust vehicle routing problem with hard time windows under demand and travel time uncertainty. Computers & Operations Research, 94, 139-153.
-Kovacs, A. A., Golden, B. L., Hartl, R. F., & Parragh, S. N. (2014). Vehicle routing problems in which consistency considerations are important: A survey. Networks, 64(3), 192-213.
-Niu, Y., Yang, Z., Chen, P., & Xiao, J. (2018). Optimizing the green open vehicle routing problem with time windows by minimizing comprehensive routing cost. Journal of cleaner production, 171, 962-971.
-Ponboon, S., Qureshi, A. G., & Taniguchi, E. (2016). Evaluation of cost structure and impact of parameters in location-routing problem with time windows. Transportation Research Procedia, 12, 213-226.
-Sadykov, R., Uchoa, E., & Pessoa, A. (2021). A Bucket Graph–Based Labeling Algorithm with Application to Vehicle Routing. Transportation Science, 55(1), 4-28.
-Spliet, R., & Dekker, R. (2016). The driver assignment vehicle routing problem. Networks, 68(3), 212-223.
-Spliet, R., Dabia, S., & Van Woensel, T. (2018). The time window assignment vehicle routing problem with time-dependent travel times. Transportation Science, 52(2), 261-276.
-Taş, D., Jabali, O., & Van Woensel, T. (2014). A vehicle routing problem with flexible time windows. Computers & Operations Research, 52, 39-54.
-Ticha, H. B., Absi, N., Feillet, D., & Quilliot, A. (2019). Multigraph modeling and adaptive large neighborhood search for the vehicle routing problem with time windows. Computers & Operations Research, 104, 113-126.