Linear and conic reformulations for the maximum capture location problem under multinomial logit choice

This paper presents three reformulations for the well-known maximum capture location problem under multinomial logit choice. The problem can be cast as an integer fractional program and it has been the subject of several linear reformulations in the past. Here we develop two linear and a conic refor...

Full description

Saved in:
Bibliographic Details
Published inOptimization letters Vol. 15; no. 8; pp. 2611 - 2637
Main Authors Altekin, F. Tevhide, Dasci, Abdullah, Karatas, Mumtaz
Format Journal Article
LanguageEnglish
Published Berlin/Heidelberg Springer Berlin Heidelberg 01.11.2021
Subjects
Computational Intelligence
Mathematics
Mathematics and Statistics
Numerical and Computational Physics
Operations Research/Decision Theory
Optimization
Original Paper
Simulation
Random utility model
Competitive facility location
Conic programming
Location
Maximum capture
Online AccessGet full text

Cover

More Information
Summary:This paper presents three reformulations for the well-known maximum capture location problem under multinomial logit choice. The problem can be cast as an integer fractional program and it has been the subject of several linear reformulations in the past. Here we develop two linear and a conic reformulation based on alternative treatments of fractional programs. Numerical experiments conducted on established sets of instances have shown that conic reformulation has greatly improved the solution times as well as the size of the solvable problems as compared to the most successful reformulations to date.
ISSN:1862-4472
1862-4480
DOI:10.1007/s11590-020-01684-y