• DocumentCode
    3527740
  • Title

    Warehouse location problem with concave costs : heuristics and exact method

  • Author

    Dupont, Laurent

  • Author_Institution
    Ecole des Mines d´Albi Carmaux, 81013 Albi CT Cedex 09 - FRANCE, My City, C-12345 Country. E-mail: Lionel.Dupont@enstimac.fr
  • fYear
    2006
  • fDate
    Oct. 2006
  • Firstpage
    1341
  • Lastpage
    1346
  • Abstract
    The purpose of facility location models is to select a set of facilities (warehouses, plants, public facilities, antennas, etc.) to be implanted over a given area in order to satisfy the needs of the customers within this area. In this article, we consider a warehouse location problem with round trip distribution. The objective is to minimize the sum of the costs of investment, storage and distribution. In this paper we consider a new type of facility location model, in which the incurred cost is a concave function of the quantity q delivered by the facility. We introduce some properties of an optimal solution and derive heuristic algorithms and a branch and bound method from these properties. Numerical examples illustrate this approach.
  • Keywords
    Cities and towns; Cost function; Heuristic algorithms; Hospitals; Investments; Lagrangian functions; Linear programming; Production; Systems engineering and theory; Transportation; Facility location problem; branch and bound; concave cost;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Engineering in Systems Applications, IMACS Multiconference on
  • Conference_Location
    Beijing, China
  • Print_ISBN
    7-302-13922-9
  • Electronic_ISBN
    7-900718-14-1
  • Type

    conf

  • DOI
    10.1109/CESA.2006.313523
  • Filename
    4105589