An adaptive large neighborhood search heuristic for the Pollution-Routing Problem

被引：532

作者：

Demir, Emrah ^{[1
,2
]}

Bektas, Tolga ^{[1
,2
]}

Laporte, Gilbert ^{[3
,4
]}

机构：

[1] Univ Southampton, Sch Management, Southampton SO17 1BJ, Highfield, England

[2] Univ Southampton, CORMSIS, Southampton SO17 1BJ, Highfield, England

[3] HEC Montreal, Canada Res Chair Distribut Management, Montreal, PQ H3T 2A7, Canada

[4] HEC Montreal, Interuniv Res Ctr Enterprise Networks Logist & Tr, Montreal, PQ H3T 2A7, Canada

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2012年 / 223卷 / 02期

基金：

加拿大自然科学与工程研究理事会;

关键词：

Vehicle routing; Fuel consumption; CO2; emissions; Freight transportation; Heuristic algorithm;

D O I：

10.1016/j.ejor.2012.06.044

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

The Pollution-Routing Problem (PRP) is a recently introduced extension of the classical Vehicle Routing Problem with Time Windows which consists of routing a number of vehicles to serve a set of customers, and determining their speed on each route segment so as to minimize a function comprising fuel, emission and driver costs. This paper presents an adaptive large neighborhood search for the PRP. Results of extensive computational experimentation confirm the efficiency of the algorithm. (C) 2012 Elsevier B.V. All rights reserved.

引用

页码：346 / 359

页数：14

共 19 条

[1]

Barth M., 2005, ORAL HLTH STATUS ORA

[2]

Barth M., 2008, Transportation Research Record: Journal of the Transportation Research Board, P163, DOI DOI 10.3141/2058-20

[3] The Pollution-Routing Problem [J].