Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/29823
Title: A water flow algorithm for optimization problems
Authors: TRAN TRUNG HIEU
Keywords: Nature-inspired algorithm, water flow algorithm, single/multi-objective flow shop scheduling, quadratic assignment problem, vehicle routing problem
Issue Date: 30-Mar-2011
Source: TRAN TRUNG HIEU (2011-03-30). A water flow algorithm for optimization problems. ScholarBank@NUS Repository.
Abstract: A novel natured-inspired algorithm, called the water flow algorithm (WFA), for solving optimization problems has been proposed. The algorithm is designed by simulating the hydrological cycle in meteorology and the erosion phenomenon in nature. Basic operators of this algorithm are based on the raindrop distribution simulation, the property of water flow always moving to lower positions, and the erosion process to overcome obstacles. In this thesis, our focus is on combinatorial optimization problems, such as flow shop scheduling problems, quadratic assignment problem, and vehicle routing problems. The WFA has been customized to solve these problems. Experimental results show that the WFA can obtain optimal or near-optimal solutions to these problems within reasonable computation time. The WFA has also been developed to solve the multi-objective flexible flow shop scheduling problem with intermediate buffers. In this algorithm, landscape analysis as well as evaporation and precipitation processes are integrated to solve the multi-objective scheduling problem. Experimental results demonstrate the efficiency and potential of the WFA for solving multi-objective scheduling problems.
URI: http://scholarbank.nus.edu.sg/handle/10635/29823
Appears in Collections:Ph.D Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
TranTH.pdf1.76 MBAdobe PDF

OPEN

NoneView/Download

Page view(s)

696
checked on Dec 11, 2017

Download(s)

899
checked on Dec 11, 2017

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.