On the solution of petrochemical blending problems with classical metaheuristics.

Saved in:

Bibliographic Details
Title:	On the solution of petrochemical blending problems with classical metaheuristics.
Authors:	Venter, L.¹, Visagie, S. E.¹ svisagie@sun.ac.za
Source:	Orion. 2016, Vol. 32 Issue 2, p79-104. 26p. 2 Color Photographs, 3 Black and White Photographs, 1 Diagram, 5 Charts, 7 Graphs.
Subjects:	Petroleum chemicals, Mixing, Metaheuristic algorithms, Genetic algorithms, Simulation methods & models
Abstract:	In this paper a comparison of classical metaheuristic techniques over different sizes of petrochemical blending problems is presented. Three problems are taken from the literature and used for initial comparisons and parameter setting. A fourth instance of real world size is then introduced and the best performing algorithm of each type is then applied to it. Random search techniques, such as blind random search and local random search, deliver fair results for the smaller instances. Within the class of genetic algorithms the best results for all three problems were obtained using ranked fitness assignment with tournament selection. Good results are also obtained by means of continuous tabu search approaches. A simulated annealing approach also yielded fair results. Comparisons of the results for the different approaches shows that the tabu search technique delivers the best results with respect to solution quality and execution time for all of the three smaller problems under consideration. However, simulated annealing delivers the best result with respect to solution quality and execution time for the introduced real world size problem. [ABSTRACT FROM AUTHOR]
	Copyright of Orion is the property of Operations Research Society of South Africa and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

Description
Abstract:	In this paper a comparison of classical metaheuristic techniques over different sizes of petrochemical blending problems is presented. Three problems are taken from the literature and used for initial comparisons and parameter setting. A fourth instance of real world size is then introduced and the best performing algorithm of each type is then applied to it. Random search techniques, such as blind random search and local random search, deliver fair results for the smaller instances. Within the class of genetic algorithms the best results for all three problems were obtained using ranked fitness assignment with tournament selection. Good results are also obtained by means of continuous tabu search approaches. A simulated annealing approach also yielded fair results. Comparisons of the results for the different approaches shows that the tabu search technique delivers the best results with respect to solution quality and execution time for all of the three smaller problems under consideration. However, simulated annealing delivers the best result with respect to solution quality and execution time for the introduced real world size problem. [ABSTRACT FROM AUTHOR]
ISSN:	0259191X
DOI:	10.5784/32-2-520