IDEAS home Printed from https://ideas.repec.org/a/spr/snopef/v2y2021i1d10.1007_s43069-021-00056-1.html
   My bibliography  Save this article

On the Linear Integration of Attraction Choice Models in Business Optimization Problems

Author

Listed:
  • Georg Bechler

    (Bundeswehr University Munich (UniBw))

  • Claudius Steinhardt

    (Bundeswehr University Munich (UniBw))

  • Jochen Mackert

    (University of Augsburg)

Abstract

Decision problems from various fields (e.g., assortment optimization, product line selection, location planning) require to endogenously incorporate probabilistic choice behavior in dependence of the availability of given choice alternatives. A widely spread demand model in marketing and econometrics to represent such choices is the attraction choice model. Of this model, the well-known multinomial logit model and—in case of multiple latent customer segments—the finite-mixture logit model are special cases. However, integrating such models in optimization problems results in non-linear formulations. Thus, in recent years, several exact linearization approaches have been proposed. These approaches are based on different ideas, and they have appeared independently from each other in different fields of research. Thus, the question arises how these approaches differ and how they relate to each other. In this short communication, we settle this question by arguing that many of the proposed approaches—even though they might seem different at first glance—can be traced back to one of two underlying linearization ideas. Establishing a generic problem, we discuss the two ideas in a unified way by presenting two corresponding general model formulations that are shown to be equivalent. Based upon this, we are able to classify the major publications which integrate some type of attraction choice model in detail. In particular, for each formulation of the analyzed literature, we explain to which extent it is a special case of (one of) the presented generic formulations. This also makes clear under which context-specific conditions certain elements of the generic linearization can be omitted, potentially serving as helpful guideline for future applications of such linearizations.

Suggested Citation

  • Georg Bechler & Claudius Steinhardt & Jochen Mackert, 2021. "On the Linear Integration of Attraction Choice Models in Business Optimization Problems," SN Operations Research Forum, Springer, vol. 2(1), pages 1-13, March.
  • Handle: RePEc:spr:snopef:v:2:y:2021:i:1:d:10.1007_s43069-021-00056-1
    DOI: 10.1007/s43069-021-00056-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s43069-021-00056-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s43069-021-00056-1?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Bechler, Georg & Steinhardt, Claudius & Mackert, Jochen & Klein, Robert, 2021. "Product line optimization in the presence of preferences for compromise alternatives," European Journal of Operational Research, Elsevier, vol. 288(3), pages 902-917.
    2. Wu, Tai-Hsi, 1997. "A note on a global approach for general 0-1 fractional programming," European Journal of Operational Research, Elsevier, vol. 101(1), pages 220-223, August.
    3. Kalyan Talluri & Garrett van Ryzin, 2004. "Revenue Management Under a General Discrete Choice Model of Consumer Behavior," Management Science, INFORMS, vol. 50(1), pages 15-33, January.
    4. Daniel McFadden, 2001. "Economic Choices," American Economic Review, American Economic Association, vol. 91(3), pages 351-378, June.
    5. Freire, Alexandre S. & Moreno, Eduardo & Yushimito, Wilfredo F., 2016. "A branch-and-bound algorithm for the maximum capture problem with random utilities," European Journal of Operational Research, Elsevier, vol. 252(1), pages 204-212.
    6. Train,Kenneth E., 2009. "Discrete Choice Methods with Simulation," Cambridge Books, Cambridge University Press, number 9780521766555.
    7. Ljubić, Ivana & Moreno, Eduardo, 2018. "Outer approximation and submodular cuts for maximum capture facility location problems with random utilities," European Journal of Operational Research, Elsevier, vol. 266(1), pages 46-56.
    8. Haase, Knut & Müller, Sven, 2014. "A comparison of linear reformulations for multinomial logit choice probabilities in facility location models," European Journal of Operational Research, Elsevier, vol. 232(3), pages 689-691.
    9. Benati, Stefano & Hansen, Pierre, 2002. "The maximum capture problem with random utilities: Problem formulation and algorithms," European Journal of Operational Research, Elsevier, vol. 143(3), pages 518-530, December.
    10. Kyle D. Chen & Warren H. Hausman, 2000. "Technical Note: Mathematical Properties of the Optimal Product Line Selection Problem Using Choice-Based Conjoint Analysis," Management Science, INFORMS, vol. 46(2), pages 327-332, February.
    11. Mai, Tien & Lodi, Andrea, 2020. "A multicut outer-approximation approach for competitive facility location under random utilities," European Journal of Operational Research, Elsevier, vol. 284(3), pages 874-881.
    12. Aros-Vera, Felipe & Marianov, Vladimir & Mitchell, John E., 2013. "p-Hub approach for the optimal park-and-ride facility location problem," European Journal of Operational Research, Elsevier, vol. 226(2), pages 277-285.
    13. Juan José Miranda Bront & Isabel Méndez-Díaz & Gustavo Vulcano, 2009. "A Column Generation Algorithm for Choice-Based Network Revenue Management," Operations Research, INFORMS, vol. 57(3), pages 769-784, June.
    14. A. Charnes & W. W. Cooper, 1962. "Programming with linear fractional functionals," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 9(3‐4), pages 181-186, September.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Fleckenstein, David & Klein, Robert & Steinhardt, Claudius, 2023. "Recent advances in integrating demand management and vehicle routing: A methodological review," European Journal of Operational Research, Elsevier, vol. 306(2), pages 499-518.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ralf Krohn & Sven Müller & Knut Haase, 2021. "Preventive healthcare facility location planning with quality-conscious clients," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(1), pages 59-87, March.
    2. Mai, Tien & Lodi, Andrea, 2020. "A multicut outer-approximation approach for competitive facility location under random utilities," European Journal of Operational Research, Elsevier, vol. 284(3), pages 874-881.
    3. Lin, Yun Hui & Wang, Yuan & He, Dongdong & Lee, Loo Hay, 2020. "Last-mile delivery: Optimal locker location under multinomial logit choice model," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    4. Ngan Ha Duong & Tien Thanh Dam & Thuy Anh Ta & Tien Mai, 2022. "Joint Location and Cost Planning in Maximum Capture Facility Location under Multiplicative Random Utility Maximization," Papers 2205.07345, arXiv.org, revised Feb 2023.
    5. Dam, Tien Thanh & Ta, Thuy Anh & Mai, Tien, 2023. "Robust maximum capture facility location under random utility maximization models," European Journal of Operational Research, Elsevier, vol. 310(3), pages 1128-1150.
    6. Méndez-Vogel, Gonzalo & Marianov, Vladimir & Lüer-Villagra, Armin, 2023. "The follower competitive facility location problem under the nested logit choice rule," European Journal of Operational Research, Elsevier, vol. 310(2), pages 834-846.
    7. Mika Sumida & Guillermo Gallego & Paat Rusmevichientong & Huseyin Topaloglu & James Davis, 2021. "Revenue-Utility Tradeoff in Assortment Optimization Under the Multinomial Logit Model with Totally Unimodular Constraints," Management Science, INFORMS, vol. 67(5), pages 2845-2869, May.
    8. Méndez-Vogel, Gonzalo & Marianov, Vladimir & Lüer-Villagra, Armin & Eiselt, H.A., 2023. "Store location with multipurpose shopping trips and a new random utility customers’ choice model," European Journal of Operational Research, Elsevier, vol. 305(2), pages 708-721.
    9. Basciftci, Beste & Ahmed, Shabbir & Shen, Siqian, 2021. "Distributionally robust facility location problem under decision-dependent stochastic demand," European Journal of Operational Research, Elsevier, vol. 292(2), pages 548-561.
    10. Strauss, Arne K. & Klein, Robert & Steinhardt, Claudius, 2018. "A review of choice-based revenue management: Theory and methods," European Journal of Operational Research, Elsevier, vol. 271(2), pages 375-387.
    11. Lin, Yun Hui & Tian, Qingyun, 2021. "Branch-and-cut approach based on generalized benders decomposition for facility location with limited choice rule," European Journal of Operational Research, Elsevier, vol. 293(1), pages 109-119.
    12. Tien Mai & Arunesh Sinha, 2022. "Safe Delivery of Critical Services in Areas with Volatile Security Situation via a Stackelberg Game Approach," Papers 2204.11451, arXiv.org.
    13. Dam, Tien Thanh & Ta, Thuy Anh & Mai, Tien, 2022. "Submodularity and local search approaches for maximum capture problems under generalized extreme value models," European Journal of Operational Research, Elsevier, vol. 300(3), pages 953-965.
    14. Guang Li & Paat Rusmevichientong & Huseyin Topaloglu, 2015. "The d -Level Nested Logit Model: Assortment and Price Optimization Problems," Operations Research, INFORMS, vol. 63(2), pages 325-342, April.
    15. Bechler, Georg & Steinhardt, Claudius & Mackert, Jochen & Klein, Robert, 2021. "Product line optimization in the presence of preferences for compromise alternatives," European Journal of Operational Research, Elsevier, vol. 288(3), pages 902-917.
    16. Roemer, Nils & Müller, Sven & Voigt, Guido, 2023. "A choice-based optimization approach for contracting in supply chains," European Journal of Operational Research, Elsevier, vol. 305(1), pages 271-286.
    17. Steven Lamontagne & Margarida Carvalho & Emma Frejinger & Bernard Gendron & Miguel F. Anjos & Ribal Atallah, 2023. "Optimising Electric Vehicle Charging Station Placement Using Advanced Discrete Choice Models," INFORMS Journal on Computing, INFORMS, vol. 35(5), pages 1195-1213, September.
    18. Sharif Azadeh, Sh. & Atasoy, Bilge & Ben-Akiva, Moshe E. & Bierlaire, M. & Maknoon, M.Y., 2022. "Choice-driven dial-a-ride problem for demand responsive mobility service," Transportation Research Part B: Methodological, Elsevier, vol. 161(C), pages 128-149.
    19. Ljubić, Ivana & Moreno, Eduardo, 2018. "Outer approximation and submodular cuts for maximum capture facility location problems with random utilities," European Journal of Operational Research, Elsevier, vol. 266(1), pages 46-56.
    20. Freire, Alexandre S. & Moreno, Eduardo & Yushimito, Wilfredo F., 2016. "A branch-and-bound algorithm for the maximum capture problem with random utilities," European Journal of Operational Research, Elsevier, vol. 252(1), pages 204-212.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:snopef:v:2:y:2021:i:1:d:10.1007_s43069-021-00056-1. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.