Product line optimization with multiples sites - INRIA Chile Access content directly
Journal Articles Computers and Operations Research Year : 2022

Product line optimization with multiples sites

Abstract

We consider the problem faced by a retailer that selects the set of products to allocate in finite capacity stores to maximize patronage. The purchase decision is made by customers that purchase exactly one product that maximizes her utility that depends on the product price, distance traveled to the store and reservation price, known to the retailer. The retailer's bilevel optimization problem is transformed into an integer optimization formulation. Small size instances are solved optimally, while for large instances, we explore Benders Decomposition, Branch and Cut and Cut and Branch to solve the problem. Our computational results show that the proposed Cut and Branch method obtains the best results, and improves on the current state of the art.
Fichier principal
Vignette du fichier
Paper_multi__product_location_problem-no headings.pdf (311.54 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-03000086 , version 1 (11-11-2020)

Identifiers

  • HAL Id : hal-03000086 , version 1

Cite

Sebastián Dávila, Martine Labbé, Vladimir Marianov, Fernando Ordóñez, Frédéric Semet. Product line optimization with multiples sites. Computers and Operations Research, 2022, 148 (105978). ⟨hal-03000086⟩
110 View
305 Download

Share

Gmail Facebook X LinkedIn More