污染路径问题的一种数学方法
A matheuristic approach for the Pollution-Routing Problem
摘要：
本文讨论污染路径问题（PRP），一种考虑环境因素的车辆路径问题（VRP），最近由Bektas和Laporte（2011），Transport. Res. B-Meth. 45（8），1232-1250]。其目标是尽量减少运营和环境成本，同时尊重能力限制和服务时间窗口。成本是基于司机的工资和燃料消耗，这取决于许多因素，如旅行距离和车辆负载。车辆速度被认为是决策变量。它们补充了路由决策，影响总成本，位置之间的旅行时间，从而影响可行路线的集合。我们提出了一种方法，它结合了一个局部搜索为基础的元启发式整数规划方法的集合覆盖配方和递归速度优化算法。这种混合使得能够更紧密地集成路线和速度决策。此外，其他两个“绿色”VRP的变种，燃料消耗VRP（FCVRP）和能源最小化VRP（EMVRP），解决。所提出的方法相比，非常有利的文献和许多新的改进的解决方案与以前的算法。
英文摘要：
This paper deals with the Pollution-Routing Problem (PRP), a Vehicle Routing Problem (VRP) with environmental considerations, recently introduced in the literature by [Bektas and Laporte (2011), Transport. Res. B-Meth. 45 (8), 1232-1250]. The objective is to minimize operational and environmental costs while respecting capacity constraints and service time windows. Costs are based on driver wages and fuel consumption, which depends on many factors, such as travel distance and vehicle load. The vehicle speeds are considered as decision variables. They complement routing decisions, impacting the total cost, the travel time between locations, and thus the set of feasible routes. We propose a method which combines a local search-based metaheuristic with an integer programming approach over a set covering formulation and a recursive speed-optimization algorithm. This hybridization enables to integrate more tightly route and speed decisions. Moreover, two other "green" VRP variants, the Fuel Consumption VRP (FCVRP) and the Energy Minimizing VRP (EMVRP), are addressed. The proposed method compares very favorably with previous algorithms from the literature and many new improved solutions are reported.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
