A simple and effective exact method for the medianoid problem with multipurpose trips

Vista sencilla de ítem
dc.contributor.affiliationUniversidad de Medellín, Medellin, Colombia
dc.contributor.affiliationUniversidad de Antioquia, Medellin, Colombia
dc.contributor.affiliationTecnológico de Monterrey, Monterrey, Mexico
dc.contributor.authorFernández-Gutiérrez, J.P.
dc.contributor.authorVillegas, J.G.
dc.contributor.authorCamacho-Vallejo, J.-F.
dc.date.accessioned2025-12-03T19:34:44Z
dc.date.available2025-12-03T19:34:44Z
dc.date.issued2025
dc.descriptionWe study the medianoid problem with multipurpose trips, a discrete facility location problem set in a static competitive environment where a new firm enters the market. Unlike traditional competitive facility location problems, we consider customers’ multipurpose trips to various facilities for different products, integrating location and routing decisions. To model the problem, we propose a bilevel formulation involving one leader and multiple followers. In this framework, the entering firm acts as the leader, seeking to maximize its benefit, while customers are positioned as followers, aiming to minimize the distance of their multipurpose purchasing tours to fulfill demands for several products at different locations. By leveraging the structure of the model, we demonstrate that the bilevel formulation can be efficiently solved through an equivalent reformulation based on the maximal covering location problem. To validate our approach, we created new datasets and conducted an extensive computational study. From the results, we highlight the number of stops made by customers to demonstrate the significance of our study. Additionally, we parallelized the follower’s problem to assess its effectiveness in reducing computational time. The results show that instances of practical size, previously addressed with metaheuristics, can now be solved to proven optimality within reasonable computing times while allowing multiple stops along their routes. © 2025 Elsevier B.V., All rights reserved.
dc.identifier.doi10.1007/s10589-025-00731-7
dc.identifier.instnameinstname:Universidad de Medellínspa
dc.identifier.issn15732894
dc.identifier.issn09266003
dc.identifier.reponamereponame:Repositorio Institucional Universidad de Medellínspa
dc.identifier.repourlrepourl:https://repository.udem.edu.co/
dc.identifier.urihttp://hdl.handle.net/11407/9236
dc.language.isoeng
dc.publisherSpringerspa
dc.publisher.facultyInstituto de Ciencias Básicasspa
dc.relation.isversionofhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-105017925914&doi=10.1007%2Fs10589-025-00731-7&partnerID=40&md5=77747b295ea0bd9f78661417fdcf5f9b
dc.relation.referencesRiopel, Diane, The network of logistics decisions, pp. 1-38, (2005)
dc.relation.referencesArchetti, Claudia, The value of integration in logistics, pp. 691-697, (2014)
dc.relation.referencesSchmid, Verena, Rich routing problems arising in supply chain management, European Journal of Operational Research, 224, 3, pp. 435-448, (2013)
dc.relation.referencesDaskin, Mark S., What you should know about location modeling, Naval Research Logistics, 55, 4, pp. 283-294, (2008)
dc.relation.referencesNagy, Gábor, Location-routing: Issues, models and methods, European Journal of Operational Research, 177, 2, pp. 649-672, (2006)
dc.relation.referencesSalhi, Said S., The effect of ignoring routes when locating depots, European Journal of Operational Research, 39, 2, pp. 150-156, (1989)
dc.relation.referencesPlastria, Frank A., Static competitive facility location: An overview of optimization approaches, European Journal of Operational Research, 129, 3, pp. 461-470, (2001)
dc.relation.referencesLocation Science, (2015)
dc.relation.referencesTadaros, M., Bi- and multi-objective location routing problems: classification and literature review, Operational Research, 22, 5, pp. 4641-4683, (2022)
dc.relation.referencesDrexl, Michael, A survey of variants and extensions of the location-routing problem, European Journal of Operational Research, 241, 2, pp. 283-308, (2015)
dc.rights.accesoRestricted access
dc.rights.accessrightsinfo:eu-repo/semantics/restrictedAccess
dc.sourceComputational Optimization and Applications
dc.sourceScopus
dc.subjectBilevel optimization
dc.subjectCompetitive facility location
dc.subjectMaximal covering location problem
dc.subjectMedianoid problem
dc.subjectTraveling purchaser problem
dc.subjectFacilities
dc.subjectSales
dc.subjectBi-level optimization
dc.subjectBilevel
dc.subjectCompetitive facility location
dc.subjectCovering location problems
dc.subjectExact methods
dc.subjectFacility location problem
dc.subjectMaximal covering location problem
dc.subjectMedianoid problem
dc.subjectSimple++
dc.subjectTraveling purchaser problem
dc.subjectLocation
dc.titleA simple and effective exact method for the medianoid problem with multipurpose trips
dc.typeArticle
dc.type.localArtículospa
dc.type.versioninfo:eu-repo/semantics/publishedVersion

Archivos

Colecciones

Indexados Scopus