Planning and approximation models for delivery route based services with price-sensitive demands

被引:13
作者
Geunes, Joseph
Shen, Zuo-Jun Max
Emir, Akin
机构
[1] Univ Calif Berkeley, Dept Ind Engn & Operat Res, Berkeley, CA 94720 USA
[2] Univ Florida, Dept Ind & Syst Engn, Gainesville, FL 32611 USA
[3] Merck & Co Inc, West Point, PA USA
关键词
revenue management; pricing; vehicle routing problem;
D O I
10.1016/j.ejor.2006.07.010
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Classical vehicle routing problems typically do not consider the impact of delivery price on the demand for delivery services. Existing models seek the minimum sum of tour lengths in order to serve the demands of a given set of customers. This paper proposes approximation models to estimate the impacts of price on delivery services when demand for delivery service is price dependent. Such models can serve as useful tools in the planning phase for delivery service providers and can assist in understanding the economics of delivery services. These models seek to maximize profit from delivery service, where price determines demand for deliveries as well as the total revenue generated by satisfying demand. We consider a variant of the model in which each customer's delivery volume is price sensitive, as well as the case in which customer delivery volumes are fixed, but the total number of customers who select the delivery service provider is price sensitive. A third model variant allows the delivery service provider to select a subset of delivery requests at the offered price in order to maximize profit. (c) 2006 Elsevier B.V. All rights reserved.
引用
收藏
页码:460 / 471
页数:12
相关论文
共 34 条
[1]  
AGARWAL R, 2004, HDB SCHEDULING ALGOR, pCH49
[2]  
Ahuja RK, 1993, NETWORK FLOWS THEORY
[3]  
[Anonymous], P CAMB PHILO SOC, DOI DOI 10.1017/S0305004100034095
[4]  
Balakrishnan A., 2000, Manufacturing & Service Operations Management, V2, P297, DOI 10.1287/msom.2.3.297.12347
[5]   Economic lot size model for price-dependent demand under quantity and freight discounts [J].
Burwell, TH ;
Dave, DS ;
Fitzpatrick, KE ;
Roy, MR .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 1997, 48 (02) :141-155
[6]   OPERATIONAL ESTIMATORS FOR THE LENGTH OF A TRAVELING SALESMAN TOUR [J].
CHIEN, TW .
COMPUTERS & OPERATIONS RESEARCH, 1992, 19 (06) :469-478
[7]  
Christofides N., 1979, Combinatorial optimization, P315
[8]   SCHEDULING OF VEHICLES FROM CENTRAL DEPOT TO NUMBER OF DELIVERY POINTS [J].
CLARKE, G ;
WRIGHT, JW .
OPERATIONS RESEARCH, 1964, 12 (04) :568-&
[9]  
Daganzo C., 1999, LOGISTICS SYSTEMS AN, VThird
[10]   THE LENGTH OF TOURS IN ZONES OF DIFFERENT SHAPES [J].
DAGANZO, CF .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1984, 18 (02) :135-145