Product line optimization with multiples sites
Document type :
Article dans une revue scientifique: Article original
Title :
Product line optimization with multiples sites
Author(s) :
Dávila, Sebastián [Auteur]
Universidad de Chile = University of Chile [Santiago] [UCHILE]
Labbé, Martine [Auteur]
Integrated Optimization with Complex Structure [INOCS]
Marianov, Vladimir [Auteur]
Instituto de Sistemas Complejos de Ingeniería [ISCI]
Ordóñez, Fernando [Auteur]
Universidad de Chile = University of Chile [Santiago] [UCHILE]
Semet, Frédéric [Auteur]
Integrated Optimization with Complex Structure [INOCS]
Universidad de Chile = University of Chile [Santiago] [UCHILE]
Labbé, Martine [Auteur]
Integrated Optimization with Complex Structure [INOCS]
Marianov, Vladimir [Auteur]
Instituto de Sistemas Complejos de Ingeniería [ISCI]
Ordóñez, Fernando [Auteur]
Universidad de Chile = University of Chile [Santiago] [UCHILE]
Semet, Frédéric [Auteur]

Integrated Optimization with Complex Structure [INOCS]
Journal title :
Computers and Operations Research
Publisher :
Elsevier
Publication date :
2022-12
ISSN :
0305-0548
English keyword(s) :
Product allocation to multiple stores
Bilevel programming
Location
Cut and Branch
Branch and Cut
Bilevel programming
Location
Cut and Branch
Branch and Cut
HAL domain(s) :
Computer Science [cs]/Operations Research [math.OC]
English abstract : [en]
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 ...
Show more >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.Show less >
Show more >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.Show less >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
Collections :
Source :
Files
- https://hal.inria.fr/hal-03000086/document
- Open access
- Access the document
- https://hal.inria.fr/hal-03000086/document
- Open access
- Access the document
- https://hal.inria.fr/hal-03000086/file/Paper_multi__product_location_problem-no%20headings.pdf
- Open access
- Access the document
- https://hal.inria.fr/hal-03000086/document
- Open access
- Access the document
- document
- Open access
- Access the document
- Paper_multi__product_location_problem-no%20headings.pdf
- Open access
- Access the document
- document
- Open access
- Access the document
- Paper_multi__product_location_problem-no%20headings.pdf
- Open access
- Access the document