Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge

被引：44

作者：

Wen, Liang ^{[1
]}

Catay, Bulent ^{[2
]}

Eglese, Richard ^{[1
]}

机构：

[1] Univ Lancaster, Sch Management, Dept Management Sci, Lancaster LA1 4YX, England

[2] Sabanci Univ, Fac Engn & Nat Sci, Istanbul, Turkey

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2014年 / 236卷 / 03期

基金：

英国工程与自然科学研究理事会;

关键词：

Heuristic; Minimum cost path; Time-varying; Congestion charge; DYNAMIC NETWORKS; SHORTEST PATHS;

D O I：

10.1016/j.ejor.2013.10.044

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

The minimum cost path problem in a time-varying road network is a complicated problem. The paper proposes two heuristic methods to solve the minimum cost path problem between a pair of nodes with a time-varying road network and a congestion charge. The heuristic methods are compared with an alternative exact method using real traffic information. Also, the heuristic methods are tested in a benchmark dataset and a London road network dataset. The heuristic methods can achieve good solutions in a reasonable running time. (C) 2013 Elsevier B.V. All rights reserved.

引用

页码：915 / 923

页数：9

共 25 条

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

Bektas, Tolga ;

Laporte, Gilbert .

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2011, 45 (08) :1232-1250

[2]

Chabini I, 1998, TRANSPORT RES REC, P170

[3] Multiobjective path finding in stochastic dynamic networks, with application to routing hazardous materials shipments [J].

Chang, TS ;

Nozick, LK ;

Turnquist, MA .

TRANSPORTATION SCIENCE, 2005, 39 (03) :383-399

[4]

Cheung RK, 1998, NAV RES LOG, V45, P769, DOI 10.1002/(SICI)1520-6750(199812)45:8<769::AID-NAV2>3.0.CO

[5]

2-#

[6] SHORTEST ROUTE THROUGH A NETWORK WITH TIME-DEPENDENT INTERNODAL TRANSIT TIMES [J].

COOKE, KL ;

HALSEY, E .

JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1966, 14 (03) :493-&

[7] Road Timetable™ to aid vehicle routing and scheduling [J].

Eglese, R ;

Maden, W ;

Slater, A .

COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (12) :3508-3519

[8]

Eglese R., 2012, GREEN LOGISTICS IMPR, P23

[9]

Erkut E, 2007, HBK OPERAT RES MANAG, V14, P539, DOI 10.1016/S0927-0507(06)14009-8

[10] Expected shortest paths in dynamic and stochastic traffic networks [J].

Fu, LP ;

Rilett, LR .

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1998, 32 (07) :499-516

← 1 2 3 →