Optimization of the Collaborative Hub Location Problem with Metaheuristics
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...
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | article |
| Lenguaje: | EN |
| Publicado: |
MDPI AG
2021
|
| Materias: | |
| Acceso en línea: | https://doaj.org/article/6cf9ada8926d4d8d8a38af0e7113b696 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Sumario: | 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 CO<sub>2</sub> 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. |
|---|