Solving combinatorial optimization problems with line-up competition algorithm

Computers and Chemical Engineering

Volumn 27, Issue 2, 2003, Pages 251-258

  Yan, Liexiang ^a  

^a WUHAN UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

Combinatorial optimization; Evolutionary algorithm; Knapsack problem; Line up competition algorithm; Pipe network

Indexed keywords

COMPUTER SIMULATION; EVOLUTIONARY ALGORITHMS; OPTIMIZATION;

LINE-UP COMPETITION ALGORITHMS (LCA);

PROBLEM SOLVING;

ALGORITHM; OPTIMIZATION; PIPING SYSTEM;

ALGORITHM; ARTICLE; COMPETITION; EVOLUTION; FAMILY; MATHEMATICAL COMPUTING; PRESSURE; PROBLEM SOLVING; PROCESS OPTIMIZATION; SPACE;

EID: 0037441336     PISSN: 00981354     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0098-1354(02)00194-1     Document Type: Article

References (20)

1. Androulakis, I. P., & Venkatasubramenian, V. (1991). A genetic algorithmic framework for process design and optimization. Computers and Chemical Engineering 15, 217-228.
2. Cardoso, M. F., Salcedo, R. L., & de Feyo, A. (1994). Non-equilibrium simulated annealing: a faster approach to combinatorial minimization. Industrial Engineering and Chemical Research 33, 1908-1918.
3. Cheng, W. B., & Mah, R. S. H. (1976). Optimal design of pressure relieving piping networks by discrete merging. American Institute of Chemical Engineering Journal 22 (3), 471-476.
4. Das, H., Cummings, P. T., & Levan, M. D. (1990). Scheduling of serial multiproduct batch processes via simulated annealing. Computers and Chemical Engineering 14, 1351-1362.
5. Dolan, W. B., Cumings, P. T., & Levan, M. D. (1989). Process optimization via simulated annealing: application to network design. American Institute of Chemical Engineering Journal 35, 725-736.
6. Floquet, P., Pibouleau, L., & Doemenech, S. (1994). Separation sequence synthesis: how to use simulated annealing procedure. Computers and Chemical Engineering 18, 1141-1148.
7. Goldberg, D. E. (1989). Genetic algorithms in search, optimization and machine learning. Addison-Wesley.
8. Greeff, D. J., & Aldrich, C. (1998). Empirical modeling of chemical process system with evolutionary programming. Computers and Chemical Engineering 22, 995-1005.
9. Hanagandi, V., & Nikolaou, M. (1998). A hybrid approach to global optimization using a clustering algorithm in a genetic search framework. Computers and Chemical Engineering 22, 1913-1925.
10. Jung, J. H., Lee, C. H., & Lee, I. B. (1998). A genetic algorithm for scheduling of multi-product batch processes. Computers and Chemical Engineering 22, 1725-1730.
11. Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983). Optimization by simulation annealing. Science 220, 671-680.
12. Ku, H. M., & Karrimi, I. A. (1991). An evaluation of simulated annealing for batch process scheduling. Industrial Engineering and Chemical Research 30, 163-169.
13. McKay, B., Willis, M., & Barton, G. (1997). Steady-state modeling of chemical process systems using genetic programming processes. Computers and Chemical Engineering 21, 981-996.
14. Nissen, V. (1994). Solving the quadratic assignment problem with clues from nature. IEEE Transactions on Neural Network 5, 66-72.
15. Papadimitriou, C. H., & Steiglitz, K. (1982). Combinatorial optimization algorithms and complexity. Printice-Hall.
16. Patel, A. N., Mah, R. S. K., & Karlmi, I. A. (1991). Preliminary design of multiproduct non-continuous plants using simulated annealing. Computers and Chemical Engineering 15, 451-469.
17. Wang, C., Quan, H., & Xu, X. (1995). Optimal design of multiproduct batch chemical process using genetic algorithms. Industrial Engineering and Chemical Research 35, 3560-3566.
18. Yan, L. X. (1998). Ph.D. dissertation, Beijing: University of Chemical Technology.
19. Yan, L. X., & Ma, D. X. (2001). Global optimization of nonconvex nonlinear programs using line-up competition algorithm. Computers and Chemical Engineering 25, 1601-1610.
20. Yip, P., & Pao, Y. H. (1995). Combinatorial optimization with use of guided evolutionary simulated annealing. IEEE Transactions on Neural Networks 6, 290-295.