Home
Scholarly Works
A Genetic Algorithms Framework for Grey Non-Linear...
Conference

A Genetic Algorithms Framework for Grey Non-Linear Programming Problems

Abstract

This paper discusses the solution of a particular case of grey nonlinear programming, the Grey Quadratic Programming (GQP), and introduces the Genetic Algorithms (GA) approach as a feasible method for solving GQP problems. A framework using Genetic Algorithm for Grey Quadratic Programming (GAGQP) framework is designed and constructed by generalizing the common components of the GQP solutions and encapsulating the basic GA operations. This framework has been applied on a hypothetical municipal solid waste management problem and the result of the case study indicated that the GA approach is competitive with, if not superior to, other methods in solving GQP problems.

Authors

Jin W; Chan CW; Tontiwachwuthikul P; Huang GH

Pagination

pp. 2187-2190

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Publication Date

January 1, 2005

DOI

10.1109/ccece.2005.1557422

Name of conference

Canadian Conference on Electrical and Computer Engineering, 2005.
View published work (Non-McMaster Users)

Contact the Experts team