Transportation Fleet Routing Algorithm Model Based on Parallel Universes (Case Study: Global Distribution of Poultry Meat in Tehran)

مجله اقتصاد و توسعه کشاورزی

Article 3, Volume 32, Issue 1 - Serial Number 39, April 2018, Pages 57-67   

Document Type: Research Article

DOI: 10.22067/jead2.v32i1.66248

Authors

F. Riahi^{* 1}; A.H. Chizari¹; A.R. Akbari Bayat²

¹University of Tehran

²University of Amirkabir

Abstract

Introduction: Transportation has long been a special place in the economy of Iran and has already had a special position in economic, production and services systems. According to the Central Bank of Iran's statistics, about 13.6 percent of the national income of the country is related to the transport and warehousing sector and about 9 percent of it, belongs to the transport sector. In the past decade, with an average growth of 14.5%, the share of transportation sector has been one of the most important components of economic growth. However, long-standing issues such as the lack of utilization of all fleet capacity and lack of knowledge about optimal distribution routes have caused overhead transportation costs to be off sized by the profits of company’s activities in the distribution sector as well as by manufacturers. Hence, researchers have always sought solutions to improve the transportation routes and eliminate these additional costs.
One of the most important issues in the field of transportation, which is highly considered, is the Vehicle Routing Problem (VRP) issue. The most prominent types of VRP issues is, the carrying goods problem which is limited by the goods delivery time. This issue is very common in carrying perishable goods. The most vital issue in carrying perishable goods such as protein products, is to maintain its quality along the route, which is important in addition to the economic overview in terms of maintaining food safety. Tehran with population around 8293140, is one of the populated city among 25 cities in the world, which has got most important role to study in this issue.
The major part of the protein which is consumed by the citizens of Tehran is poultry meat. In Tehran, about 10% of the physical distribution of poultry meat is made by the grocery section of municipality of Tehran. It is distributed through 141 retail markets, which are supplied by two central warehouses. Accordingly, in the present study, with an examination of the existing transport structure, we will present an optimal pattern for distributing daily chicken meat in Tehran's retail markets.
Materials and Methods: The VRP refers to a set of issues in which a number of vehicles concentrated in one or more locations should go to a set of customers, each with a specific demand, to provide a service. For the VRP issue, a variety of different constraints are presented. But the limited-capacity vehicle routing (CVRP) is a major example of vehicle routing, in which all customers have the same delivery limited area and specified demand. In the above question, the goal is to minimize the linear composition of the number of paths, the length of the routes or the travel time, so that more convenient and less costly customer service can be provided.
In order to solve the transport problem, two parallel world algorithms and a definite algorithm is used. Then, the algorithms are compared. For this purpose, according to the data of the year 92 of the chicken distribution network in Tehran, a model was made by considering two chicken distribution depots as well as 141 poultry meat market.
Results and Discussion: The comparison of the answer to the meta-exploratory algorithm is used, and the answer from the definitive methods indicates that the solutions provided by definite methods are superior to the proposed meta-exploratory algorithm and this excellence has come at the expense of using more time. Increasing the execution time of the meta-exploratory algorithm results in the closeness of the solution of the algorithm to the results of definite algorithms. Also, the results showed that the best answer based on definite algorithms was 40231.6 million Rials, which after 36,000 seconds this answer was obtained and during different times, this answer has dramatically improved. Through the algorithm of parallel universes, although the optimal answer is different from the optimal solution of definitive methods (There is only 5.26% difference in results), at the beginning of the problem solution, almost the optimal answer has been obtained, and the longer solving time has not changed much in cost reduction. In addition, by comparing the results of the existing conditions and the optimal transport model, it can be seen that, transportation costs in existing conditions are 2.33 and 2.14 times more than two definitive routing algorithms and parallel universes.
Conclusions: Considering the evidence and research findings, based on the problem-solving time of VRP and the significance of costs, the Tehran municipality can apply the designed model based on parallel algorithm solving methods to improve the poultry meat transportation network. So if all markets in a comprehensive system declare their demand, then distribution of chicken meet can be optimized. It is recommended to create an intelligent system for recording and tracking market orders, for better implementation of the desired transport pattern.

Keywords

Parallel universes; Poultry meat; Routing; Tehran city

References

1- Iran, I.R., Central Bank of the Islamic Republic of Iran, 2016. Time series database of Central Bank of the Islamic Republic of Iran.

2- Beheshti Nia M.A., Feyz D., and Sadadi F. 2017. The integration of the problem of transporting vehicles with the timing of transportation and production in the supply chain, Journal of Transportation Engineering, 9(33): 153-182.

3- Kabiri K., and Mesgari M.S. 2016. Optimize the receipt and delivery of postal service between the centers by vehicles bearing capacity using meta-heuristic algorithms. Journal of Geomatics Science and Technology, 6(4): 173-184.

4- Dehbari S., Pourrousta A.R., Naderi Beni M., Ghobadian E., and Tavakkoli Moghaddam R. 2013. Multi-Objective VRP with Stochastic Time and Fuzzy Demand under Time Windows Constraints, Journal of Operations Research and Applications (Applied Mathematics), 9(4): 85–106.

5- Toth P., and Vigo D. eds., 2002. The vehicle routing problem. Society for Industrial and Applied Mathematics.

6- Yang C., McCollum D., McCarthy R., and Leighty W. 2009. Meeting an 80% reduction in greenhouse gas emissions from transportation by 2050: A case study in California. Transportation Research Part D: Transport and Environment, 14(3): 147-156.

7- Fallah Menshadi E., Rohi A., and Fallah Menshadi A. 2015. Analysis and examination of the measures necessary for the implementation of integrated urban transport in metropolises; Case study: Tehran city, 6(20): 83-98.

8- Hoseinpour H.A., Mosadeghkhah M., and Tavakoli Moghadam R. 2009. Solving a Stochastic Multi-Depot Multi - Objective Vehicle Routing Problem by a Simulated Annealing, Journal of Industrial Engineering 43(1): 25–36.

9- Koç Ç., Bektaş T., Jabali O., and Laporte G. 2016. Thirty years of heterogeneous vehicle routing. European Journal of Operational Research, 249(1):1-21.

10- Cordeau J.F., Laporte G., Savelsbergh M.W., and Vigo D. 2007. Vehicle routing, Handbooks in operations research and management science, 14: 367-428.

11- Laporte G. 2009. Fifty years of vehicle routing, Transportation Science 43(4): 408-416.

12- Toth P., and Vigo D. eds. 2014. Vehicle routing: problems, methods, and applications (Vol. 18). Siam.

13- Li F., Golden B., and Wasil E. 2007. A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem, Computers & Operations Research, 34(9): 2734-2742.

14- Karabuk S. 2007. Modeling and optimizing transportation decisions in a manufacturing supply chain, Transportation Research Part E: Logistics and Transportation Review, 43(4): 321-337.

15- Bräysy O., Dullaert W., Hasle G., Mester D., and Gendreau M. 2008. An effective multirestart deterministic annealing metaheuristic for the fleet size and mix vehicle-routing problem with time windows, Transportation Science, 42(3): 371-386.

16- Hoff A., Andersson H., Christiansen M., Hasle G., and Løkketangen A. 2010. Industrial aspects and literature survey: Fleet composition and routing, Computers & Operations Research, 37(12): 2041-2061.

17- Koç Ç., Bektaş T., Jabali O., and Laporte G. 2015. A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows, Computers & Operations Research, 64: 11-27.

18- Bayat A.A. 2014. July. Parallel universes algorithm: A metaheuristic approach to solve vehicle routing problem, In Computing, Communication and Networking Technologies (ICCCNT), 2014 International Conference on (pp. 1-7).

19- Chen C.H., and Ting C.J. 2006. An improved ant colony system algorithm for the vehicle routing problem. Journal of the Chinese institute of industrial engineers 23(2): 115-126.

20- Navidadham M., Arbabsadeghi M., Bayat A.A., and Didehvar F. 2015. Solving generalized vehicle routing problem by parallel universes and Tabu search. 6th International Conference on Computing, Communication and Networking Technologies (ICCCNT), pp. 1-7, IEEE.

21- Bravo J.J., and Vidal C.J. 2013. Freight transportation function in supply chain optimization models: A critical review of recent trends. Expert Systems with Applications, 40(17): 6742-6757.

22- Iran, I.R. of, Statistical Centre of Iran, 2011. Statistical Centre of Iran.

23- Forghani M., and Jafari A. 2013. A New Metaheuristic Algorithm for the Split Delivery Vehicle Fleet Mix Problem with Access Availability, Journal of Commerce Research, 66: 21–48.

24- Blum C., and Roli A. 2003. Metaheuristics in combinatorial optimization: Overview and conceptual comparison, ACM Computing Surveys (CSUR), 35(3): 268-308.

25- Bravo J.J., and Vidal C.J. 2013. Freight transportation function in supply chain optimization models: A critical review of recent trends. Expert Systems with Applications, 40(17): 6742-6757.