Hybrid Global Search Algorithm Based on Particle Swarm Optimization for Concave Cost Minimum Cost Network Flow Problems
碩士 === 國立中央大學 === 土木工程研究所 === 94 === Traditionally, the minimum cost transshipment problems were simplified as linear cost problems in order to reduce problem complexity. In practice, the unit cost for transporting freight usually decreases as the amount of freight increases. Hence, in actual oper...
Main Authors: | Wang-Tsang Lee, 李旺蒼 |
---|---|
Other Authors: | Shang-Yao Yan |
Format: | Others |
Language: | zh-TW |
Published: |
2006
|
Online Access: | http://ndltd.ncl.edu.tw/handle/t7393p |
Similar Items
-
The global search algorithms in minimum cost flow problem with concave costs
by: Jung-Chien Chen, et al.
Published: (2002) -
Hybrid Global Search Algorithm Based on Harmony Search for Concave Cost Minimum Cost Network Flow Problems
by: Xiang-Bang Liu, et al.
Published: (2008) -
Analogous Ant Colony System Algorithm for Concave Cost Minimum Cost Network Flow Problems
by: Cheng-Lan Wang, et al.
Published: (2005) -
Minimum-cost flows in networks with upper bounded arcs and concave cost functions.
by: Hallenbeck, Wayne Jay.
Published: (2012) -
Particle Swarm Optimization for the Minimum Cost Vertex-Disjoint Path Cover Problem
by: Indri Claudia Magdalena Marpaung, et al.
Published: (2016)