A multicut outer-approximation approach for competitive facility location under random utilities

被引:39
作者
Mai, Tien [1 ]
Lodi, Andrea [2 ]
机构
[1] SMART, 1 Create Way, Singapore, Singapore
[2] Ecole Polytech Montreal, Canada Excellence Res Chair Data Sci Real Time De, Dept Math & Ind Engn, Pavillon Andre Aisenstadt,2920 Chemin Tour, Montreal, PQ, Canada
关键词
Facilities planning and design; Maximum capture; Multinomial logit; Mixed multinomial logit; Multicut outer-approximation; MAXIMUM CAPTURE PROBLEM; ALGORITHM;
D O I
10.1016/j.ejor.2020.01.020
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
This work concerns the maximum capture facility location problem with random utilities, i.e., the problem of seeking to locate new facilities in a competitive market such that the captured demand of users is maximized, assuming that each individual chooses among all available facilities according to a random utility maximization model. The main challenge lies in the nonlinearity of the objective function. Motivated by the convexity and separable structure of such an objective function, we propose an enhanced implementation of the outer approximation scheme. Our algorithm works in a cutting plane fashion and allows to separate the objective function into a number of sub-functions and create linear cuts for each sub-function at each outer-approximation iteration. We compare our approach with the state-of-the-art method and, for the first time in an extensive way, with other existing nonlinear solvers using three data sets from recent literature. Our experiments show the robustness of our approach, especially on large instances, in terms of both computing time and number instances solved to optimality. (C) 2020 Elsevier B.V. All rights reserved.
引用
收藏
页码:874 / 881
页数:8
相关论文
共 26 条
[1]  
[Anonymous], 2009, Decision Technologies and Applications
[2]  
[Anonymous], [No title captured]
[3]  
[Anonymous], [No title captured]
[4]   p-Hub approach for the optimal park-and-ride facility location problem [J].
Aros-Vera, Felipe ;
Marianov, Vladimir ;
Mitchell, John E. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2013, 226 (02) :277-285
[5]  
Ben-Akiva ME, 1985, Discrete Choice Analysis. Theory and Application to Travel Demand
[6]   The maximum capture problem with random utilities: Problem formulation and algorithms [J].
Benati, S ;
Hansen, P .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 143 (03) :518-530
[7]   A MULTICUT ALGORITHM FOR 2-STAGE STOCHASTIC LINEAR-PROGRAMS [J].
BIRGE, JR ;
LOUVEAUX, FV .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1988, 34 (03) :384-392
[8]   An algorithmic framework for convex mixed integer nonlinear programs [J].
Bonami, Pierre ;
Biegler, Lorenz T. ;
Conna, Andrew R. ;
Cornuejols, Gerard ;
Grossmann, Ignacio E. ;
Laird, Carl D. ;
Lee, Jon ;
Lodi, Andrea ;
Margot, Francois ;
Sawaya, Nicolas ;
Wachter, Andreas .
DISCRETE OPTIMIZATION, 2008, 5 (02) :186-204
[9]   AN OUTER-APPROXIMATION ALGORITHM FOR A CLASS OF MIXED-INTEGER NONLINEAR PROGRAMS [J].
DURAN, MA ;
GROSSMANN, IE .
MATHEMATICAL PROGRAMMING, 1986, 36 (03) :307-339
[10]   A branch-and-bound algorithm for the maximum capture problem with random utilities [J].
Freire, Alexandre S. ;
Moreno, Eduardo ;
Yushimito, Wilfredo F. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 252 (01) :204-212