具有速度Optimization和不均匀地形的污染路由问题
The Pollution-Routing Problem with Speed Optimization and Uneven Topography
摘要:
本文考虑了联合污染路由和速度最优化问题(PRP-SO),其中燃料成本和$\textit{CO}_2e$排放取决于车辆速度,弧有效载荷,和道路等级。我们提出了两种方法,一个近似和一个精确的,解决PRP-SO。近似策略解决了大规模的情况下,问题的禁忌搜索为基础的元启发式加上一个有效的固定顺序的速度优化算法。第二种策略包括一个量身定制的分支和价格(BP)算法,其中速度优化管理的定价问题。我们测试这两种方法修改所罗门基准和新构建的现实生活中的实例集。我们的BP算法解决了最多50个客户的大多数实例,以及75和100个客户的许多实例。该启发式算法能够找到所有实例的近最优解,并且每个实例的计算时间不到小于分钟。在现实世界的情况下,结果提出了一些管理见解。首先,当明确考虑弧有效载荷和道路坡度时,实现了高达53%的燃料节省。其次,通过安排上坡客户沿路线晚点,也实现了燃油节省和排放减少。最后,我们表明,忽略海拔信息时,规划路线导致高度不准确的燃料消耗估计。
英文摘要:
This paper considers a joint pollution-routing and speed optimization problem (PRP-SO) where fuel costs and $\textit{CO}_2e$ emissions depend on the vehicle speed, arc payloads, and road grades. We present two methods, one approximate and one exact, for solving the PRP-SO. The approximate strategy solves large-scale instances of the problem with a tabu search-based metaheuristic coupled with an efficient fixed-sequence speed optimization algorithm. The second strategy consists of a tailored branch-and-price (BP) algorithm in which speed optimization is managed within the pricing problem. We test both methods on modified Solomon benchmarks and newly constructed real-life instance sets. Our BP algorithm solves most instances with up to 50 customers and many instances with 75 and 100 customers. The heuristic is able to find near-optimal solutions to all instances and requires less than one minute of computational time per instance. Results on real-world instances suggest several managerial insights. First, fuel savings of up to 53\% are realized when explicitly taking into account arc payloads and road grades. Second, fuel savings and emissions reduction are also achieved by scheduling uphill customers later along the routes. Lastly, we show that ignoring elevation information when planning routes leads to highly inaccurate fuel consumption estimates.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。