Skip to main content
Communities & Collections
All of DSpace
Statistics
English
العربية
বাংলা
Català
Čeština
Deutsch
Ελληνικά
Español
Suomi
Français
Gàidhlig
हिंदी
Magyar
Italiano
Қазақ
Latviešu
Nederlands
Polski
Português
Português do Brasil
Srpski (lat)
Српски
Svenska
Türkçe
Yкраї́нська
Tiếng Việt
Log In
Log in
New user? Click here to register.
Have you forgotten your password?
Home
理學院
資訊工程學系
學位論文
學位論文
Permanent URI for this collection
http://rportal.lib.ntnu.edu.tw/handle/20.500.12235/73912
Browse
Search
By Issue Date
By Author
By Title
By Subject
By Subject Category
Search
By Issue Date
By Author
By Title
By Subject
By Subject Category
1 results
Back to results
Filters
Author
search.filters.author.Lai Yung-Pin
1
search.filters.author.賴永斌
Subject
1
search.filters.subject.convergence
1
search.filters.subject.crowding distance
1
search.filters.subject.mating pool selection
1
search.filters.subject.mating selection
1
search.filters.subject.multiobjective optimization
Show more
Search subject
Submit
Browse subject tree
Date
Start
End
Submit
2010
1
Has files
1
No
Reset filters
Settings
Sort By
Accessioned Date Descending
Most Relevant
Title Ascending
Date Issued Descending
Results per page
1
5
10
20
40
60
80
100
Search
Author: search.filters.author.Lai Yung-Pin
×
Search Tools
Search Results
Now showing
1 - 1 of 1
No Thumbnail Available
Item
以融合新式親代選擇機制之MOEA/D求解多目標最佳化問題
(
2010
)
賴永斌
;
Lai Yung-Pin
Show more
本論文提出一個融入新式親代選擇機制的MOEA/D演算法,用來求解多目標最佳化問題,新式親代選擇機制由三個機制組成:密集度評估機制、收斂評估機制、交配池選擇機制,使用此機制來改良MOEA/D演算法,增進演化效能,使用密集度跟收斂評估機制來分配計算資源,使計算資源不致浪費在無謂的演化上,充分的利用計算資源來達到更有效的演化,使用交配池選擇機制來改變交配池成員,原本MOEA/D演算法的設計是選擇固定成員當成交配池,而有少許機會可以選擇整個族群當成交配池,或許由固定成員進行交配在某些問題上很難逼近Pareto Front,所以我們使用交配池選擇機制來改變交配池成員,由此本論文提出一個新式親代選擇機制架構在MOEA/D演算法中,由實驗結果得知,此機制對於複雜的多目標最佳化問題可以得到很好的效能。
Show more