Efficient flow models for the uncapacitated multiple allocation p-hub median problem on non-triangular networks - Université Polytechnique des Hauts-de-France Accéder directement au contenu
Article Dans Une Revue Computers & Industrial Engineering Année : 2021

Efficient flow models for the uncapacitated multiple allocation p-hub median problem on non-triangular networks

Résumé

This paper examines the uncapacitated multiple allocation p-hub median problem (UMApHMP) in a general setting where a given network may violate the triangle inequality, thus leading to flow paths with more than two hubs connecting origin-to-destination pairs. We present two improved flow formulations using a new ”augmented graph” that allows a substantial reduction in the number of constraints, and significant improvement in performance of a standard off-the-shelf MILP solver compared to the recent 4-index flow model proposed in Brimberg et al. (2020). Results presented even surpass the performance of specialized algorithms developed for solving the standard ”triangular” case. The linear programming relaxations of the presented models are also investigated.
Fichier principal
Vignette du fichier
S0360835221006276.pdf (1.06 Mo) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03528030 , version 1 (17-10-2023)

Licence

Identifiants

Citer

Jack Brimberg, Raca Todosijević, Dragan Urošević, Nenad Mladenovic. Efficient flow models for the uncapacitated multiple allocation p-hub median problem on non-triangular networks. Computers & Industrial Engineering, 2021, 162, pp.107723. ⟨10.1016/j.cie.2021.107723⟩. ⟨hal-03528030⟩
55 Consultations
2 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More