A Decomposition Algorithm for Single and Multiobjective Integrated Market Selection and Production Planning

Wilco van den Heuvel (), Semra Ağralı () and Z. Caner Taşkın ()
Additional contact information
Wilco van den Heuvel: Erasmus University Rotterdam, 3062 PA Rotterdam, Netherlands
Semra Ağralı: MEF University, 34396 Sarıyer/Istanbul, Turkey
Z. Caner Taşkın: Boğaziçi University, 34342 Beşiktaş/Istanbul, Turkey

INFORMS Journal on Computing, 2023, vol. 35, issue 6, 1439-1453

Abstract: We study an integrated market selection and production planning problem. There is a set of markets with deterministic demand, and each market has a certain revenue that is obtained if the market’s demand is satisfied throughout a planning horizon. The demand is satisfied with a production scheme that has a lot-sizing structure. The problem is to decide on which markets’ demand to satisfy and plan the production simultaneously. We consider both single and multiobjective settings. The single objective problem maximizes the profit, whereas the multiobjective problem includes the maximization of the revenue and the minimization of the production cost objectives. We develop a decomposition-based exact solution algorithm for the single objective setting and show how it can be used in a proposed three-phase algorithm for the multiobjective setting. The master problem chooses a subset of markets, and the subproblem calculates an optimal production plan to satisfy the selected markets’ demand. We investigate the subproblem from a cooperative game theory perspective to devise cuts and strengthen them based on lifting. We also propose a set of valid inequalities and preprocessing rules to improve the proposed algorithm. We test the efficacy of our solution method over a suite of problem instances and show that our algorithm substantially decreases solution times for all problem instances.

Keywords: market selection; lot-sizing problem; decomposition algorithm; multiobjective optimization; cooperative game theory (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/ijoc.2022.0053 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:orijoc:v:35:y:2023:i:6:p:1439-1453

Access Statistics for this article

More articles in INFORMS Journal on Computing from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().