A chance constrained programming approach for uncertain p-hub center location problem. (December 2016)

• Record Type: Journal Article
• Authors: Gao, Yuan; Qin, Zhongfeng
• Is Part Of: Computers & industrial engineering. Volume 102(2016)
• Page Start: 10
• Page End: 20
• Publication Date: 2016-12
• Subjects: Uncertainty modelling -- p-hub center location problem -- Uncertain variable -- Uncertain measure -- Chance-constrained programming; Engineering -- Data processing -- Periodicals; Industrial engineering -- Periodicals; 620.00285
• DOI: 10.1016/j.cie.2016.09.017
• Languages: English
• ISSNs: 0360-8352

Abstract

Highlights: We first investigate the p -hub center problem with subjective imprecision. We formulate a chance constrained programming model for uncertain p -hub center location problem. We give the analytical forms of the proposed model base on uncertainty theory. We present principle of nearby and design a hybrid intelligent algorithm to solve the uncertain p -hub center models. Abstract: The p -hub center location problem aims to locate p hubs and allocate other nodes to these hub nodes in order to minimize the maximal travel time. It is more important for time-sensitive distribution systems. Due to the presence of uncertainty, more researches are recently focused on the problem in non-deterministic environment. This paper joins the research stream by considering travel times as uncertain variables instead of random variables or fuzzy ones. The goal is to model the p -hub center problem based on experts' subjective belief in the case of lack of data. The uncertain distribution of the maximal travel time is first derived and then a chance constrained programming model is formulated. The deterministic equivalent forms are further given when the information of uncertainty distributions is provided. A hybrid intelligent algorithm is designed to solve the proposed models and numerical examples are presented to illustrate the application of this approach and the effectiveness of the algorithm.