본문 바로가기
  • Home

Minimum Margin Tank Loading Algorithm for Chemical Tank Loading Problem

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2015, 20(2), pp.131-136
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

Sang-Un, Lee 1

1강릉원주대학교

Accredited

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 unknownyet. Guéret et al. tries to obtain the optimal solution using linear programming package with O(m4) timecomplexity for chemical tank loading problem a kind of bin packing problem. On the other hand, this papersuggests the rule of loading chemical into minimum margin tank algorithm with O(m) time complexity. Theproposed algorithm stores the chemical in the tank that has partial residual of the same kind chemicalfirstly. Then, we load the remaining chemical to the minimum marginal tanks. As a result of experiments,this algorithm reduces the O(m4) of linear programming to O(m) time complexity for NP-completechemical tank loading problem.

Citation status

* References for papers published after 2023 are currently being built.