Publication Type

Journal Article

Version

publishedVersion

Publication Date

8-2020

Abstract

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.

Keywords

Facilities planning and design, Maximum capture, Multinomial logit, Mixed multinomial logit, Multicut outer-approximation

Discipline

Artificial Intelligence and Robotics | OS and Networks

Research Areas

Intelligent Systems and Optimization

Publication

European Journal of Operational Research

Volume

284

Issue

3

First Page

874

Last Page

881

ISSN

0377-2217

Identifier

10.1016/j.ejor.2020.01.020

Publisher

Elsevier: 24 months

Additional URL

https://doi.org/10.1016/j.ejor.2020.01.020

Download

Share

COinS