In this paper, we apply the minimum information theory to the uncapacitated p-median facility location problem to determine the most probable allocation solution. Indeed, we investigate the bi-level p-median model introduced by [TRANSPORT RES B-METH. 123 (2019) 1–20] in the case that facilities have unlimited capacities. At the upper level, minimizing the cost of establishing facilities and allocating demands is considered, while the most probable allocation solution in the customers’ point of view is determined through the lower level. By adding the Karush-Kuhn-Tucker optimality conditions of the lower-level problem to the upper-level constraints, the bi-level model is reduced to a one-level linear mixed integer problem. Some numerical examples are provided to verify the added value of the proposed model and its solution method.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    The minimum information approach to the uncapacitated p-median facility location problem


    Contributors:

    Published in:

    Transportation Letters ; 14 , 3 ; 307-316


    Publication date :

    2022-03-16


    Size :

    10 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    Unknown




    The Dynamic Uncapacitated Hub Location Problem

    Contreras, I. / Cordeau, J.-F. / Laporte, G. | British Library Online Contents | 2011


    The Dynamic Uncapacitated Hub Location Problem

    Contreras, Ivan | Online Contents | 2011


    Uncapacitated Facility Location with Allocation of Matched and Unmatched Clients

    Gourdin, E. / Labbe, M. / Laporte, G. et al. | British Library Conference Proceedings | 1997


    A Lagrangian-Based Branch-and-Bound Algorithm for the Two-Level Uncapacitated Facility Location Problem with Single-Assignment Constraints

    Gendron, Bernard / Khuong, Paul-Virak / Semet, Frédéric | British Library Online Contents | 2016