An integrated approach to dynamic plant location and capacity planning

We consider a dynamic capacitated plant location problem in which capacities of opened plants are determined by acquisition and/or disposal of multiple types of facilities. We determine the opening schedule of plants, allocations of customers' demands and plans for acquisition and/or disposal of plant capacities that minimise the sum of discounted fixed costs for opening plants, delivery costs of products, and acquisition and operation costs of facilities. The dynamic capacitated plant location problem is formulated as a mixed integer linear program and solved by a heuristic algorithm based on Lagrangian relaxation and a cut and branch algorithm which uses Gomory cuts. Several solution properties of the relaxed problem are found and used to develop efficient solution procedures for the relaxed problem. A subgradient optimisation method is employed to obtain better lower bounds. The heuristic algorithm is tested on randomly generated test problems and results show that the algorithm finds good solutions in a reasonable amount of computation time.
Publisher
STOCKTON PRESS
Issue Date
1999-12
Language
ENG
Keywords

DUAL-BASED PROCEDURE; FACILITY LOCATION; LAGRANGIAN-RELAXATION; TECHNOLOGY; ALGORITHM; EXPANSION; ACQUISITION; MODELS; SIZES; MIX

Citation

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, v.50, no.12, pp.1205 - 1216

ISSN
0160-5682
URI
http://hdl.handle.net/10203/7764
Appears in Collection
IE-Journal Papers(저널논문)
  • Hit : 454
  • Download : 1
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 19 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0