Compromise Rank Genetic Programming for Automated Nonlinear Design of Disaster Management

3Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper presents a novel multiobjective evolutionary algorithm, called compromise rank genetic programming (CRGP), to realize a nonlinear system design (NSD) for disaster management automatically. This NSD issue is formulated here as a multiobjective optimization problem (MOP) that needs to optimize model performance and model structure simultaneously. CRGP combines decision making with the optimization process to get the final global solution in a single run. This algorithm adopts a new rank approach incorporating the subjective information to guide the search, which ranks individuals according to the compromise distance of their mapping vectors in the objective space. We prove here that the proposed approach can converge to the global optimum under certain constraints. To illustrate the practicality of CRGP, finally it is applied to a postearthquake reconstruction management problem. Experimental results show that CRGP is effective in exploring the unknown nonlinear systems among huge datasets, which is beneficial to assist the postearthquake renewal with high accuracy and efficiency. The proposed method is found to have a superior performance in obtaining a satisfied model structure compared to other related methods to address the disaster management problem.

Cite

CITATION STYLE

APA

Wei, S., & Leung, H. (2015). Compromise Rank Genetic Programming for Automated Nonlinear Design of Disaster Management. Mathematical Problems in Engineering, 2015. https://doi.org/10.1155/2015/873794

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free