4.7 Article

Optimization of the Collaborative Hub Location Problem with Metaheuristics

Journal

MATHEMATICS
Volume 9, Issue 21, Pages -

Publisher

MDPI
DOI: 10.3390/math9212759

Keywords

distribution network design problem; hub location problem; collaboration; sustainability; metaheuristic; mixed integer linear programming

Categories

Ask authors/readers for more resources

This study focuses on designing a multi-period, multi-product three-echelon collaborative distribution network with a heterogeneous fleet to address sustainability issues in the transportation of goods. By utilizing various algorithms to minimize logistics costs or CO2 emissions, the study optimized the distribution network. Social and environmental factors were also taken into account to improve efficiency and quality of freight transport.
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.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available