IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-3-319-29975-4_14.html
   My bibliography  Save this book chapter

Estimating the Pareto Front of a Hard Bi-criterion Competitive Facility Location Problem

In: Advances in Stochastic and Deterministic Global Optimization

Author

Listed:
  • Algirdas Lančinskas

    (Vilnius University)

  • Pascual Fernández

    (University of Murcia)

  • Blas Pelegrín

    (University of Murcia)

  • Julius Žilinskas

    (Vilnius University)

Abstract

We deal with the location problem for a franchise type expanding firm in competition with other firms in a geographical area. The firm aims at maximization of the market share captured by the new facilities and minimization of the lost market share of the old facilities caused by the entering of the new facilities in the market. The market share of each facility is estimated assuming that customers are served by the most attractive facility. A new tie breaking rule is introduced to serve the customers for which there are more than one facility with the maximum attraction, which leads to a hard nonlinear bi-objective optimization problem. A heuristic algorithm is proposed which obtains a good approximation of the Pareto front when the new facilities have to be selected from a finite set of candidates.

Suggested Citation

  • Algirdas Lančinskas & Pascual Fernández & Blas Pelegrín & Julius Žilinskas, 2016. "Estimating the Pareto Front of a Hard Bi-criterion Competitive Facility Location Problem," Springer Optimization and Its Applications, in: Panos M. Pardalos & Anatoly Zhigljavsky & Julius Žilinskas (ed.), Advances in Stochastic and Deterministic Global Optimization, pages 255-272, Springer.
  • Handle: RePEc:spr:spochp:978-3-319-29975-4_14
    DOI: 10.1007/978-3-319-29975-4_14
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:spochp:978-3-319-29975-4_14. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.