English  |  正體中文  |  简体中文  |  Items with full text/Total items : 70585/70585 (100%)
Visitors : 23086347      Online Users : 313
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version

    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/26294

    Title: Probabilistic local search algorithms for concave cost transportation network problems
    Authors: Yan,SY;Luo,SC
    Contributors: 土木工程研究所
    Date: 1999
    Issue Date: 2010-06-29 17:10:08 (UTC+8)
    Publisher: 中央大學
    Abstract: In practice concave cost transportation problems are characterized as NP-l lard, 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. (C) 1999 Elsevier Science B.V. All rights reserved.
    Appears in Collections:[土木工程研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat

    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback  - 隱私權政策聲明