Abstract
The simple plant location problem deals with the selection of facility sites from a set of possible locations with the intention of serving a given set of customers from the chosen locations. The objective is to minimize the sum of the fixed charges for establishing the facilities and the transportation costs corresponding to the supply of the demands. We show how to modify a primal-dual version of Erlenkotter's exact algorithm to get an improved procedure. Computational experience with large-scale problems indicates that, compared with Erlenkotter's code, an implementation of the modified algorithm is faster by more than one order of magnitude. For real-life problems with 1500 potential facility sites the increase of computational speed may even exceed the factor of 100.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
