Solving a nonlinear non-convex trim loss problem with a genetic hybrid algorithm

Computers and Operations Research

Volumn 26, Issue 6, 1999, Pages 623-635

  Östermark, Ralf ^a  

^a ÅBO AKADEMI UNIVERSITY   (Finland)

Author keywords

Evolutionary programming; Integer nonlinear programming; Optimization; Trim loss problems

Indexed keywords

MATHEMATICAL ANALYSIS; PROCESS OPTIMIZATION;

CONSTRAINT THEORY; GENETIC ALGORITHMS; INTEGER PROGRAMMING; PROBLEM SOLVING;

BILINEAR CONSTRAINTS; GENETIC HYBRID ALGORITHMS (GHA); INTEGER NON-CONVEX NONLINEAR PROGRAMMING (INLP); NONLINEAR NON-CONVEX TRIM LOSS PROBLEMS;

NONLINEAR PROGRAMMING;

ALGORITHM; METHODOLOGY;

EID: 0033133851     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(98)00035-5     Document Type: Article

References (29)

1. Harjunkoski I, Westerlund T, Isaksson J, Skrifvars H. Different formulations for solving trim loss problems in a paper-converting mill with LP. Computers in Chemical Engineering 1996;20:121-6.
2. Harjunkoski I. Application of MINLP Methods to a Scheduling Problem in the Paper Converting Industry. Dissertation, Åbo Akademi University, Department of Chemical Engineering, Process Design Laboratory, 1997.
3. Östermark R. Solving irregular econometric and mathematical optimization problems with a genetic hybrid algorithm. Computational Economics 1998, forthcoming.
4. Pettersson F. Mixed Integer Non-linear Programming Applied on Pump Configurations. Dissertation, Process Design Laboratory, Faculty of Chemical Engineering, Åbo Akademi University, Åbo, 1994.
5. Westerlund T, Pettersson F, Grossmann IE. Optimization of pump configurations as a MINLP problem. Computers and Chemical Engineering 1994;18(9):845-58.
6. Floudas CA, Pardalos PM. A collection of test problems for constrained global optimization algorithms. Lecture Notes in Computer Science, Vol. 455. New York: Springer, 1987.
7. Östermark R, Westerlund T, Skrifvars H. A Nonlinear Mixed-integer Multiperiod Firm Model. Åbo Akademi University, 1996.
8. Ryoo HS, Sahinidis NV. Global optimization of nonconvex NLPs and MINLPs with applications in process design. Computers and Chemical Engineering 1995;19(5):551-66.
9. Michalewicz Z. Heuristic methods for evolutionary computation techniques. Journal of Heuristics 1995;1:177-206 Springer, 1994.
10. Richardson J, Palmer M, Liepins G, Hilliard, M. Some guidelines for genetic algorithms with penalty functions. In: Proceedings of the 3rd International Conference on Genetic Algorithms. Morgan Kaufmann, Los Altos, CA, 1989:191-2.
11. Dorsey RE, Mayer WJ. Genetic algorithm to estimation problems with multiple optima, nondifferentiability and other irregular features. Journal of Business and Economic Statistics 1995;13(1):53-66.
12. Michalewicz Z. A hierarchy of evolution programs: An experimental study. Evolutionary Computation 1993;1:57-76.
13. Michalewicz Z. Evolutionary computation techniques for nonlinear programming problems. International Transactions of Operational Research, 1994;1(2):223-40.
14. Bean JC, Hadj-Alouane AB. A dual genetic algorithm for bounded integer problems. Department of Industrial and Operations Engineering, University of Michigan, Technical Report 1992:92-53.
15. Le Riche R, Vayssade C, Haftka RT. A Segregated Genetic Algorithm for Constrained Optimization in Structural Mechanics. Technical Report, Université de Technologie de Compiegne, France, 1995.
16. Joines J, Houck C. On the use of non-stationary penalty functions to solve nonlinear constrained optimization functions with GA's. In: Proceedings of the Evolutionary Computation Conference - Poster Sessions, IEEE World Congress on Computational Intelligence, Orlando, 27-29, June 1994:579-84.
17. Siedlicki W, Sklanski J. Constrained genetic optimization via dynamic reward-penalty balancing and its use in pattern recognition. In: Proceedings of the Third International Conference on Genetic Algorithms. Morgan Kaufmann, Los Altos, CA, 1989:141-50.
18. Homaifar A, Lai SH-Y, Qi X. Constrained optimization via Genetic Algorithms. Simulation 1994;62:242-54.
19. Dennis JE, Schnabel RB. Numerical Methods for Unconstrained Optimization and Nonlinear Equations. Englewood Cliffs, NJ: Prentice-Hall, 1983.
20. Huntley CL, Brown De. Parallel genetic algorithms with local search. Computers & Operations Research 1996;23(6):559-71.
21. Levine D. Application of a hybrid genetic algorithm to airline crew scheduling. Computers & Operations Research 1996;23(6):547-58.
22. Haessler RW. A heuristic programming solution to a non-linear cutting-stock problem. Management Science 1971;17:13793-802.
23. Johnston RE. Extensions to Haessler's Heuristics for the Trim Problem, Centre Technique du Papier CR No. 1366, Grenoble, France, 1979.
24. Hinxman AI. The trim-loss and assortment problems: A survey. European Journal of Operational Research 1980;5:8-18.
25. Hock W, Schittkowski K. A collection of test problems for constrained global optimization algorithms. Lecture Notes in Economics and Mathematical Systems, Vol. 187. New York: Springer, 1981.
26. Michalewicz Z. Genetic Algorithms + Data Structures = Evolution Programs. AI Series. New York: Springer, 1993.
27. Michalewicz Z. Heuristic methods for evolutionary computation techniques. Journal of Heuristics, Dordrecht: Kluwer Academic Publishers 1995;1:177-206.
28. Holland JH. Adaption in Natural and Artificial Systems. Ann Arbor. MI: University of Michigan Press, 1975.
29. Vose MD. Generalizing the notion of schema in genetic algorithms. Artificial Intelligence 1991;50:385-96.