English  |  正體中文  |  简体中文  |  Items with full text/Total items : 60868/93650 (65%)
Visitors : 1147911      Online Users : 21
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU 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: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/119629

    Title: Multi-objective evolutionary approach for supply chain network design problem within online customer consideration
    Authors: Liao, Shu-Hsien;Hsieh, Chia-Lin;Ho, Wei-Chung
    Keywords: Supply chain network design;location inventory problem;dual channel;multi-objective programming;evolutionary computation
    Date: 2017-01-05
    Issue Date: 2020-11-24 12:10:42 (UTC+8)
    Abstract: Supply chain network design is one of the most important strategic decisions that need to be optimized for long-term efficiency. Critical decisions include facility location, inventory, and transportation issues. This study proposes that with a dual-channel supply chain network design model, the traditional location-inventory problem should be extended to consider the vast amount of online customers at the strategic level, since the problem usually involves multiple and conflicting objectives. Therefore, a multi-objective dual-channel supply chain network model involving three conflicting objectives is initially proposed to allow a comprehensive trade-off evaluation. In addition to the typical costs associated with facility operation and transportation, we explicitly consider the pivotal online customer service rate between the distribution centers (DCs) and their assigned customers. This study proposes a heuristic solution scheme to resolve this multi-objective programming problem, by integrating genetic algorithms, a clustering analysis, a Non-dominated Sorting Genetic Algorithm II (NSGA-II), and a Technique for Order Preference by Similarity to Ideal Solution (TOPSIS). Several experiments are simulated to demonstrate the possibility and efficacy of the proposed approach. A scenario analysis is conducted to understand the model’s performance.
    Relation: RAIRO Operations Research 51(1), p.135-155
    DOI: 10.1051/ro/2016010
    Appears in Collections:[管理科學學系暨研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat

    All items in 機構典藏 are protected by copyright, with all rights reserved.

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