A comparison of genetic and conventional methods for the solution of integer goal programmes

This paper discusses two different approaches to the solution of difficult Goal Programming (GP) models. An integer Goal Programming (IGP) solver and some genetically driven multi-objective methods are developed. Specialised GP speed up techniques and analysis tools are employed in the design and de...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 2001-08, Vol.132 (3), p.594-602
Main Authors: Mirrazavi, S.Keyvan, Jones, Dylan F, Tamiz, M
Format: Article
Language:English
Subjects:
Algorithms
Comparative analysis
Genetic algorithms
Goal programming
Integer programming
Studies
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper discusses two different approaches to the solution of difficult Goal Programming (GP) models. An integer Goal Programming (IGP) solver and some genetically driven multi-objective methods are developed. Specialised GP speed up techniques and analysis tools are employed in the design and development of the solution systems. A selection of linear integer models of small to medium size with an internal structure that makes solution difficult are considered. These problems are solved by both methods in order to assess their computational performance over several criteria and to compare the differences between them. From the results obtained in this research, it is observed that genetic algorithms (GA) have performed in general less efficiently than the Integer Goal Programming system for the sample of problems analysed.
ISSN:0377-2217
1872-6860
DOI:10.1016/S0377-2217(00)00164-8