Location routing problems on trees
Visualitza/Obre
Cita com:
hdl:2117/171442
Tipus de documentArticle
Data publicació2019-04-30
Condicions d'accésAccés obert
Tots els drets reservats. Aquesta obra està protegida pels drets de propietat intel·lectual i
industrial corresponents. Sense perjudici de les exempcions legals existents, queda prohibida la seva
reproducció, distribució, comunicació pública o transformació sense l'autorització del titular dels drets
ProjecteOPTIMIZACION DISCRETA PARA PROBLEMAS INTEGRADOS EN LOGISTICA Y TRANSPORTE (MINECO-MTM2015-63779-R)
Barcelona Graduate School of Mathematics (BGSMath) (MINECO-MDM-2014-0445)
Barcelona Graduate School of Mathematics (BGSMath) (MINECO-MDM-2014-0445)
Abstract
This paper addresses combined location/routing problems defined on trees, where not all vertices have to be necessarily visited. A mathematical programming formulation is presented, which has the integrality property. The formulation models a directed forest where each connected component hosts at least one open facility, which becomes the root of the component. The problems considered can also be optimally solved with ad-hoc solution algorithms. Greedy type optimal algorithms are presented for the cases when all vertices have to be visited and facilities have no set-up costs. Facilities set-up costs can be handled with low-order interchanges, whose optimality check is a re-statement of the complementary slackness conditions of the proposed formulation. The general problems where not all vertices have to be necessarily visited can also be optimally solved with low-order optimal algorithms based on recursions.
CitacióAráoz, J.; Fernandez, E.; Rueda, S. Location routing problems on trees. "Discrete applied mathematics", 30 Abril 2019, vol. 259, p. 1-18.
ISSN0166-218X
Versió de l'editorhttps://www.sciencedirect.com/science/article/pii/S0166218X19300022
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
LRP180811 - RevisionEF - production.pdf | 712,3Kb | Visualitza/Obre |