面向最小碳排放量的接送机场服务的车辆路径与调度

Minimizing Carbon Emissions for Vehicle Routing and Scheduling in Picking up and Delivering Customers to Airport Service

车辆路径与调度问题(Vehicle routing and scheduling problem,VRSP)是制造系统自动化和商业服务系统优化调度要解决的重要问题,常常以路径最短或成本(时间)最小为优化目标.在强制性碳排放政策的影响下,如何通过路径优化与调度实现系统的节能减排,已经成为管理者一个优化控制的目标.本文建立了针对接送机场服务中以最小碳排放量为目标的车次分配与调度问题的0-1混合整数规划模型,采用了改进的基于时间和地域划分的极线扫描算法.重点通过不同类型、规模测试实例,分别从测试实例的顾客点位置分布、顾客规模以及车辆容量大小、满意度水平分析了对人均碳排放的影响程度,对现实接送机场服务运作中车辆配置和设置服务水平提供了有价值的建议.

Vehicle routing and scheduling problem （VRSP） is the important problem in manufacturing systems automation and business services, which often aims at the shortest path or the minimal cost for the optimization and management objectives. Under the mandatory carbon emissions policy, there is another important objective for the managers to reduce carbon emissions by optimizing the transport paths of the logistics. In this paper, a 0-1 mixed integer programming model is proposed to minimize carbon emissions for the airport shuttle service. An improved NPFDS algorithm with the partition from both time and geographical is proposed. Using different type and size test cases, this paper analyzes the fuel consumption per person that is from four respective dimensions, which are the customer position distribution, the customer scale, the vehicle capacity and the customer satisfaction degree. Some conclusions and references for the airport shuttle service configuration and service degree setting are also obtained.