Λεπτομέρειες βιβλιογραφικής εγγραφής
| Τίτλος: |
On location-routing formulations for the Hamiltonian [formula omitted]-median problem. |
| Συγγραφείς: |
Canas, Francisco1 (AUTHOR) fmcanas@fc.ul.pt, Gouveia, Luís1 (AUTHOR) |
| Πηγή: |
European Journal of Operational Research. May2026, Vol. 331 Issue 1, p62-76. 15p. |
| Θεματικοί όροι: |
*Capital costs, *Mathematical optimization, Location problems (Programming), Assignment problems (Programming), Combinatorial optimization, Optimization algorithms |
| Περίληψη: |
• New formulations for the Hamiltonian p-Median Problem are proposed. • Strong formulations with fewer variables are obtained through projection results. • Branch-and-cut algorithms based on the new formulations are implemented and tested. • The most effective of these is very competitive with the current state-of-the-art. • Algorithms are tested for a variant with setup costs and new "Difficult" instances. Given a positive integer p and a weighted undirected graph G = (V , E) , the Hamiltonian p -Median Problem (H p MP) on G is to find a minimum weight set of p elementary cycles partitioning V. We study extended formulations for this problem including node-depot assignment (NDA) variables, in addition to edge variables. These formulations are based on the selection of certain nodes as depots and thus can be viewed as formulations for location-routing problems. Known NDA formulations and valid inequalities are reviewed, and new extended formulations, including edge-depot assignment (EDA) variables, are presented. We relate EDA formulations with known NDA formulations and, from the former, derive new exponentially sized sets of constraints defined with the edge and NDA variables. Computational results show that the EDA formulations produce very strong lower bounds and are effective for instances with up to 100 nodes and large values of p , and that the branch-and-cut algorithms based on NDA formulations including (some of) the generalized constraints are competitive with (and often outperform) the current state of the art (which involves solving instances with up to 400 nodes). We also address and present computational results for a variant of the H p MP in which setup costs for depots are considered. [ABSTRACT FROM AUTHOR] |
|
Copyright of European Journal of Operational Research is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Βάση Δεδομένων: |
Business Source Index |