.png){kind=icon}
Return
An exact algorithm for the Capacitated Total Quantity Discount Problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2012.04.028.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper we analyze the procurement problem of a company that needs to purchase a number of products from a set of suppliers to satisfy demand. The suppliers offer total quantity discounts and the company aims at selecting a set of suppliers so to satisfy product demand at minimum purchasing cost. The problem, known as Total Quantity Discount Problem (TQDP), is strongly NP-hard. We study different families of valid inequalities and provide a branch-and-cut approach to solve the capacitated variant of the problem (Capacitated TQDP) where the quantity available for a product from a supplier is limited. A hybrid algorithm, called HELP (Heuristic Enhancement from LP), is used to provide an initial feasible solution to the exact approach. HELP exploits information provided by the continuous relaxation problem to construct neighborhoods optimally searched through the solution of mixed integer subproblems. A streamlined version of the proposed exact method can optimally solve in a reasonable amount of time instances with up to 100 suppliers and 500 products, and largely outperforms an existing approach available in the literature and CPLEX 12.2 that frequently runs out of memory before completing the search. (c) 2012 Elsevier B.V. All rights reserved.
Keywords:
Branch-and-cut
Hybrid heuristic
Supplier selection
Total quantity discount
Purchasing costs
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
Cited Papers
.png){kind=icon}
ShareSaveAn efficient optimal algorithm for the quantity discount problem in material requirement planning
PREAI
ShareSaveShareSaveShareSaveShareSaveShareSaveShareSaveShareSave
View more