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

共 6 条

[1]

Ahmed M., 2009, SHORTEST PATHS AVOID, P63

[2] Solving the Asymmetric Travelling Salesman Problem with time windows by branch-and-cut [J].

Ascheuer, N ;

Fischetti, M ;

Grötschel, M .

MATHEMATICAL PROGRAMMING, 2001, 90 (03) :475-506

[3] THE TRUCK DISPATCHING PROBLEM [J].

DANTZIG, GB ;

RAMSER, JH .

MANAGEMENT SCIENCE, 1959, 6 (01) :80-91

[4] Finding paths in graphs avoiding forbidden transitions [J].

Szeider, S .

DISCRETE APPLIED MATHEMATICS, 2003, 126 (2-3) :261-273

[5]

Toth P, 2014, MOS-SIAM SER OPTIMIZ, P1

[6] The shortest path problem with forbidden paths [J].

Villeneuve, D ;

Desaulniers, G .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 165 (01) :97-107

← 1 →