Optimization of the Collaborative Hub Location Problem with Metaheuristics

被引:6
|
作者
Gargouri, Mohamed Amine [1 ,2 ]
Hamani, Nadia [1 ]
Mrabti, Nassim [1 ]
Kermad, Lyes [2 ]
机构
[1] Univ Picardie Jules Verne, Lab Innovat Technol, F-02100 St Quentin en Yvelines, France
[2] Univ Paris 08, Lab Quartz, F-93100 Montreuil, France
关键词
distribution network design problem; hub location problem; collaboration; sustainability; metaheuristic; mixed integer linear programming; GENETIC ALGORITHM APPROACH; MEDIAN PROBLEM; SINGLE; NETWORKS; SEARCH; DESIGN; URBAN; MODEL;
D O I
10.3390/math9212759
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
By creating new job opportunities and developing the regional economy, the transport of goods generates significant costs, environmental and sanitary nuisances, and high greenhouse gas (GHG) emissions. In this context, collaboration is an interesting solution that can be used to enable companies to overcome some problems such as globalization, economic crisis, health crisis, issues related to sustainability, etc. This study deals with the design of a multiperiod multiproduct three-echelon collaborative distribution network with a heterogeneous fleet. By applying the mixed integer linear problem (MILP) formulations, it was possible to study the three dimensions of sustainability (economic, environmental, and social/societal). Since the examined problem was NP-hard, it was solved using four metaheuristic approaches to minimize the different logistics costs or CO2 emissions. The social/societal aspect evaluated the accident rate and the noise level generated by the freight transport. Four algorithms were developed to achieve our objectives: a genetic algorithm, a simulated annealing, a particle swarm algorithm, and a vibration damping optimization algorithm. Considering a French distribution network, these algorithms overcame the limits of the exact solution method by obtaining optimal solutions with reasonable execution time.
引用
下载
收藏
页数:31
相关论文
共 50 条
  • [31] An efficient heuristic for a hub location routing problem
    Mustapha Ratli
    Dragan Urošević
    Abdessamad Ait El Cadi
    Jack Brimberg
    Nenad Mladenović
    Raca Todosijević
    Optimization Letters, 2022, 16 : 281 - 300
  • [32] Heuristics for the capacitated modular hub location problem
    Hoff, Arild
    Peiro, Juanjo
    Corberan, Angel
    Marti, Rafael
    COMPUTERS & OPERATIONS RESEARCH, 2017, 86 : 94 - 109
  • [33] Heuristics for a Hub Location-Routing Problem
    Lopes, Mauro Cardoso
    de Andrade, Carlos Eduardo
    de Queiroz, Thiago Alves
    Resende, Mauricio G. C.
    Miyazawa, Flavio Keidi
    NETWORKS, 2016, 68 (01) : 54 - 90
  • [34] The Uncapacitated Hub Location Problem with Allocation Constraints
    Chen, Jeng-Fung
    PROCEEDINGS OF THE EIGHTH INTERNATIONAL CONFERENCE ON INFORMATION AND MANAGEMENT SCIENCES, 2009, 8 : 30 - 35
  • [35] Hub Location and Routing Problem with Alternative Paths
    da Costa Fontes, Fabio Francisco
    Goncalves, Gilles
    2015 4TH IEEE INTERNATIONAL CONFERENCE ON ADVANCED LOGISTICS AND TRANSPORT (ICALT), 2015, : 250 - 255
  • [36] A hybrid heuristic for the uncapacitated hub location problem
    Abdinnour-Helm, S
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 106 (2-3) : 489 - 499
  • [37] An efficient heuristic for a hub location routing problem
    Ratli, Mustapha
    Urosevic, Dragan
    El Cadi, Abdessamad Ait
    Brimberg, Jack
    Mladenovic, Nenad
    Todosijevic, Raca
    OPTIMIZATION LETTERS, 2022, 16 (01) : 281 - 300
  • [38] The hub location problem with delivery time limitation
    Weng, KR
    Yang, C
    PROCEEDINGS OF THE 2005 INTERNATIONAL CONFERENCE ON MANAGEMENT SCIENCE & ENGINEERING (12TH), VOLS 1- 3, 2005, : 380 - 384
  • [39] HEURISTICS FOR THE P-HUB LOCATION PROBLEM
    KLINCEWICZ, JG
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1991, 53 (01) : 25 - 37
  • [40] A note on "the latest arrival hub location problem"
    Wagner, BN
    MANAGEMENT SCIENCE, 2004, 50 (12) : 1751 - 1752