Product line optimization with multiples sites

dc.contributor.authorDavila, Sebastian
dc.contributor.authorLabbe, Martine
dc.contributor.authorMarianov, Vladimir
dc.contributor.authorOrdonez, Fernando
dc.contributor.authorSemet, Frederic
dc.date.accessioned2025-01-20T21:01:32Z
dc.date.available2025-01-20T21:01:32Z
dc.date.issued2022
dc.description.abstractWe consider the problem faced by a retail chain that must select what mutual-substitute items to display each one of its stores to maximize revenues. The number of items cannot exceed the limit space capacity of each store. Customers purchase the one product that maximizes their utility, which depends on the product price, travel cost to the store, and reservation price, known to the retailer. The retailer can set different price markdowns at different stores and products. The retailer considers the decisions of customers, and solves mixed-integer bilevel optimization problem, which can be formulated as a single-level optimization problem by using optimality conditions for the lower level. We propose Branch and Cut and Cut and Branch methods and include a family of valid inequalities to solve the problem. We compare the results with those of a Benders decomposition method. Our computational results show that the proposed Cut and Branch method obtains the best performance and improves the current state of the art.
dc.fuente.origenWOS
dc.identifier.doi10.1016/j.cor.2022.105978
dc.identifier.eissn1873-765X
dc.identifier.issn0305-0548
dc.identifier.urihttps://doi.org/10.1016/j.cor.2022.105978
dc.identifier.urihttps://repositorio.uc.cl/handle/11534/92904
dc.identifier.wosidWOS:000877371400001
dc.language.isoen
dc.revistaComputers & operations research
dc.rightsacceso restringido
dc.subjectLocation
dc.subjectProduct allocation to multiple stores
dc.subjectBilevel programming
dc.subjectCut and Branch
dc.subjectBranch and Cut
dc.subject.ods12 Responsible Consumption and Production
dc.subject.odspa12 Producción y consumo responsable
dc.titleProduct line optimization with multiples sites
dc.typeartículo
dc.volumen148
sipa.indexWOS
sipa.trazabilidadWOS;2025-01-12
Files