Fix-and-Relax based heuristic approach for robust two-echelon vehicle routing problem for milk collection: A case study

被引:1
作者
Amghani, Seyedjavad Molavi [1 ]
Asadi-Gangraj, Ebrahim [1 ]
Divsalar, Ali [1 ]
机构
[1] Babol Noshirvani Univ Technol, Dept Ind Engn, Babol, Iran
关键词
Vehicle routing problem; Two-echelon milk collection; Weighted-additive fuzzy goal programming; Fix-and-Relax based heuristic; Uncertainty; PERISHABLE PRODUCT; SCHEDULING PROBLEM; ALGORITHM; MANAGEMENT; ALLOCATION; MODELS; SYSTEM;
D O I
10.1016/j.eswa.2024.125467
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Nowadays, several tons of milk in the collection network are being spoiled and discarded before reaching the collection centers or the milk factory due to a lack of proper planning. This issue incurs significant costs in the milk collection network, emphasizing the importance of efficient milk collection networks at various levels. This paper discusses the routing of milk collection vehicles from farms to factories. The study examines various levels, including milk production farms, milk collection centers, and factories. To address this, a bi-objective mixed integer programming model is proposed with the objective of minimizing transportation costs and earlinesstardiness times. The proposed model is validated using data from a real case study of the milk collection network in Torbat Jam, Iran. To solve the bi-objective model, the weighted-additive fuzzy goal programming (WFGP) approach is employed. Due to the NP-hardness of the research problem, a heuristic solution method based on the Fix-and-Relax approach is developed to solve large-size problems. Additionally, the Bertsymas and Sim approach is applied to address uncertainty in the travel time parameter. Furthermore, a sensitivity analysis is conducted on the important parameters of the proposed model. The results demonstrate that the heuristic solution method can provide optimal or near-optimal solutions within a reasonable time frame. Moreover, the robust bi-objective optimization model can effectively schedule milk collection with low costs.
引用
收藏
页数:14
相关论文
共 55 条
[1]   Flexible flow shop scheduling problem to minimize makespan with renewable resources [J].
Abbaszadeh, N. ;
Asadi-Gangraj, E. ;
Emami, S. .
SCIENTIA IRANICA, 2021, 28 (03) :1853-1870
[2]   A heuristic approach for big bucket multi-level production planning problems [J].
Akartunali, Kerem ;
Miller, Andrew J. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 193 (02) :396-411
[3]   Quality, safety and sustainability in food distribution: a review of quantitative operations management approaches and challenges [J].
Akkerman, Renzo ;
Farahani, Poorya ;
Grunow, Martin .
OR SPECTRUM, 2010, 32 (04) :863-904
[4]   Benders decomposition for the inventory vehicle routing problem with perishable products and environmental costs [J].
Alkaabneh, Faisal ;
Diabat, Ali ;
Gao, Huaizhu Oliver .
COMPUTERS & OPERATIONS RESEARCH, 2020, 113
[5]   Spatial decision support system for the route management for milk collection from dairy farms [J].
Amiama, C. ;
Pereira, J. M. ;
Carpente, L. ;
Salgado, J. .
TRANSPORTATION LETTERS-THE INTERNATIONAL JOURNAL OF TRANSPORTATION RESEARCH, 2015, 7 (05) :279-288
[6]   The impact of food perishability issues in the vehicle routing problem [J].
Amorim, P. ;
Almada-Lobo, B. .
COMPUTERS & INDUSTRIAL ENGINEERING, 2014, 67 :223-233
[7]   A genetic algorithm-Taguchi based approach to inventory routing problem of a single perishable product with transshipment [J].
Azadeh, A. ;
Elahi, S. ;
Farahani, M. Hosseinabadi ;
Nasirian, B. .
COMPUTERS & INDUSTRIAL ENGINEERING, 2017, 104 :124-133
[8]  
Azar A., 2011, Journal of Teacher of Humanities-Management Research in Iran, V15, P1
[9]  
Babaee Tirkolaee E., 2019, Journal of industrial engineering and management studies, V6, P196, DOI DOI 10.22116/JIEMS.2019.94158
[10]   The price of robustness [J].
Bertsimas, D ;
Sim, M .
OPERATIONS RESEARCH, 2004, 52 (01) :35-53