Title & Authors
Lee, Sang-Un;

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$\small{\acute{e}}$ret et al. tries to obtain the optimal solution using linear programming package with $\small{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 $\small{O(m^4)}$ of linear programming to O(m) time complexity for NP-complete chemical tank loading problem.
Keywords
Capability;Optimization;Decision;Margin;Residual;
Language
Korean
Cited by
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.

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.

4.

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.

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.

9.
P. Wright, "Consumer Choice Strategies: Simplifying vs. Optimizing," Journal of Marketing Research, Vol. 12, No. 1, pp. 60-67, Feb. 1975.

10.
G. Bendall and F. Margot, "Greedy Type Resistance of Combinatorial Problems," Discrete Optimization, Vol. 3, No. 4, pp. 288-298, Dec. 2006.

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.