English  |  正體中文  |  简体中文  |  Items with full text/Total items : 90453/105671 (86%)
Visitors : 15701736      Online Users : 83
RC Version 6.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://asiair.asia.edu.tw/ir/handle/310904400/111723

    Title: Multi-Objective Competitive Location Problem with Distance-Based Attractiveness for Two Facilities
    Authors: 王聖權;Wang, Sheng-Chuan;*;林春成;Lin, Chun-Cheng;陳大正;Chen, Ta-Cheng;蕭震緯;Hsiao, Han C.W.
    Contributors: 行動商務與多媒體應用學系
    Date: 2018-07
    Issue Date: 2018-12-25 10:58:22 (UTC+8)
    Abstract: The multi-objective competitive location problem with distance-based attractiveness for two facilities (MOCLP-2 facilities) is introduced in this paper. A demand point is covered by two facilities, and the preferred facility satisfies the criteria of maximum attractiveness and minimum distance to the demand point. Facility attractiveness is defined as a distance-based coverage of the facility that can be full coverage, no coverage, or partial coverage of the demand point, depending on the within maximum full coverage radius, outside partial coverage radius between those two radii, respectively. The problem is formulated as a multi-objective optimization model to find a facility with maximum attractiveness and minimum distance. The contributions of this paper is that the problem can be tractably decided by the introduced non-dominated range (N.d. range) with less computation. Furthermore, extensive examples for facility selection and sensitivity analysis demonstrate its effectiveness and efficiency by the developed N.d. range.
    Relation: Computers and Electrical Engineering
    Appears in Collections:[行動商務與多媒體應用學系] 期刊論文

    Files in This Item:

    File SizeFormat

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

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