Probabilistic local search algorithms for concave cost transportation network problems

Shangyao Yan, So Chang Luo

研究成果: 雜誌貢獻期刊論文同行評審

25 引文 斯高帕斯(Scopus)

摘要

In practice concave cost transportation problems are characterized as NP-hard, therefore cost functions are usually simplified as linear in order to facilitate problem solving. However, linear cost functions may not reflect actual operations, which generally results in decreased operational performance. This research employs the techniques of simulated annealing and threshold accepting to develop several heuristics that would efficiently solve these concave cost transportation network problems. A network generator has also been designed to generate many instances on an HP workstation to test the heuristics. The preliminary results show that these heuristics are potentially useful.

原文???core.languages.en_GB???
頁(從 - 到)511-521
頁數11
期刊European Journal of Operational Research
117
發行號3
DOIs
出版狀態已出版 - 16 9月 1999

指紋

深入研究「Probabilistic local search algorithms for concave cost transportation network problems」主題。共同形成了獨特的指紋。

引用此