Multi-objective Model of Distribution Route Problem for Fresh Electricity Commerce under Uncertain Demand

doi:10.16182/j.issn1004731x.joss.17-0376

Abstract

Abstract: Considering the distribution cost, freshness of fresh products, carbon emissions and customer demand uncertainty and other factors, a multi-objective optimization model of distribution path planning is established. Based on the robust optimization method for dealing with uncertain problems, the multi-objective model of distribution routing planning is optimized for the situation that the discrete demand belongs to the uncertainty set of ellipsoid. The model is solved by using the main target method and fruit fly algorithm. It is proved that the model and algorithm are robust and can effectively suppress the disturbance caused by the uncertainty of the demand. This paper provides an important theoretical basis and practical ideas for improving the distribution route planning model and distribution network optimization method.

Key words: vehicle routing problem, uncertain demand, fresh electronic commerce, robust optimization, fruit fly optimization algorithm

CLC Number:

TP391.9

Zhang Qian, Xiong Ying, He Mingke, Zhang Hao. Multi-objective Model of Distribution Route Problem for Fresh Electricity Commerce under Uncertain Demand[J]. Journal of System Simulation, 2019, 31(8): 1582-1590.

References

[1] Vahdani B, Niaki S T A, Aslanzade S. Production-Inventory-Routing Coordination with Capacity and Time Window Constraints for Perishable Products: Heuristic and Meta-heuristic Algorithms[J]. Journal of Cleaner Production (S0959-6526), 2017, 161: 598-618.
[2] Belofilho M A F, Amorim P, Almadalobo B. An Adaptive Large Neighbourhood Search for The Operational Integrated Production and Distribution Problem of Perishable Products[J]. International Journal of Production Research (S00207543), 2015, 53(20): 1-19.
[3] Coelho L C, Laporte G. Optimal Joint Replenishment, Delivery and Inventory Management Policies for Perishable Products[J]. Computers & Operations Research (S0305-0548), 2014, 47(7): 42-52.
[4] Hiassat A, Diabat A, Rahwan I.A Genetic Algorithm Approach for Location-Inventory-Routing Problem with Perishable Products[J]. Journal of Manufacturing Systems (S0278-6125), 2017, 42: 93-103.
[5] Song B D, Ko Y D.A Vehicle Routing Problem of Both Refrigerated- and General-type Vehicles for Perishable Food Products Delivery[J]. Journal of Food Engineering (S0260-8774), 2016, 169: 61-71.
[6] Govindan K, Jafarian A, Khodaverdi R, et al.Two-Echelon Multiple-Vehicle Location-Routing Problem with Time Windows for Optimization of Sustainable Supply Chain Network of Perishable Food[J]. International Journal of Production Economics (S0925-5273), 2014, 152(2): 9-28.
[7] Zhang H, Zhu L, Xu S.Modeling the City Distribution System Reliability with Bayesian Networks to Identify Influence Factors[J]. Scientific Programming (S1058-9244), 2016(23): 1-9.
[8] 马向国, 刘同娟, 杨平哲, 等. 基于随机需求的冷链物流车辆路径优化模型[J]. 系统仿真学报, 2016, 28(8): 1824-1832,1840.
Ma Xiangguo, Liu Tongjuan, Yang Pingzhe, et al.Vehicle Routing Optimization Model of Cold Chain Logistics Based on Stochastic Demand[J]. Journal of System Simulation, 2016, 28(8): 1824-1832,1840.
[9] 李锋, 魏莹. 易腐货物配送中时变车辆路径问题的优化算法[J]. 系统工程学报, 2010(4): 492-498+519.
Li Feng, Wei Ying. Time-dependent Vehicle Routing Algorithm for Perishable Goods Delivery[J]. Journal of Systems Engineering, 2010 (4): 492-498+519.
[10] 闫妍, 刘晓, 庄新田, 等. 基于弹性供应链的易腐品物流配送计划[J]. 系统管理学报, 2012(2): 258-263.
Yan Yan, Liu Xiao, Zhuang Xintian, et al.Distribution Plan of Perishable Products with Resilient Supply Chain[J]. Journal of Systems & Management, 2012 (2): 258-263.
[11] Bental A, Hazan E, Koren T, et al.Oracle-Based Robust Optimization via Online Learning[J]. Operations Research (S1109-2858), 2014, 63: 628-638.
[12] Melamed M, Ben-Tal A, Golany B.On the Average Performance of the Adjustable RO and Its Use as An Offline Tool for Multi-period Production Panning Under Uncertainty[J]. Computational Management Science (S1619-697X), 2016, 13(2): 1-23.
[13] Zhang H, Xiong Y, He M K, et al.Location Model for Distribution Centers for Fulfilling Electronic Orders of Fresh Foods under Uncertain Demand[J]. Scientific Programming (S1058-9244), 2017: Article ID 3423562, 13 pages, 2017.
[14] Ghodratnama A, Tavakkoli-Moghaddam R, Azaron A.Robust and Fuzzy Goal Programming Optimization Approaches for a Novel Multi-Objective Hub Location-Allocation Problem: A Supply Chain Overview[J]. Applied Soft Computing (S1568-4946), 2015, 37(C): 255-276.
[15] Boukani F H.Robust Optimization Approach to Capacitated Single and Multiple Allocation Hub Location Problems[J]. Computational and Applied Mathematics (S0101-8205), 2016, 35(1): 45-60.
[16] 张建, 傅少川. 新鲜度影响需求的生鲜食品配送中心选址研究[J]. 中国管理科学, 2011, 19(10): 473-476.
Zhang Jian, Fu Shaochuan.Study on Location of Fresh Food Distribution Center with Demand Influenced by the Freshness[J]. Chinese Journal of Management Science, 2011, 19(10): 473-476.
[17] 吴丽荣, 胡祥培, 饶卫振. 考虑燃料消耗率的车辆路径问题模型与求解[J]. 系统工程学报, 2013(6): 804-811.
Wu Lirong, Hu Xiangpei, Rao Weizhen.Vehicle Routing Problem Model Considering Fuel Consumption Rate and Solution[J]. Journal of Systems Engineering, 2013 (6): 804-811.
[18] Wen-Tsao Pan.A New Fruit Fly Optimization Algorithm: Taking the Financial Distress Model as An Example[J]. Knowledge-Based Systems (S0950-7051), 2011, 26: 69-74.
[19] 吴小文, 李擎. 果蝇算法和5种群智能算法的寻优性能研究[J]. 火力与指挥控制, 2013(4): 17-20,25.
Wu Xiaowen, Li Qing.Research of Optimizing Performance of Fruit Fly Optimization Algorithm and Five Kinds of Intelligent Algorithm[J]. Fire Control & Command Control, 2013 (4): 17-20,25.
[20] 郑晓龙, 王凌. 随机资源约束项目调度问题基于序的果蝇算法[J]. 控制理论与应用, 2015(4): 540.
Zhen Xiaolong, Wang Ling.An Order-Based Fruit Fly Optimization Algorithm for Stochastic Resource- Constrained Project Scheduling[J]. Control Theory & Appliications, 2015 (4): 540.
[21] 毛正阳, 方群, 李克行, 等. 应用改进果蝇优化算法的月面巡视器路径规划[J]. 中国空间科学技术, 2014(5): 87-93.
Mao Zhengyang, Fang Qun, Li Kexing, et al.Path Panning for Lunar Rover Based on Modified Fruit Fly Optimization Algorithm[J]. Chinese Space Science and Technology, 2014 (5): 87-93.