Bi-objective optimization approaches to many-to-many hub location routing with distance balancing and hard time window - IMT Atlantique Access content directly
Journal Articles Neural Computing and Applications Year : 2019

Bi-objective optimization approaches to many-to-many hub location routing with distance balancing and hard time window

Abstract

This study addresses a many-to-many hub location-routing problem where the best-found locations of hubs and the bestfound tours for each hub are determined with simultaneous pickup and delivery within the hard time window. To find practical solutions, the hubs and transportation fleet have constrained capacity, in which every node can be serviced by multiple allocations with the hard time window and limited tour length. First, a bi-objective optimization model is proposed to balance travel costs among different routes and to minimize the total sum of fixed costs of locating hubs, the costs of handling, traveling, assigning, and transportation costs. The problem is then solved using an augmented e-constraint technique for small to medium size instances of the problem. Due to the NP-hardness nature of the problem, the proposed multi-objective optimization model is solved by a multi-objective imperialist competitive algorithm (MOICA). To show the superior performance of the MOICA, the solutions are compared with those obtained by the non-dominated sorting genetic algorithm (NSGA-II). For the large-scale problem instances, the comparative results indicate that the MOICA can indeed provide better Pareto optimal solutions compared to NSGA-II for the large-scale problem instances.
Fichier principal
Vignette du fichier
Bi-objective optimization approaches to many-to-many hub location.pdf (1.53 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02557693 , version 1 (04-03-2022)

Identifiers

Cite

Mohadese Basirati, Mohammad Reza Akbari Jokar, Erfan Hassannayebi. Bi-objective optimization approaches to many-to-many hub location routing with distance balancing and hard time window. Neural Computing and Applications, 2019, Green and Human Information Technology 2019, 32 (17), pp.13267-13288. ⟨10.1007/s00521-019-04666-z⟩. ⟨hal-02557693⟩
66 View
215 Download

Altmetric

Share

Gmail Facebook X LinkedIn More