E-viri
Recenzirano
Odprti dostop
-
Cabezas, Xavier; García, Sergio
Journal of the Operational Research Society, 11/2023, Letnik: ahead-of-print, Številka: ahead-of-printJournal Article
The Simple Plant Location Problem with Order (SPLPO) is a variant of the Simple Plant Location Problem (SPLP) where the customers have preferences over the facilities that will serve them. In particular, customers define their preferences by ranking each of the potential facilities from the most preferred to the least preferred. Even though the SPLP has been widely studied in the literature, the SPLPO, which is a harder model to deal with, has been studied much less and the size of instances that can be solved is very limited. In this article, we study a Lagrangian relaxation of the SPLPO model and we show that some properties previously studied and exploited to develop efficient SPLP solution procedures can be extended for their use in solving the SPLPO. We propose a heuristic method that takes a Lagrangian relaxation solution as the starting point of a semi-Lagrangian relaxation algorithm. Finally, we include some computational studies to illustrate the good performance of this method, which quite often ends with the optimal solution.
Vnos na polico
Trajna povezava
- URL:
Faktor vpliva
Dostop do baze podatkov JCR je dovoljen samo uporabnikom iz Slovenije. Vaš trenutni IP-naslov ni na seznamu dovoljenih za dostop, zato je potrebna avtentikacija z ustreznim računom AAI.
Leto | Faktor vpliva | Izdaja | Kategorija | Razvrstitev | ||||
---|---|---|---|---|---|---|---|---|
JCR | SNIP | JCR | SNIP | JCR | SNIP | JCR | SNIP |
Baze podatkov, v katerih je revija indeksirana
Ime baze podatkov | Področje | Leto |
---|
Povezave do osebnih bibliografij avtorjev | Povezave do podatkov o raziskovalcih v sistemu SICRIS |
---|
Vir: Osebne bibliografije
in: SICRIS
To gradivo vam je dostopno v celotnem besedilu. Če kljub temu želite naročiti gradivo, kliknite gumb Nadaljuj.