A Hybrid and colony optimization Algorithm with local search strategies to solve Single Source Capacitated Facility Location Problem

被引：2
|
作者：
Yang Lina [1 ]
Sun Xu [2 ]
Chi Tanhe [1 ]
机构：
[1] Chinese Acad Sci, Inst Remote Sensing Applicat, Beijing 100101, Peoples R China
[2] Inst Remote Sensing Applicat, Beijing, Peoples R China
来源：
2012 INTERNATIONAL CONFERENCE ON INDUSTRIAL CONTROL AND ELECTRONICS ENGINEERING (ICICEE) | 2012年
关键词：
Single Source Capacitated Facility Location Problem; Ant Colony Optimization; Local Search;
D O I：
10.1109/ICICEE.2012.30
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
Facility location is a complex and non-structural problem that human society usually confronts. A new approach, Hybrid Ant Colony Optimization-Local Search (HACO-LS), is developed to solve Single Source Capacitated Facility Location Problem (SSCFLP), which is treated as a two-layered model. With HACO-LS, the new facility sets and demands' assignmentscan be obtained. This method is tested in the experiment of car delivery center location in BinHai New Area, which proves that HACO-LScan solve SSCFLP effectively.
引用
收藏
页码：83 / 85
页数：3
相关论文
共 50 条
  • [41] A hybrid particle swarm optimization algorithm for the capacitated location routing problem
    Kechmane, Laila
    Nsiri, Benayad
    Baalal, Azeddine
    INTERNATIONAL JOURNAL OF INTELLIGENT COMPUTING AND CYBERNETICS, 2018, 11 (01) : 106 - 120
  • [42] Parallel Version of Local Search Heuristic Algorithm to Solve Capacitated Vehicle Routing Problem
    Yelmewad, Pramod
    Talawar, Basavaraj
    CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2021, 24 (04): : 3671 - 3692
  • [43] A cutting plane algorithm for the capacitated facility location problem
    Avella, Pasquale
    Boccia, Maurizio
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2009, 43 (01) : 39 - 65
  • [44] A cutting plane algorithm for the capacitated facility location problem
    Pasquale Avella
    Maurizio Boccia
    Computational Optimization and Applications, 2009, 43 : 39 - 65
  • [45] Parallel Version of Local Search Heuristic Algorithm to Solve Capacitated Vehicle Routing Problem
    Pramod Yelmewad
    Basavaraj Talawar
    Cluster Computing, 2021, 24 : 3671 - 3692
  • [46] A Hybrid Scatter Search Algorithm to Solve the Capacitated Arc Routing Problem with Refill Points
    Ramiro Lopez-Santana, Eduyn
    Andres Mendez-Giraldo, German
    Alberto Franco-Franco, Carlos
    INTELLIGENT COMPUTING THEORIES AND APPLICATION, ICIC 2016, PT II, 2016, 9772 : 3 - 15
  • [47] A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand
    Chase Rainwater
    Joseph Geunes
    H. Edwin Romeijn
    Journal of Heuristics, 2012, 18 : 297 - 315
  • [48] A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand
    Rainwater, Chase
    Geunes, Joseph
    Romeijn, H. Edwin
    JOURNAL OF HEURISTICS, 2012, 18 (02) : 297 - 315
  • [49] A hybrid adaptive large neighbourhood search algorithm for the capacitated location routing problem
    Akpunar, Ozge Satir
    Akpinar, Sener
    EXPERT SYSTEMS WITH APPLICATIONS, 2021, 168
  • [50] A hybrid algorithm for capacitated plant location problem
    Lai, Ming-Che
    Sohn, Han-suk
    Tseng, Tzu-Liang
    Chiang, Chunkuan
    EXPERT SYSTEMS WITH APPLICATIONS, 2010, 37 (12) : 8599 - 8605
12345