Journal of the Korea Society of Computer and Information (한국컴퓨터정보학회논문지)

Korean Society of Computer Information (한국컴퓨터정보학회)
권호 표지
DOI QR코드

DOI QR Code

Minimum Margin Tank Loading Algorithm for Chemical Tank Loading Problem

화공약품 탱크 적재 문제의 최소 여유량 탱크 적재 알고리즘

  • Lee, Sang-Un (Dept. of Multimedia Eng., Gangneung-Wonju National University)
  • 이상운 (강릉원주대학교 멀티미디어공학과)
  • Received : 2014.08.27
  • Accepted : 2014.12.31
  • Published : 2015.02.28
Download PDF
⟨ Previous Next ⟩

Abstract

The chemical tank loading problem has been classified as nondeterministic polynomial time (NP)-complete problem because of the polynomial-time algorithm to find the solution has been unknown yet. Gu$\acute{e}$ret et al. tries to obtain the optimal solution using linear programming package with $O(m^4)$ time complexity for chemical tank loading problem a kind of bin packing problem. On the other hand, this paper suggests the rule of loading chemical into minimum margin tank algorithm with O(m) time complexity. The proposed algorithm stores the chemical in the tank that has partial residual of the same kind chemical firstly. Then, we load the remaining chemical to the minimum marginal tanks. As a result of experiments, this algorithm reduces the $O(m^4)$ of linear programming to O(m) time complexity for NP-complete chemical tank loading problem.

화공약품 탱크 적재 문제는 다항시간으로 해를 찾을 수 있는 알고리즘이 알려져 있지 않아 NP-완전으로 분류된 난제이다. 화공약품 탱크 적재 문제는 상자 포장 문제의 일종으로, Gu$\acute{e}$ret et al.은 $O(m^4)$ 수행 복잡도의 선형계획법으로 해를 얻고자 하였다. 반면에, 본 논문에서는 최소 여유량을 가진 탱크에 적재하는 규칙인 O(m) 복잡도의 알고리즘을 제안하였다. 제안된 방법은 첫 번째로 잔여량이 있는 탱크에 해당 화공약품을 적재하였다. 다음으로, 남은 화공약품을 적재할 수 있는 최소 여유량을 가진 탱크에 해당 화공약품을 적재하였다. 실험 결과, 제안된 알고리즘은 NP-완전 문제인 화공약품 적재 문제에 대해 선형계획법의 $O(m^4)$를 O(m)으로 단축시켰다.

Keywords

References

  1. C. Gueret, X. Prins, and M. Sevaux, "Applications of Optimization with Xpress-MP: 9.3 Tank Loading," Dash Optimization Ltd., pp. 128-130, Feb. 2005.
  2. E. Falkenauer, "A Hybrid Grouping Genetic Algorithm for Bin Packing," Journal of Heuristics, Vol. 2, No. 1, pp 5-30, Aug 1996. https://doi.org/10.1007/BF00226291
  3. A. Lodi, S. Martello, and D. Vigo, "Recent Advances on Two-Dimensional Bin Packing Problems," Discrete Applied Mathematics, Vol. 123, No. 1-3, pp. 379-396, Nov. 2002. https://doi.org/10.1016/S0166-218X(01)00347-X
  4. M. Edvall, "Tank Loading," Tomlab Optimization Inc, http://tomsym.com/examples/tomsym_tank loading.html, Apr. 2009.
  5. E. Hussain, "VTTI to Build Major Fuel Terminal in Cyprus," http://www.arabianoilandgas.com/article-7602-vtti-to-build-major-fuel-terminal-in-cyprus/,arabianOilandGas.com, Jul. 2010.
  6. J. Kallrath, and A. Schreieck, "Discrete Optimisation and Real World Problems," Europe '95 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking, Lecture Notes in Computer Science, Vol. 919, pp. 351-359, May 1995.
  7. J. J. Hopfield, and D. W. Tank, "Neural Computation of Decisions in Optimization Problems," Biological Cybernetics, Vol. 52, No. 3, pp. 141-152, Jul. 1985. https://doi.org/10.1007/BF00339943
  8. J. Kallrath, "Mixed Integer Optimization in the Chemical Process Industry: Experience, Potential and Future Perspectives," Chemical Engineering Research and Design, Vol. 78, No. 6, pp. 809-822, Sep. 2000. https://doi.org/10.1205/026387600528012
  9. P. Wright, "Consumer Choice Strategies: Simplifying vs. Optimizing," Journal of Marketing Research, Vol. 12, No. 1, pp. 60-67, Feb. 1975. https://doi.org/10.2307/3150659
  10. G. Bendall and F. Margot, "Greedy Type Resistance of Combinatorial Problems," Discrete Optimization, Vol. 3, No. 4, pp. 288-298, Dec. 2006. https://doi.org/10.1016/j.disopt.2006.03.001
  11. S. U. Lee, "A Polynomial Time Optimal Algorithm for Linear Bin Packing Problem," Journal of the Korea Society of Computer and Information, Vol. 11, No. 8, pp. 9-16, Aug. 2013.
  12. S. U. Lee, "Maximum Profit Priority Goods First Loading Algorithm for Barge Loading Problem," Journal of the Korea Society of Computer and Information, Vol. 19, No. 10, pp. 169-173, Oct. 2014. https://doi.org/10.9708/jksci.2014.19.10.169