Volume 10, Issue 1 (2020)                   ORMR 2020, 10(1): 45-75 | Back to browse issues page

XML Persian Abstract Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

hajian S, Afshar Kazemi M A, seyed hosseini S M, Toloie eshlaghi A. Presenting a stochastic location-inventory-routing model for perishable products with shortage and shipping time. ORMR 2020; 10 (1) :45-75
URL: http://ormr.modares.ac.ir/article-28-38133-en.html
1- Ph.D. Student, Department of Industrial Management, Faculty of Management, Central Tehran Branch, Islamic Azad University, Tehran, Iran
2- Associate Prof., Faculty of Management, Central Tehran Branch, Islamic Azad University, Tehran, Iran. , dr.mafshar@gmail.com
3- Professor, Faculty of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran.
4- Professor, Faculty of Management and Economics, Science and Research Branch, Islamic Azad University, Tehran, Iran.
Abstract:   (3350 Views)
As the importance of supply chain management becomes more evident to the industry owners, the role of cooperation and integration of supply chain different components has become more vivid in creating competitive advantage. This paper proposes a comprehensive mathematical model for location-inventory-routing problem of perishable products given shortage, shipping time, and environmental considerations under uncertainty. To this purpose, an accurate solution was proposed by formulating the problem as non-linear programming of mixed integer using scenario-based stochastic approach. This approach simultaneously minimizes the sum of system costs (the cost of locating centers with certain level of capacity, operational cost of centers, transportation costs, maintaining inventory, and/or shortage of combined center of production/inspection), the sum of maximum time in the chain and emission of pollutants in the whole network. As the problem is NP-hard, a genetic algorithm approach has been proposed to solve the model. For validation, the results of the proposed algorithm in the small size examples were compared to the results of precise solution method. The obtained results revealed the capability of the proposed algorithm in reaching a solution with acceptable percentage difference and in a very shorter time compared to precise solution method. Additionally, the results from algorithm performance were investigated based on standard indicators. The computational results show the efficiency of the proposed model and solution method.
Full-Text [PDF 737 kb]   (1444 Downloads)    
Article Type: Original Research | Subject: Strategy and Management
Received: 2019/11/8 | Accepted: 2020/05/16 | Published: 2020/07/13

Add your comments about this article : Your username or Email:
CAPTCHA

Send email to the article author


Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.