共享电动车电池配送问题研究

doi:10.3969/j.issn.1007-7375.2019.03.007

工业工程 ›› 2019, Vol. 22 ›› Issue (3): 52-56.doi: 10.3969/j.issn.1007-7375.2019.03.007

共享电动车电池配送问题研究

冯春^1,2, 秦冰芳¹, 叶露¹

1. 西南交通大学交通运输与物流学院, 四川成都 610031;
2. 西南交通大学综合交通运输智能化国家地方联合工程实验室, 四川成都 610031

收稿日期:2018-10-27 出版日期:2019-06-30 发布日期:2019-06-27
作者简介:冯春(1970-),男,四川省人,教授,博士,主要研究方向为物流与供应链管理
基金资助:
国家社会科学基金资助项目（17BGL085）

A Research on Distribution Problem of Electric Bicycle-sharing Batteries

FENG Chun^1,2, QIN Bingfang¹, YE Lu¹

1.School of Transportation and Logistics, Southwest Jiaotong University, Chengdu 610031, China;
2. National United Engineering Laboratory of Integrated and Intelligent Transportation, Southwest Jiaotong University, Chengdu 610031, China

Received:2018-10-27 Online:2019-06-30 Published:2019-06-27

摘要/Abstract

摘要： 共享电动车电池的配送方案关系到用户的切身体验和企业利益。为制定最优配送方案，真正打通人们出行的“最后一公里”，本文考虑企业对成本的要求和用户对时效性的要求，以总配送成本最小以及用户满意度最高为目标建立了一个带软时间窗的车辆路径问题模型，利用扫描法和基于最佳路径成本的交叉算子改进了传统遗传算法，用算例验证了模型与改进算法的有效性，并通过数值实验找出了种群大小、迭代次数与最优解之间的相关关系。

关键词: 共享电动车电池配送, 带软时间窗的车辆路径问题, 扫描算法, 遗传算法

Abstract: The distribution plan of electric bicycle-sharing batteries has a great impact on the users' immediate experience and the interests of the company. In order to develop an optimal distribution scheme and truly get through "the last mile" of people's travel, the requirements of enterprises for the distribution cost and the users' requirements for timeliness are considered, and a model of vehicle routing problem with soft time windows with objectives of minimizing the total distribution cost and maximizing user satisfaction is established. Then the traditional genetic algorithm is improved by sweep algorithm and the crossover operator based on the cost of optimal path. Finally, an example is adopted to verify that this model and the improved algorithm are effective. And the correlation between population size, iteration number and optimal solution is found by numerical experiments.

Key words: distribution problem of electric bicycle-sharing batteries, vehicle routing problem with soft time windows, sweep algorithm, genetic algorithm

中图分类号:

TP391.9

冯春, 秦冰芳, 叶露. 共享电动车电池配送问题研究[J]. 工业工程, 2019, 22(3): 52-56.

FENG Chun, QIN Bingfang, YE Lu. A Research on Distribution Problem of Electric Bicycle-sharing Batteries[J]. Industrial Engineering Journal , 2019, 22(3): 52-56.

参考文献

[1] 魏明, 高成修, 胡润洲. 一种带时间窗和容量约束的车辆路线问题及其TabuSearch算法[J]. 运筹与管理, 2002, 11(3):49-54 WEI Ming, GAO Chengxiu, XIU Runzhou. The capacitated vehicle routing problem with time windows and its tabu search meta-heur istic[J]. Operations Research and Management Science, 2002, 11(3):49-54
[2] OMBUKI B, ROSS BJ, HANSHAR F. Multi-objective genetic algorithms for vehicle routing problem with time windows[J]. Applied Intelligence, 2006, 24(1):17-30
[3] 潘立军. 带时间窗车辆路径问题及其算法研究[D]. 长沙:中南大学, 2012. PAN Lijun. Vehicle routing problem with time windows and its algorithms[D]. Changsha:Central South University, 2012.
[4] 邵举平, 曹倩, 沈敏燕. 生鲜农产品配送中带时窗的VRP模型与算法[J]. 工业工程与管理, 2015, 20(1):122-128 SHAO Juping, CAO Qian, SHEN Minyan. Research on multi-objective optimization for fresh agricultural products VRP problem[J]. Industrial Engineering and Management, 2015, 20(1):122-128
[5] ZHOU H, ZHANG L, TAN Y. Adjacent domain renewal intelligent water drops algorithm based soft time window vehicle routing optimization[J]. Computer Engineering & Applications, 2015, 98(25):253-265
[6] CALVETE H I, GALE C, OLIVEROS M J, et al. A goal programming approach to vehicle routing problems with soft time windows[J]. European Journal of Operational Research, 2007, 177(3):1720-1733
[7] QURESHI A G, TANIGUCHI E, YAMADA T. An exact solution approach for vehicle routing and scheduling problems with soft time windows[J]. Transportation Research Part E, 2009, 45(6):960-977
[8] AZI N, GENDREAU M, POTVIN J Y. An exact algorithm for a single-vehicle routing problem with time windows and multiple routes[J]. European Journal of Operational Researeh, 2007, 178:755-766
[9] ERDO?AN G, BATTARRA M, CALVO R W. An exact algorithm for the static rebalancing problem arising in bicycle sharing systems[J]. European Journal of Operational Research, 2015, 245(3):667-679
[10] BEHESHTI A K, HEJAZI S R. A novel hybrid column generation-metaheuristic approach for the vehicle routing problem with general soft time window[J]. Information Sciences, 2015, 316
[11] ROPKE S, CORDEAU J F. Branch and cut and price for the pickup and delivery problem with time windows[J]. Transportation Science, 2009, 43(3):267-286
[12] IQBAL Sumaiya, KAYKOBAD M, RAHMAN M S. Solving the multi-objective vehicle routing problem with soft time windows with the help of bees[J]. Swarm & Evolutionary Computation, 2015, 24:50-64
[13] FIGLIOZZI M A. An iterative route construction and improvement algorithm for the vehicle routing problem with soft time windows[J]. Transp. Res. Part C, 2010, 18:668-679
[14] CHIANG W C, RUSSELL R A. A metaheuristic for the vehicle-routing problem with soft time windows[J]. J. Oper. Res. Soc, 2004, 55:1298-1310
[15] XU Jiuping, YAN Fang, LI Steven. Vehicle routing optimization with soft time windows in a fuzzy random environment[J]. Transportation Researtion, 2011, 47(6):1075-1091
[16] LI P, HE J, ZHENG D, et al. Vehicle routing problem with soft time windows based on improved genetic algorithm for fruits and vegetables distribution[J]. Discrete Dynamics in Nature and Society, 2015(3):1-8
[17] MORRIS G M, GOODSELL D S, HALLIDAY R S. Automated docking using a Lamarckian genetic algorithm and an empirical binding free energy function[J]. Journal of Computational Chemistry, 2015, 19(14):1639-1662
[18] 葛显龙, 谭柏川, 吴宁谦. 基于碳交易机制的带时间窗车辆路径问题与算法研究[J]. 管理工程学报, 2018, 32(4):141-146 GE Xianlong, TAN Baichuan, WU Ningqian. Research on vehicle routing problem and algorithm with time window based on carbon trading mechanism[J]. Jonrnal of Industrial Engineering/Engineering Management, 2018, 32(4):141-146

共享电动车电池配送问题研究

A Research on Distribution Problem of Electric Bicycle-sharing Batteries

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

本文评价

[1]	张正敏, 管在林, 岳磊. 基于Lévy Flight的混合GA在柔性作业车间调度问题中的性能分析[J]. 工业工程, 2021, 24(4): 83-92.
[2]	王晓军, 王博, 晋民杰, 杨春霞, 白新利. 改进多种群遗传算法的AutoStore系统多AGV调度优化[J]. 工业工程, 2021, 24(4): 112-118,167.
[3]	王莹莹, 吴立云. 基于改进NSGA-II的多项目多技能人力资源调度研究[J]. 工业工程, 2021, 24(3): 130-138.
[4]	曾创锋, 刘建军, 陈庆新, 毛宁. 求解一类无关并行机调度的遗传迭代贪心算法[J]. 工业工程, 2021, 24(2): 110-118.
[5]	黄露, 纪延光. 考虑顾客延误损失的配送中心选址双层规划问题研究[J]. 工业工程, 2021, 24(2): 141-147.
[6]	王冰怡, 张锦. 考虑网点共享与变更的多级快递网点选址问题[J]. 工业工程, 2021, 24(2): 155-165.
[7]	马跃如, 文铮, 易丹. 考虑老年人满意度的多目标居家养老护理员路径优化[J]. 工业工程, 2021, 24(1): 74-81,103.
[8]	王玖河, 高辉, 刘欢. 基于遗传算法的共享助力车调度问题研究[J]. 工业工程, 2021, 24(1): 90-96.
[9]	吴斌, 宋琰, 程晶, 董敏. 基于密度峰值聚类的VRPTW问题研究[J]. 工业工程, 2020, 23(5): 58-66,74.
[10]	王苏林, 邱菲尔, 陈凡, 刘川昆, 鹿腾, 王芷芸. 基于贪心遗传的地下物流节点选择规划研究[J]. 工业工程, 2020, 23(5): 88-95.
[11]	侯艳, 黄康焕, 张亿仙, 伍乃骐. 原油一次加工过程的多目标调度优化[J]. 工业工程, 2020, 23(4): 131-139.
[12]	王泽, 杨信丰, 刘兰芬. 考虑电量消耗的车辆调度优化研究[J]. 工业工程, 2020, 23(4): 140-147.
[13]	曾垂飞, 刘建军, 陈庆新, 毛宁. 装配作业车间分批调度问题的算法对比[J]. 工业工程, 2020, 23(4): 174-182.
[14]	张巍, 李鹏翔, 仝自强, 岳毅蒙. 基于损坏车辆分布预测与损益阈值分析下的共享单车回收研究[J]. 工业工程, 2020, 23(3): 132-137.
[15]	张国辉, 胡一凡, 孙靖贺. 改进遗传算法求解多时间约束的柔性作业车间调度问题[J]. 工业工程, 2020, 23(2): 19-25,48.