Three approximation algorithms for solving the generalized segregated storage problem

European Journal of Operational Research

Volumn 156, Issue 1, 2004, Pages 54-72

  Barbucha, Dariusz ^a  

^a GDYNIA MARITIME UNIVERSITY   (Poland)

Author keywords

Combinatorial optimization; Heuristics; Population based algorithms; Segregated storage problems

Indexed keywords

APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; COSTS; EVOLUTIONARY ALGORITHMS; GRAIN (AGRICULTURAL PRODUCT); HEURISTIC METHODS; LEARNING ALGORITHMS; OPERATIONS RESEARCH; OPTIMIZATION; PROBLEM SOLVING; SILOS (AGRICULTURAL);

COMBINATORIAL OPTIMIZATION; HEURISTICS; POPULATION-BASED ALGORITHMS; SEGREGATED STORAGE PROBLEMS (SSP);

STORAGE (MATERIALS);

EID: 1242343600     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00917-7     Document Type: Conference Paper

References (25)

1. Amini M.A., Barr R.S. Network reoptimization algorithms: A statistically designed comparison. ORSA Journal of Computing. 5(4):1993;395-409.
2. D. Barbucha, W. Filipowicz, Segregated storage problems in maritime transportation, in: M. Papageorgiou, A. Pouliezos (Eds.), Proceedings of the 8th IFAC Symposium in Transportation Systems 97, Chania, vol. II, 1997, pp. 569-573.
3. D. Barbucha, Evolution-based algorithm to solve the generalized segregated storage problem, in: A. Adamski, A. Rudnicki, J. Zak (Eds.), Modeling and Management in Transportation, Poznan-Krakow, vol. 1, 1999, pp. 159-164.
4. D. Barbucha, A greedy heuristic for the generalized segregated storage problem, in: Proceedings of the International Symposium on Combinatorial Optimization (CO'2000), London, 2000, p. 41.
5. Barbucha D., Jedrzejowicz P. A population learning algorithm for solving the generalized segregated storage problem. Sincak P., Vascak J., Kvasnicka V., Mesiar R. The State of the Art in Computational Intelligence. 2000;355-360 Physica-Verlag, Heidelberg.
6. Dannenbring D.G., Khumawala B.M. An investigation of branch and bound methods for solving segregated storage problem. AIIE Transactions. 5(3):1973;265-274.
7. Evans J.R., Cullen F.H. The segregated storage problem: Some properties and an effective heuristic. AIIE Transactions. 9(4):1977;409-413.
8. Evans J.R., Tsubakitani S. Solving the segregated storage problem with benders' partitioning. Journal of the Operational Research Society. 44(2):1993;175-184.
9. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979;Freeman, San Francisco.
10. Goldberg D.E. Genetic Algorithms in Search, Optimization, and Machine Learning. 1989;Addison-Wesley, Reading, MA.
11. Jedrzejowicz P. Social learning algorithm as a tool for solving some difficult scheduling problems. Foundation of Computing and Decision Sciences. 24(2):1999;51-66.
12. Lin B.W., Rardin L.R. Controlled experimental design for statistical comparison of integer programming algorithms. Management Science. 25(12):1980;1258-1271.
13. Michalewicz Z. Genetic Algorithms. + Data Structures=Evolution Programs:1996;Springer, Berlin.
14. Moore J.H., Whinston A.B. Experimental design in quadratic programming. Management Science. 13(1):1966;58-76.
15. Nance R.E., Moose R.L. Jr., Foutz R.V. A statistical technique for comparing heuristics: An example from capacity assignment strategies in computer network design. Communications of the ACM. 30(5):1987;430-442.
16. Neebe A.W., Rao M.R. An algorithm for the segregated storage problem. Naval Research Logistics. 23:1976;406-420.
17. Neebe A.W. An improved, multiplier adjustment procedure for the segregated storage problem. Journal of the Operational Research Society. 38(9):1987;815-825.
18. Shilfer E., Naor P. Elementary theory of the optimal silo storage problem. Operational Research Quarterly. 12:1961;54-65.
19. White J.A., Francis R.L. Solving a segregated storage problem using branch-and-bound and extreme point ranking methods. AIIE Transactions. 3(1):1971;37-44.
20. Wood D.R. An algorithm for finding a maximum clique in a graph. Operations Research Letters. 21:1997;211-217.
21. Zanakis S.H. Heuristic 0-1 linear programming: An experimental comparison of three methods. Management Science. 24(1):1977;91-104.
22. Zanakis S.H., Evans J.R., Vazacopoulos A.A. Heuristic methods and applications: A categorized survey. European Journal of Operational Research. 43:1989;88-110.
23. International Maritime Dangerous Goods Code, International Maritime Organization, London, 1983.
24. Storck K.O. Stowage and Segregation Guide to IMDG-Code. 1983;Verlag, Hamburg.
25. Using the CPLEX Callable Library, CPLEX Optimization Inc., 1995.