Product line optimization with multiples sites
Type de document :
Article dans une revue scientifique: Article original
Titre :
Product line optimization with multiples sites
Auteur(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]
Titre de la revue :
Computers and Operations Research
Éditeur :
Elsevier
Date de publication :
2022-12
ISSN :
0305-0548
Mot(s)-clé(s) en anglais :
Product allocation to multiple stores
Bilevel programming
Location
Cut and Branch
Branch and Cut
Bilevel programming
Location
Cut and Branch
Branch and Cut
Discipline(s) HAL :
Computer Science [cs]/Operations Research [math.OC]
Résumé en anglais : [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 ...
Lire la suite >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.Lire moins >
Lire la suite >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.Lire moins >
Langue :
Anglais
Comité de lecture :
Oui
Audience :
Internationale
Vulgarisation :
Non
Collections :
Source :
Fichiers
- https://hal.inria.fr/hal-03000086/document
- Accès libre
- Accéder au document
- https://hal.inria.fr/hal-03000086/document
- Accès libre
- Accéder au document
- https://hal.inria.fr/hal-03000086/file/Paper_multi__product_location_problem-no%20headings.pdf
- Accès libre
- Accéder au document
- https://hal.inria.fr/hal-03000086/document
- Accès libre
- Accéder au document
- document
- Accès libre
- Accéder au document
- Paper_multi__product_location_problem-no%20headings.pdf
- Accès libre
- Accéder au document
- document
- Accès libre
- Accéder au document
- Paper_multi__product_location_problem-no%20headings.pdf
- Accès libre
- Accéder au document