Product line pricing for services with capacity constraints and dynamic substitution

被引:23
作者
Burkart, Wolfgang R. [1 ]
Klein, Robert [1 ]
Mayer, Stefan [1 ]
机构
[1] Univ Augsburg, D-86159 Augsburg, Germany
关键词
Pricing; Mixed-integer programming; Branch and bound; Heuristics; NEIGHBORHOOD TABU SEARCH; SELECTION; CONJOINT;
D O I
10.1016/j.ejor.2011.12.026
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
In this paper, we address a service provider's product line pricing problem for substitutable products in services, such as concerts, sporting events, or online advertisements. For each product, a static price is selected from a pre-defined set such that the total revenue is maximised. The products are differentiated by some of their attributes, and their availability is restricted due to individual capacity constraints. Furthermore, they are simultaneously sold during a common selling period at the end of which the service is delivered. Consumers differ from one another with respect to their willingness to pay, and, hence, their reservation prices vary depending on the product. In the event of a purchase, they choose the product that maximises their consumer surplus. Even if the number of consumers, the sequence of their arrival, and their product-specific reservation prices are known, the selection of optimal prices is computationally expensive. Due to capacity constraints, products can be sold out early during the selling period, which causes spill and recapture effects by dynamic substitution. In other words, consumers can switch from their preferred products to other products. To model the resulting choice process and optimise total revenue, we propose a linear mixed-integer program. For the solution of this program, we present a branch and bound procedure as well as several heuristic algorithms and evaluate their performances in computational experiments. (C) 2011 Elsevier B.V. All rights reserved.
引用
收藏
页码:347 / 359
页数:13
相关论文
共 22 条
[1]   Technical note: Mathematical properties of the optimal product line selection problem using choice-based conjoint analysis [J].
Chen, KD ;
Hausman, WH .
MANAGEMENT SCIENCE, 2000, 46 (02) :327-332
[2]   Profitability in product line pricing and composition with manufacturing commonalities [J].
Day, Jamison M. ;
Venkataramanan, M. A. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 175 (03) :1782-1797
[3]   PROBLEMS OF PRODUCT-LINE PRICING [J].
Dean, Joel .
JOURNAL OF MARKETING, 1950, 14 (04) :518-528
[4]   POSITIONING AND PRICING A PRODUCT LINE [J].
DOBSON, G ;
KALISH, S .
MARKETING SCIENCE, 1988, 7 (02) :107-125
[5]   HEURISTICS FOR PRICING AND POSITIONING A PRODUCT-LINE USING CONJOINT AND COST DATA [J].
DOBSON, G ;
KALISH, S .
MANAGEMENT SCIENCE, 1993, 39 (02) :160-175
[6]   Dynamic Pricing and Inventory Control of Substitute Products [J].
Dong, Lingxiu ;
Kouvelis, Panos ;
Tian, Zhongjun .
M&SOM-MANUFACTURING & SERVICE OPERATIONS MANAGEMENT, 2009, 11 (02) :317-339
[7]  
Glover F., 1998, Tabu Search, DOI DOI 10.1007/978-1-4615-6089-0_1
[8]  
Green P. E., 1985, Marketing Sci., V4, P1, DOI [10.1287/mksc.4.1.1, DOI 10.1287/MKSC.4.1.1]
[9]  
Hansen P, 2003, INT SER OPER RES MAN, V57, P145, DOI 10.1007/0-306-48056-5_6
[10]   Optimizing multinomial logit profit functions [J].
Hanson, W ;
Martin, K .
MANAGEMENT SCIENCE, 1996, 42 (07) :992-1003