车辆路径问题
数学优化
线性化
电动汽车
非线性系统
布线(电子设计自动化)
计算机科学
线性规划
非线性规划
功能(生物学)
整数规划
数学
功率(物理)
生物
进化生物学
物理
量子力学
计算机网络
作者
Xiaorong Zuo,Yiyong Xiao,Meng You,Ikou Kaku,Yuchun Xu
标识
DOI:10.1016/j.jclepro.2019.117687
摘要
The electric vehicle routing problem with time window (EVRPTW) is an extension of the traditional vehicle routing problem with time window (VRPTW), where new features of electric vehicles are considered, such as limited battery capacities, lack of infrastructures, and long charging time. In this study, new technical formulations were presented for vehicle route selection and charging station visit, which reduces the formulation complexity without using duplicated dummy nodes or arcs. Besides, a new linearization method was developed that employs a set of secant lines to surrogate the concave nonlinear charging function with linear constraints. This method defines the charging time as a continuous variable and uses fewer variables than existing formulation in literature. A mixed-integer linear programming (MILP) model was developed for the EVRPTW and computational experiments on Solomon's VRPTW instances were conducted to verify the proposed model. The experimental results were compared with those obtained by traditional routing models, which showed that the proposed model can result in better EVs logistics schedules with higher charging time utilizations.
科研通智能强力驱动
Strongly Powered by AbleSci AI