淡江大學機構典藏:Item 987654321/109960
English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 56829/90592 (63%)
造訪人次 : 12149997      線上人數 : 58
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/109960


    題名: Multi‐Objective Dual‐Sale Channel Supply Chain Network Design Based on NSGA‐II
    作者: 廖述賢;何衛中
    關鍵詞: Supply chain management;Integrated supply chain design;Dual sale channel;Multiple objective evolutionary algorithm;NSGA-II
    日期: 2014-06-03
    上傳時間: 2017-03-15 02:11:07 (UTC+8)
    摘要: In this study, we propose a two-echelon multi-objective dual-sale channel supply chain network (DCSCN) model. The goal is to determine (i) the set of installed DCs, (ii) the set of customers the DC should work with, how much inventory each DC should order and (iv) the distribution routes for physical retailers or online e-tailers (all starting and ending at the same DC). Our model overcomes the drawback by simultaneously tackling location and routing decisions. In addition to the typical costs associated with facility location and the inventory-related costs, we explicitly consider the pivotal routing costs between the DCs and their assigned customers. Therefore, a multiple objectives location-routing model involves two conflicting objectives is initially proposed so as to permit a comprehensive trade-off evaluation. To solve this multiple objectives programming problem, this study integrates genetic algorithms, clustering analysis, Non-dominated Sorting Genetic Algorithm II (NSGA-II). NSGA-II searches for the Pareto set. Several experiments are simulated to demonstrate the possibility and efficacy of the proposed approach.
    關聯: IEA-AIE 2014
    DOI: 10.1007/978-3-319-07455-9_50
    顯示於類別:[管理科學學系暨研究所] 會議論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    index.html0KbHTML97檢視/開啟

    在機構典藏中所有的資料項目都受到原著作權保護.

    TAIR相關文章

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回饋