Journal of the Korean Operations Research and Management Science Society (한국경영과학회지)

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지

An Efficient Solution Procedure for $(P_{1},P_2)$

$(P_{1},P_2)$-PLP 의 해법에 관한 연구

  • Published : 1992.04.01
Download PDF
⟨ Previous Next ⟩

Abstract

This paper concerns with (p$_{1}$, p$_{2}$)-Plant Location problem in which entire set of candidate sites for facility locations is divided by two overlapping subsets, each of which with its own number of facilities to be established. We propose an algorithm which attempts to solve the Lagrangean dual of (p$_{1}$, p$_{2}$)-PLP by dividing sub-problem into twop-Plant Location Problems and solving them based on the convexity of the Lagrangean dual problem with respect to the number of facilities to be established. In doing so, Orthogonal Move procedure is proposed to provide easy-to-obtain lower bound to the Lagrangean Dual of (p$_{1}$, p$_{2}$)-PLP. Computational experience is reported.

Keywords

References

  1. E. J. O. R. v.22 Facility location models for distribution planning Aikens,C.H.
  2. OR Library : distributing test problems by electronic mail Beasley,J.E.
  3. Annals of Discrete Math. v.1 Sharp lower bounds and efficient algorithms for the simple plant location problem Bilde,O.;J.Krarup
  4. Mgmt. Sci. v.27 Inverse optimization : An application to the capacitated plant location problem Bitran,G.R.;V.Chandru;D.E.Sempolonski;J.F.Shapiro
  5. E. J. O. R. v.10 A tree search algorithm for p-median problem Christofides,N.;J.E.Beasley
  6. Mgmt. Sci. v.23 Location of bank account to optimize float : an analytic study of exact and approximate algorithm Cornuejols,G.;M.L.Fisher;G.L.Nemhauser
  7. O. R. v.26 A dual-based procedure for uncapacitated facility location Erlenkotter,D.
  8. Mgmt. Sci. v.20 Multicommodity distribution design by Benders decompositon Geoffrion,A.M.;G.W.Graves
  9. E. J. O. R. v.35 A Lagrangean dual ascent algorithm for simple plant location problems Guignard,M.
  10. E. J. O. R. v.20 A comparison of two dual-based procedures for solving the p-median problem Hanjoul,P.;D.Peeters
  11. Mgmt. Sci. v.10 A heuristic approach to solving travelling salesman problem Karg,R.L.;G.L.Thompson
  12. Mgmt. Sci. v.18 An efficient branch and bound algorithm for the warehouse location problem Khumawala,B.M.
  13. Comm. ACM v.14 A Man-Machine approach to ward solving the travelling salesman problem Krolak,P.;W.Felts;G.Marble
  14. Operational distribution research : Innovative case studies Mercer,A.;M.F.Cantley;G.K.Rand
  15. O. R. v.25 An algorithm for the p-median problem Narula,S.C.;U.I.Ogbu;H.M.Samuelsson
  16. O. R. v.19 The location of emergency service facilities Toregas,C.;R.W.Swain;C.S.Revelle;L.Bergman
  17. Interface v.19 Selecting optimal ingot sizes for Bethlehem Steel Vasko,F.J.;F.E.Wolfe;K.L.Scott;J.W.Scheirer
  18. 산업경제연구 v.14 Lagrange 쌍대문제의 볼록함수 성질 이용에 관한 연구 손기형