Vehicle routing problem with fuzzy time windows

被引:85
作者
Tang, Jiafu [1 ]
Pan, Zhendong [1 ]
Fung, Richard Y. K. [2 ]
Lau, Henry [3 ]
机构
[1] Northeastern Univ, Dept Syst Engn, Key Lab Integrated Automat Proc Ind MOE, Shenyang 110004, Peoples R China
[2] City Univ Hong Kong, Dept Mfg Engn & Engn Management, Kowloon, Hong Kong, Peoples R China
[3] Hong Kong Polytech Univ, Dept Ind & Syst Engn, Kowloon, Hong Kong, Peoples R China
关键词
Vehicle routing problem (VRP); Time windows; Service level; Fuzzy constraints; Multi-objective programming; SCHEDULING PROBLEMS; ROUTEING PROBLEM; ALGORITHM;
D O I
10.1016/j.fss.2008.09.016
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this paper, a vehicle routing problem with fuzzy time windows (VRPFTW) is proposed and solved. In the transportation business, time windows are not always strictly obeyed and the deviation of service time from the customer-specific time window determines the customer's satisfaction level, which can also be regarded as the Supplier's service level. This paper applies fuzzy membership functions to characterize the service level issues associated with time window violation in a vehicle routing problem and propose VRPFTW. VRPFTW is formulated as a multi-objective model with two goals: (I) to minimize the travel distance and (2) to maximize the service level of the supplier to customers. To solve this multi-objective model, a two stage algorithm is developed to obtain a Pareto solution for VRPFTW. Using the two-stage algorithm, VRPFTW is decomposed into two subproblems, namely a traditional vehicle routing problem with time windows (VRPTW-alpha) and a service improvement problem,and each of the objective, is sequentially solved. The service improvement problem is solved under two different scenarios. When the fuzzy membership function is linear, it is shown that the service improvement problem can be solved by the cutting plane algorithm within finite iterations, and when the fuzzy membership function is concave, the service improvement problem can be solved by a subgradient-based algorithm. Moreover, an alternative formulation of VRPFTW is also proposed and analyzed. Experiments are conducted to compare different models of vehicle routing problems with time windows in situations where violation of time windows is allowed, and the results show that the VRPFTW model can achieve considerable cost-savings, while at the same time maintaining an acceptable service level. Published by Elsevier B.V.
引用
收藏
页码:683 / 695
页数:13
相关论文
共 15 条
[1]  
BALAKRISHNAN N, 1993, J OPER RES SOC, V44, P279
[2]   A goal programming approach to vehicle routing problems with soft time windows [J].
Calvete, Herminia I. ;
Gale, Carmen ;
Oliveros, Maria-Jose ;
Sanchez-Valverde, Belen .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 177 (03) :1720-1733
[3]   A metaheuristic for the vehicle-routeing problem with soft time windows [J].
Chiang, WC ;
Russell, RA .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2004, 55 (12) :1298-1310
[4]   Integrating purchasing and routing in a propane gas supply chain [J].
Chiang, WC ;
Russell, RA .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 154 (03) :710-729
[5]   A NEW OPTIMIZATION ALGORITHM FOR THE VEHICLE-ROUTING PROBLEM WITH TIME WINDOWS [J].
DESROCHERS, M ;
DESROSIERS, J ;
SOLOMON, M .
OPERATIONS RESEARCH, 1992, 40 (02) :342-354
[6]  
Desrosiers J., 1995, Handbooks Oper. Res. Management Sci., V8, P35
[7]   VEHICLES SCHEDULING WITH SLIDING TIME WINDOWS [J].
FERLAND, JA ;
FORTIN, L .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1989, 38 (02) :213-226
[8]  
RUSZCZYNSKI A, 2006, NONLINEAR OPTIMIZATI, P357
[9]  
SAVELSBERGH M, 1986, ANN OPER RES, V4, P285
[10]  
Sexton T. R., 1986, American Journal of Mathematical and Management Sciences, V6, P369