Using greedy clustering method to solve capacitated location-routing problem

被引:0
作者
Nadizadeh, Ali [1 ]
Sahraeian, Rashed [2 ]
Zadeh, Ali Sabzevari [2 ]
Homayouni, Seyed Mahdi [3 ]
机构
[1] Yazd Univ, Fac Engn, Dept Ind Engn, Yazd, Iran
[2] Shahed Univ, Fac Engn, Dept Ind Engn, Tehran, Iran
[3] Univ Putra Malaysia, Fac Engn, Dept Mech & Mfg Engn, Serdang, Malaysia
来源
AFRICAN JOURNAL OF BUSINESS MANAGEMENT | 2011年 / 5卷 / 17期
关键词
Capacitated location-routing problem; greedy clustering method; greedy search algorithm; ant colony system; SYSTEM; COLONY;
D O I
暂无
中图分类号
F [经济];
学科分类号
02 ;
摘要
This paper introduces a new heuristic method to solve the location-routing problem (LRP). Facility location problem (FLP) and vehicle routing problem (VRP) are considered simultaneously in the LRP. The problem selects the location of depot(s) to be established among a set of potential sites. On the other hand, the allocation of customers to depot(s), and the distribution routes between the customers and depot(s) are decided, too. In this paper, capacitated LRP (CLRP) is considered, in which the vehicles and the depots have a predefined capacity to serve the customers. A greedy clustering method (GCM-LRP) in four phases is proposed. The method clusters the customers using a greedy search algorithm, selects the most appropriate location of depot(s), allocates the clusters to the depot(s), and finally sets routes between the depot(s) and customers using ant colony system (ACS). The numerical experiments on a set of benchmark instances show the efficiency of the proposed method.
引用
收藏
页码:7499 / 7506
页数:8
相关论文
共 45 条
  • [41] Using a hybrid approach based on the particle swarm optimization and ant colony optimization to solve a joint order batching and picker routing problem
    Cheng, Chen-Yang
    Chen, Yin-Yann
    Chen, Tzu-Li
    Yoo, John Jung-Woon
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2015, 170 : 805 - 814
  • [42] Proposing a new model for location - routing problem of perishable raw material suppliers with using meta-heuristic algorithms
    Yaghoubi, Ali
    Akrami, Farideh
    HELIYON, 2019, 5 (12)
  • [43] Using Simulated Annealing to Solve the Multi-Depot Waste Collection Vehicle Routing Problem with Time Window and Self-Delivery Option
    Yu, Vincent F.
    Jodiawan, Panca
    Lin, Shih-Wei
    Nadira, Winy Fara
    Asih, Anna Maria Sri
    Vinh, Le Nguyen Hoang
    MATHEMATICS, 2024, 12 (03)
  • [44] Solving a multi-objective location routing problem for infectious waste disposal using hybrid goal programming and hybrid genetic algorithm
    Wichapa, Narong
    Khokhajaikiat, Porntep
    INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING COMPUTATIONS, 2018, 9 (01) : 75 - 98
  • [45] A robust bi-objective multi-trip periodic capacitated arc routing problem for urban waste collection using a multi-objective invasive weed optimization
    Tirkolaee, Erfan Babaee
    Goli, Alireza
    Pahlevan, Maryam
    Kordestanizadeh, Ramina Malekalipour
    WASTE MANAGEMENT & RESEARCH, 2019, 37 (11) : 1089 - 1101