Documents disponibles écrits par cet auteur

A discrete competitive facility location model with variable attractiveness / H. Küçükaydin in Journal of the operational research society (JORS), Vol. 62 N° 9 (Septembre 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 9 (Septembre 2011) . - pp. 1726–1741 Titre : A discrete competitive facility location model with variable attractiveness Type de document : texte imprimé Auteurs : H. Küçükaydin, Auteur ; N. Aras, Auteur ; Altinel, I. K., Auteur Année de publication : 2011 Article en page(s) : pp. 1726–1741 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Competitive  facility  location  Variable  facility  attractiveness  Mixed-integer  nonlinear  programming  Lagrangean  heuristic  Branch-and-bound Index. décimale : 001.424 Résumé : We consider the discrete version of the competitive facility location problem in which new facilities have to be located by a new market entrant firm to compete against already existing facilities that may belong to one or more competitors. The demand is assumed to be aggregated at certain points in the plane and the new facilities can be located at predetermined candidate sites. We employ Huff's gravity-based rule in modelling the behaviour of the customers where the probability that customers at a demand point patronize a certain facility is proportional to the facility attractiveness and inversely proportional to the distance between the facility site and demand point. The objective of the firm is to determine the locations of the new facilities and their attractiveness levels so as to maximize the profit, which is calculated as the revenue from the customers less the fixed cost of opening the facilities and variable cost of setting their attractiveness levels. We formulate a mixed-integer nonlinear programming model for this problem and propose three methods for its solution: a Lagrangean heuristic, a branch-and-bound method with Lagrangean relaxation, and another branch-and-bound method with nonlinear programming relaxation. Computational results obtained on a set of randomly generated instances show that the last method outperforms the others in terms of accuracy and efficiency and can provide an optimal solution in a reasonable amount of time. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n9/abs/jors2010136a.html [article] A discrete competitive facility location model with variable attractiveness [texte imprimé] / H. Küçükaydin, Auteur ; N. Aras, Auteur ; Altinel, I. K., Auteur . - 2011 . - pp. 1726–1741. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 9 (Septembre 2011) . - pp. 1726–1741 Mots-clés : Competitive  facility  location  Variable  facility  attractiveness  Mixed-integer  nonlinear  programming  Lagrangean  heuristic  Branch-and-bound Index. décimale : 001.424 Résumé : We consider the discrete version of the competitive facility location problem in which new facilities have to be located by a new market entrant firm to compete against already existing facilities that may belong to one or more competitors. The demand is assumed to be aggregated at certain points in the plane and the new facilities can be located at predetermined candidate sites. We employ Huff's gravity-based rule in modelling the behaviour of the customers where the probability that customers at a demand point patronize a certain facility is proportional to the facility attractiveness and inversely proportional to the distance between the facility site and demand point. The objective of the firm is to determine the locations of the new facilities and their attractiveness levels so as to maximize the profit, which is calculated as the revenue from the customers less the fixed cost of opening the facilities and variable cost of setting their attractiveness levels. We formulate a mixed-integer nonlinear programming model for this problem and propose three methods for its solution: a Lagrangean heuristic, a branch-and-bound method with Lagrangean relaxation, and another branch-and-bound method with nonlinear programming relaxation. Computational results obtained on a set of randomly generated instances show that the last method outperforms the others in terms of accuracy and efficiency and can provide an optimal solution in a reasonable amount of time. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n9/abs/jors2010136a.html