Solving the bilevel facility location problem under preferences by a Stackelberg-evolutionary algorithm (Q1718374): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2014/430243 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1981800580 / rank
 
Normal rank

Revision as of 21:40, 19 March 2024

scientific article
Language Label Description Also known as
English
Solving the bilevel facility location problem under preferences by a Stackelberg-evolutionary algorithm
scientific article

    Statements

    Solving the bilevel facility location problem under preferences by a Stackelberg-evolutionary algorithm (English)
    0 references
    0 references
    8 February 2019
    0 references
    Summary: This research highlights the use of game theory to solve the classical problem of the uncapacitated facility location optimization model with customer order preferences through a bilevel approach. The bilevel model provided herein consists of the classical facility location problem and an optimization of the customer preferences, which are the upper and lower level problems, respectively. Also, two reformulations of the bilevel model are presented, reducing it into a mixed-integer single-level problem. An evolutionary algorithm based on the equilibrium in a Stackelberg's game is proposed to solve the bilevel model. Numerical experimentation is performed in this study and the results are compared to benchmarks from the existing literature on the subject in order to emphasize the benefits of the proposed approach in terms of solution quality and estimation time.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references