期刊
COMPUTERS & OPERATIONS RESEARCH
卷 101, 期 -, 页码 183-199出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2018.07.012
关键词
Green vehicle routing; Mixed fleet; Electric vehicles; Pollution routing; Iterated local search
类别
资金
- Canadian Natural Sciences and Engineering Research Council [2015-06189]
This work presents a new variant of the Green Vehicle Routing Problem with time windows. We propose an iterative local search heuristic to optimize the routing of a mixed vehicle fleet, composed of electric and conventional (internal combustion engine) vehicles. Since the batteries of electric vehicles have a limited autonomy of the battery, we consider the possibility of recharging partially at any of the available stations. In addition, we explicitly take into account a limitation on the polluting emissions for the conventional vehicles. The behaviour of the proposed approach is evaluated empirically on a large set of test instances. (C) 2018 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据