The Time Window Vehicle Routing Problem Considering Closed Route

被引：0

作者：

Syahputri, Nenna Irsa ^{[1
]}

Mawengkang, Herman ^{[2
]}

机构：

[1] STTH, Dept Informat Tech, Jl HM Jhoni 70 C, Medan, Indonesia

[2] Univ Sumatera Utara, Dept Math, Medan, Indonesia

来源：

INTERNATIONAL CONFERENCE ON INFORMATION AND COMMUNICATION TECHNOLOGY (ICONICT) | 2017年 / 930卷

关键词：

Vehicle routing problem; closed path; integer programming; feasible neighbourhood search;

D O I：

10.1088/1742-6596/930/1/012048

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

The Vehicle Routing Problem (VRP) determines the optimal set of routes used by a fleet of vehicles to serve a given set of customers on a predefined graph; the objective is to minimize the total travel cost (related to the travel times or distances) and operational cost (related to the number of vehicles used). In this paper we study a variant of the predefined graph: given a weighted graph G and vertices a and b, and given a set X of closed paths in G, find the minimum total travel cost of a-b path P such that no path in X is a subpath of P. Path P is allowed to repeat vertices and edges. We use integer programming model to describe the problem. A feasible neighbourhood approach is proposed to solve the model

引用

页数：6

共 50 条

[1] The Time Window Assignment Vehicle Routing Problem
Spliet, Remy
Gabor, Adriana F.
[J]. TRANSPORTATION SCIENCE, 2015, 49 (04) : 721 - 731
[2] Two-echelon vehicle routing problem with time window considering dynamic degree
Lim, Ming Kim
Wang, Jianxin
Wang, Chao
[J]. Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2022, 28 (06): : 1870 - 1887
[3] The Robust Vehicle Routing Problem with Time Window Assignments
Hoogeboom, Maaike
Adulyasak, Yossiri
Dullaert, Wout
Jaillet, Patrick
[J]. TRANSPORTATION SCIENCE, 2021, 55 (02) : 395 - 413
[4] The discrete time window assignment vehicle routing problem
Spliet, Remy
Desaulniers, Guy
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 244 (02) : 379 - 391
[5] A container vehicle routing problem with soft time window
Zhou, Pengfei
Song, Xiangqun
Guo, Zijian
[J]. IECON 2007: 33RD ANNUAL CONFERENCE OF THE IEEE INDUSTRIAL ELECTRONICS SOCIETY, VOLS 1-3, CONFERENCE PROCEEDINGS, 2007, : 750 - 755
[6] A Dynamic Vehicle Routing Problem with Backhaul and Time Window
Wang, Xuping
Cao, Haiyan
[J]. IEEE/SOLI'2008: PROCEEDINGS OF 2008 IEEE INTERNATIONAL CONFERENCE ON SERVICE OPERATIONS AND LOGISTICS, AND INFORMATICS, VOLS 1 AND 2, 2008, : 1256 - 1261
[7] Solving Vehicle Routing Problem with Time Window Constraints
Chen, J. C.
Chiang, C. S.
Chen, B. B.
Chen, C. W.
[J]. 2007 INTERNATIONAL CONFERENCE ON SERVICE SYSTEMS AND SERVICE MANAGEMENT, VOLS 1-3, 2007, : 934 - +
[8] Vehicle routing problem with drones considering time windows
Kuo, R. J.
Lu, Shih-Hao
Lai, Pei-Yu
Mara, Setyo Tri Windras
[J]. EXPERT SYSTEMS WITH APPLICATIONS, 2022, 191
[9] Vehicle routing problem with drones considering time windows
Kuo, R.J.
Lu, Shih-Hao
Lai, Pei-Yu
Mara, Setyo Tri Windras
[J]. Expert Systems with Applications, 2022, 191
[10] A parallel algorithm for the vehicle routing problem with time window constraints
Schulze, J
Fahle, T
[J]. ANNALS OF OPERATIONS RESEARCH, 1999, 86 (0) : 585 - 607

← 1 2 3 4 5 →