A branch-and-bound algorithm for the maximum capture problem with random utilities

Producción científica: Contribución a una revistaArtículorevisión exhaustiva

32 Citas (Scopus)


The maximum capture problem with random utilities seeks 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 the well-know a random utility model namely the multinomial logit. The problem is complex mostly due to its integer nonlinear objective function. Currently, the most efficient approaches deal with this complexity by either using a nonlinear programing solver or reformulating the problem into a Mixed-Integer Linear Programing (MILP) model. In this paper, we show how the best MILP reformulation available in the literature can be strengthened by using tighter coefficients in some inequalities. We also introduce a new branch-and-bound algorithm based on a greedy approach for solving a relaxation of the original problem. Extensive computational experiments are presented, benchmarking the proposed approach with other linear and non-linear relaxations of the problem. The computational experiments show that our proposed algorithm is competitive with all other methods as there is no method which outperforms the others in all instances. We also show a large-scale real instance of the problem, which comes from an application in park-and-ride facility location, where our proposed branch-and-bound algorithm was the most effective method for solving this type of problem.

Idioma originalInglés
Páginas (desde-hasta)204-212
Número de páginas9
PublicaciónEuropean Journal of Operational Research
EstadoPublicada - 1 jul. 2016


Profundice en los temas de investigación de 'A branch-and-bound algorithm for the maximum capture problem with random utilities'. En conjunto forman una huella única.

Citar esto