Fleet-sizing and service availability for a vehicle rental system via closed queueing networks

被引:184
作者
George, David K. [1 ]
Xia, Cathy H. [1 ]
机构
[1] Ohio State Univ, Dept Integrated Syst Engn, Columbus, OH 43201 USA
关键词
Transportation; Vehicle rental systems; Queueing networks; Fleet-sizing; Availability; DYNAMIC-PROGRAMMING ALGORITHM; COMPUTATIONAL ALGORITHMS; MANAGEMENT; MODEL; REDISTRIBUTION;
D O I
10.1016/j.ejor.2010.12.015
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
In this paper, we address the problem of determining the optimal fleet size for a vehicle rental company and derive analytical results for its relationship to vehicle availability at each rental station in the company's network of locations. This work is motivated by the recent surge in interest for bicycle and electric car sharing systems, one example being the French program Velib (2010). We first formulate a closed queueing network model of the system, obtained by viewing the system from the vehicle's perspective. Using this framework, we are able to derive the asymptotic behavior of vehicle availability at an arbitrary rental station with respect to fleet size. These results allow us to analyze imbalances in the system and propose some basic principles for the design of system balancing methods. We then develop a profit-maximizing optimization problem for determining optimal fleet size. The large-scale nature of real-world systems results in computational difficulties in obtaining this exact solution, and so we provide an approximate formulation that is easier to solve and which becomes exact as the fleet size becomes large. To illustrate our findings and validate our solution methods, we provide numerical results on some sample networks. (C) 2010 Elsevier B.V. All rights reserved.
引用
收藏
页码:198 / 207
页数:10
相关论文
共 36 条
[1]   Price-directed control of a closed logistics queueing network [J].
Adelman, Daniel .
OPERATIONS RESEARCH, 2007, 55 (06) :1022-1038
[2]   On optimal call admission control in a resource-sharing system [J].
Altman, E ;
Jiménez, T ;
Koole, G .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2001, 49 (09) :1659-1668
[3]  
[Anonymous], INT C STOCH CONTR OP
[4]  
[Anonymous], THESIS PURDUE U
[5]  
BARNHART C, 2007, HDB OPERATIONS RES M, V14, P285
[6]   OPEN, CLOSED, AND MIXED NETWORKS OF QUEUES WITH DIFFERENT CLASSES OF CUSTOMERS [J].
BASKETT, F ;
CHANDY, KM ;
MUNTZ, RR ;
PALACIOS, FG .
JOURNAL OF THE ACM, 1975, 22 (02) :248-260
[7]   A MODEL FOR FLEET SIZING AND VEHICLE ALLOCATION [J].
BEAUJON, GJ ;
TURNQUIST, MA .
TRANSPORTATION SCIENCE, 1991, 25 (01) :19-45
[8]   COMPUTATIONAL ALGORITHMS FOR CLOSED QUEUING NETWORKS WITH EXPONENTIAL SERVERS [J].
BUZEN, JP .
COMMUNICATIONS OF THE ACM, 1973, 16 (09) :527-531
[9]   COMPUTATIONAL ALGORITHMS FOR PRODUCT FORM QUEUING-NETWORKS [J].
CHANDY, KM ;
SAUER, CH .
COMMUNICATIONS OF THE ACM, 1980, 23 (10) :573-583
[10]  
Crainic TG, 1998, FLEET MANAGEMENT AND LOGISTICS, P205