多旅行商問題(Multiple Traveling Salesperson Problem ,簡稱MTSP) 討論的是如何安排m( > 1 ) 位旅行商訪問n( >
m ) 座城市,要求每個城市只允許被訪問一次時,求解所有旅行商花費的費用和是最小(或最大) 的問題。MTSP 問題其實與單
旅行商問題(Traveling Salesperson Problem ,簡稱TSP) 相似,但是由于添加了任何城市只要被某一旅行商訪問到即可這個附加條
件,因而增加了問題復雜度。在以前使用遺傳算法(GA) 研究解決MTSP 問題時,通常采用標準的TSP 染色體和處理方法。現
為解決MTSP 問題給出了一種新的染色體設計和相關的處理方法,并與以往的理論設計和計算性能進行比較。計算測試顯
示,新的方法能夠獲得較小的查找空間,在許多方面,新的方法產生的解空間更好。
標簽：
Salesperson
Traveling
Multiple
Problem
上傳時間：
2013-12-17
上傳用戶：蟲蟲蟲蟲蟲蟲
Many wireless communications channels consist of multiple signal paths from the
transmitter to receiver. This multiplicity of paths leads to a phenomenon known
as multipath fading. The multiple paths are caused by the presence of objects in the
physical environment that, through the mechanisms of propagation, alter the path of
radiated energy. These objects are referred to as scatterers. In the past, researchers
often looked at ways to mitigate multipath scattering, such as in diversity systems.
Multiple-input, multiple-output (MIMO) systems, on the other hand, use multipath
diversity to their advantage; a MIMO system has the ability to translate increased
spatial diversity into increased channel capacity.
標簽：
Multiple-Output
Multiple-Input
Channel
Models
上傳時間：
2020-05-31
上傳用戶：shancjb
