基于嵌套Logit选择模型的城市配送自提柜选址路径问题

doi:10.11772/j.issn.1001-9081.2017071883

计算机应用 ›› 2018, Vol. 38 ›› Issue (2): 582-588.DOI: 10.11772/j.issn.1001-9081.2017071883

• 应用前沿、交叉与综合 • 上一篇下一篇

基于嵌套Logit选择模型的城市配送自提柜选址路径问题

邱晗光, 周愉峰

重庆工商大学物流管理系, 重庆 400067

收稿日期:2017-08-04 修回日期:2017-09-27 发布日期:2018-02-10 出版日期:2018-02-10
通讯作者: 邱晗光
作者简介:邱晗光(1982-),男,四川富顺人,副教授,博士,主要研究方向:城市配送、启发式算法;周愉峰(1984-),男,湖南双峰人,副教授,博士,主要研究方向:应急物流与应急管理、物流系统优化与仿真。
基金资助:
国家自然科学基金青年科学基金资助项目（71602014）；重庆市基础科学与前沿技术研究项目（cstc2017jcyjAX0130）；重庆工商大学重点平台开放项目（KFJJ2016029）。

Reception box locating-vehicle routing problems in urban distribution based on nested Logit model

QIU Hanguang, ZHOU Yufeng

Department of Logistics Management, Chongqing Technology and Business University, Chongqing 400067, China

Received:2017-08-04 Revised:2017-09-27 Online:2018-02-10 Published:2018-02-10
Supported by:
This work is partially supported by the National Natural Science Foundation of China (71602014), the Basic and Frontier Research Project of Chongqing (cstc2017jcyjAX0130), the Open Projects of Key platform in CTBU (KFJJ2016029).

摘要/Abstract

摘要： 为了分析城市配送中顾客选择末端交付方式和配送时间窗的相关性对自提柜选址、时间窗分配与路径规划等运营决策的影响，首先使用嵌套Logit选择模型量化顾客对配送服务选项的选择行为，提出了城市配送两层嵌套Logit选择模型；然后以配送数量最大化和配送成本最小化为目标，建立了自提柜选址-时间窗分配-路径规划集成优化模型；最后采用非支配排序、动态网格和拥挤距离等技术，构建了多目标粒子群优化（MOPSO）算法进行仿真分析，获取了末端交付方式和配送时间窗相关性对运营决策的影响。研究表明：随着送货上门服务尺度因子逐渐增大，顾客需求在不同配送时间窗之间的替代性变小，无论是追求配送成本最小化、还是追求配送数量最大化，获取的最优方案均倾向于提高配送准时性，配送数量逐渐上升；相反，随着自提柜服务尺度因子逐渐增大，不同于送货上门服务，获取的最优方案倾向于降低配送准时性，配送数量逐渐下降。

关键词: 城市配送, 嵌套Logit选择模型, 末端交付, 时间窗管理, 自提柜选址, 路径规划

Abstract: In order to analyze the effect of the correlation between the last-mile delivery and time slot existing in the customer choice procedure of urban distribution service on the operational decisions, such as reception box locating, time slot allocating and vehicle routing, a nested Logit model was used to quantify the customer's choice of delivery service options, and a two-tier nested Logit selection model for urban delivery was proposed. Then a multi-objective optimization model integrated with reception box locating, time slot allocating and vehicle routing was constructed in the purpose of maximizing the delivery amount and minimizing the delivery cost. At last, a Multi-Objective Particle Swarm Optimization (MOPSO) algorithm was constructed to solve this model based on non-dominance sorting, adaptive grid and crowding distance sorting. The analysis shows that, as the attended-home-delivery independence parameter is gradually increased, the substitution of customer demand in different time slots is smaller, the optimal solutions tend to improve the delivery punctuality with increasing the delivery amount, whether it is to minimize the cost or to maximize the number of delivery; on the contrary, with the increase of the reception-box independence parameter, the optimal solutions will decrease the delivery punctuality with reducing the delivery amount.

Key words: urban distribution, nested Logit model, last-mile delivery, time slot management, reception box locating, route planning

中图分类号:

TP301.6

邱晗光, 周愉峰. 基于嵌套Logit选择模型的城市配送自提柜选址路径问题[J]. 计算机应用, 2018, 38(2): 582-588.

QIU Hanguang, ZHOU Yufeng. Reception box locating-vehicle routing problems in urban distribution based on nested Logit model[J]. Journal of Computer Applications, 2018, 38(2): 582-588.

参考文献

[1] YANG X, STRAUSSY A K, CURRIEZ C S M, et al. Choice-based demand management and vehicle routing in e-fullment[J]. Transportation Science, 2014, 50(2):473-488.
[2] WANG X, ZHAN L, RUAN J, et al. How to choose "last mile" delivery modes for e-fulfillment[J]. Mathematical Problems in Engineering, 2014, 2014:Article ID 417129.
[3] 张锦,陈义友.物流"最后一公里"问题研究综述[J].中国流通经济,2015(4):23-32. (ZHANG J, CHEN Y Y. The review of research on the "last-mile" in logistics[J]. China Business and Market, 2015(4):23-32.)
[4] 陈淮莉,魏云飞.考虑客户满意度的网络零售配送时隙定价策略[J].计算机工程与应用,2016,52(19):1-6, 106. (CHEN H L, WEI Y F. Pricing strategy of time slot for Internet retailing delivery with considering customer satisfaction[J]. Computer Engineering and Applications, 2016, 52(19):1-6.)
[5] 陈义友,张锦,陈以衡,等.基于顾客有限理性的自提点选址研究[J].工业工程与管理,2015,20(6):92-100. (CHEN Y Y, ZHANG J, CHEN Y H, et al. Research on pickup point location based on customers' bounded rationality[J]. Industrial Engineering and Management, 2015, 20(6):92-100.)
[6] 陈义友,张锦,曾倩,等.基于顾客选择的自提点选址双层规划模型[J].管理学报,2016,13(12):842-1850. (CHEN Y Y, ZHANG J, ZENG Q, et al. Bi-level optimization model for pickup point location under customer choices[J]. Chinese Journal of Management, 2016, 13(12):1842-1850.)
[7] 陈义友,韩珣,曾倩.考虑送货上门影响的自提点多目标选址问题[J].计算机集成制造系统,2016,22(11):2679-2690. (CHEN Y Y, HAN X, ZENG Q. Multi-objective pickup point location problem considering impact of home delivery[J]. Computer Integrated Manufacturing Systems, 2016, 22(11):2679-2690.)
[8] PUNAKIVI M, SARANEN J. Identifying the success factors in e-grocery home delivery[J]. International Journal of Retail & Distribution Management, 2001, 29(4):156-163.
[9] CAMPBELL A M, SAVELSBERGH M W P. Decision support for consumer direct grocery initiatives[J]. Transportation Science, 2005, 39(3):313-327.
[10] AGATZ N, CAMPBELL A, FLEISCHMANN M, et al. Time slot schedule design for e-fulfillment[R]. Rotterdam, Netherlands:Rotterdam School of Management Erasmus University, 2007.
[11] AGATZ N, CAMPBELL A, FLEISCHMANN M, et al. Time slot management in attended home delivery[J]. Transportation Science, 2011, 45(3):435-449.
[12] EHMKE J F, CAMPBELL A M. Customer acceptance mechanisms for home deliveries in metropolitan areas[J]. European Journal of Operational Research, 2014, 233(1):193-207.
[13] CAMPBELL A M, SAVELSBERGH M. Incentive schemes for attended home delivery services[J]. Transportation Science, 2006, 40(3):327-341.
[14] 陈淮莉,汪健.能力预留的网络零售配送时隙分配与定价研究[J].中国科技论文,2016,11(7):765-771. (CHEN H L, WANG J. Allocation and pricing of time slot for Internet retailing with capacity reservation[J]. China Sciencepaper, 2016, 11(7):765-771.)
[15] 许茂增,余国印.城市配送研究的新进展[J].中国流通经济,2014(11):29-36. (XU M Z, YU G Y. Literature review of internal and external research literature on the urban distribution[J]. China Business and Market, 2014(11):29-36.)
[16] NAGY G, SALHI S. Location-routing:Issues, models and methods[J]. European Journal of Operational Research, 2007, 177(2):649-672.
[17] 周林,林云,王旭,等.网购城市配送多容量终端选址与多车型路径集成优化[J].计算机集成制造系统,2016,22(4):1139-1147. (ZHOU L, LIN Y, WANG X, et al. Integrated optimization for multiclass terminal location-heterogeneous vehicle routing of urban distribution under online shopping[J]. Computer Integrated Manufacturing Systems, 2016, 22(4):1139-1147.)
[18] 李中凯,谭建荣,冯毅雄,等.基于拥挤距离排序的多目标粒子群优化算法及其应用[J].计算机集成制造系统,2008,14(7):1329-1336. (LI Z K, TAN J R, FENG Y X, et al. Multi-objective particle swarm optimization algorithm based on crowding distance sorting and its application[J]. Computer Integrated Manufacturing Systems, 2008, 14(7):1329-1336.)
[19] 凌海风,周献中,江勋林,等.改进的约束多目标粒子群算法[J].计算机应用,2012,32(5):1320-1324. (LING H F, ZHOU X Z, JIANG X L, et al. Improved constrained multi-objective particle swarm optimization algorithm[J]. Journal of Computer Applications, 2012, 32(5):1320-1324.)
[20] 陈民铀,张聪誉,罗辞勇.自适应进化多目标粒子群优化算法[J].控制与决策,2009,24(12):1851-1855,1864. (CHEN M Y, ZHANG C Y, LUO C Y. Adaptive evolutionary multi-objective particle swarm optimization algorithm[J]. Control and Decision, 2009, 24(12):1851-1855,1864.)
[21] 吴斌,倪卫红,樊树海.开放式动态网络车辆路径问题的粒子群算法[J].计算机集成制造系统,2009,15(9):1788-1794. (WU B, NI W H, FAN S H. Particle swarm optimization for open vehicle routing problem in dynamic network[J]. Computer Integrated Manufacturing Systems, 2009, 15(9):1788-1794.)

基于嵌套Logit选择模型的城市配送自提柜选址路径问题

Reception box locating-vehicle routing problems in urban distribution based on nested Logit model

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

[1]	田润泽, 周宇龙, 朱洪, 薛岗. 基于局部信息的服务迁移路径选择算法[J]. 《计算机应用》唯一官方网站, 2024, 44(7): 2168-2174.
[2]	马天, 席润韬, 吕佳豪, 曾奕杰, 杨嘉怡, 张杰慧. 基于深度强化学习的移动机器人三维路径规划方法[J]. 《计算机应用》唯一官方网站, 2024, 44(7): 2055-2064.
[3]	李建强, 何舟. 面向多行程取送货车辆路径问题的混合NSGA-Ⅱ[J]. 《计算机应用》唯一官方网站, 2024, 44(4): 1187-1194.
[4]	黄海新, 于广威, 程寿山, 李春明. 基于改进灰狼优化的桥梁检测爬壁机器人全覆盖路径规划[J]. 《计算机应用》唯一官方网站, 2024, 44(3): 966-971.
[5]	邓辅秦, 官桧锋, 谭朝恩, 付兰慧, 王宏民, 林天麟, 张建民. 基于请求与应答通信机制和局部注意力机制的多机器人强化学习路径规划方法[J]. 《计算机应用》唯一官方网站, 2024, 44(2): 432-438.
[6]	宋紫阳, 李军怀, 王怀军, 苏鑫, 于蕾. 基于路径模仿和SAC强化学习的机械臂路径规划算法[J]. 《计算机应用》唯一官方网站, 2024, 44(2): 439-444.
[7]	邓辅秦, 谭朝恩, 黎俊炜, 钟家铭, 付兰慧, 张建民, 王宏民, 李楠楠, 姜炳春, 林天麟. 面向大型仓储环境的基于冲突搜索算法[J]. 《计算机应用》唯一官方网站, 2024, 44(12): 3854-3860.
[8]	孙鉴, 马宝全, 吴隹伟, 杨晓焕, 武涛, 陈攀. 地震场景下无人机群路径规划与任务分配均衡联合优化[J]. 《计算机应用》唯一官方网站, 2024, 44(10): 3232-3239.
[9]	李永迪, 李彩虹, 张耀玉, 张国胜. 基于改进SAC算法的移动机器人路径规划[J]. 《计算机应用》唯一官方网站, 2023, 43(2): 654-660.
[10]	黄霖, 符强, 童楠. 基于自适应调整哈里斯鹰优化算法求解机器人路径规划问题[J]. 《计算机应用》唯一官方网站, 2023, 43(12): 3840-3847.
[11]	王龙宝, 栾茵琪, 徐亮, 曾昕, 张帅, 徐淑芳. 基于动态簇粒子群优化的无人机集群路径规划方法[J]. 《计算机应用》唯一官方网站, 2023, 43(12): 3816-3823.
[12]	刘晨, 陈洋, 符浩. 基于值函数迭代的持续监测无人机路径规划[J]. 《计算机应用》唯一官方网站, 2023, 43(10): 3290-3296.
[13]	范厚明, 牟爽, 岳丽君. 考虑冲突和拥堵的自动导引车调度与路径规划协同优化[J]. 《计算机应用》唯一官方网站, 2022, 42(7): 2281-2291.
[14]	陈昇, 周隽, 胡小兵, 马霁. 基于混合模拟退火算法的机场进场程序优化[J]. 《计算机应用》唯一官方网站, 2022, 42(2): 606-615.
[15]	李开荣, 刘爽, 胡倩倩, 唐亦媛. 基于转角约束的改进蚁群优化算法路径规划[J]. 计算机应用, 2021, 41(9): 2560-2568.