Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

A Branch-and-Price Algorithm for the Single Source Capacitated Plant Location Problem

J. A. Díaz and E. Fernández
The Journal of the Operational Research Society
Vol. 53, No. 7 (Jul., 2002), pp. 728-740
Stable URL: http://www.jstor.org/stable/822761
Page Count: 13
  • Subscribe ($19.50)
  • Cite this Item
A Branch-and-Price Algorithm for the Single Source Capacitated Plant Location Problem
Preview not available

Abstract

This paper considers the Single Source Capacitated Plant Location Problem (SSCPLP). We propose an exact algorithm in which a column generation procedure for finding upper and lower bounds is incorporated within a Branch-and-Price framework. The bounding procedure exploits the structure of the problem by means of an iterative approach. At each iteration, a two-level optimization problem is considered. The two levels correspond with the two decisions to be taken: first, the selection of a subset of plants to be opened and then, the allocation of clients within the subset of open plants. The second level subproblem is solved using column generation. The algorithm has been tested with different sets of test problems and the obtained results are satisfactory.

Page Thumbnails

  • Thumbnail: Page 
[728]
    [728]
  • Thumbnail: Page 
729
    729
  • Thumbnail: Page 
730
    730
  • Thumbnail: Page 
731
    731
  • Thumbnail: Page 
732
    732
  • Thumbnail: Page 
733
    733
  • Thumbnail: Page 
734
    734
  • Thumbnail: Page 
735
    735
  • Thumbnail: Page 
736
    736
  • Thumbnail: Page 
737
    737
  • Thumbnail: Page 
738
    738
  • Thumbnail: Page 
739
    739
  • Thumbnail: Page 
740
    740