Flexible supplier selection and order allocation in the big data era with various quantity discounts

Qing Wang

PLOS ONE, 2023, vol. 18, issue 3, 1-29

Abstract: This paper studies the flexible large-scale supplier selection and order allocation problem with various quantity discounts, i.e., no discount, all-unit discount, incremental discount, and carload discount. It fills a literature gap that models usually formulate one or seldom two types because of the modeling and solution difficulty. All suppliers offering the same discount are far from reality, especially when the number of suppliers is large. The proposed model is a variant of the NP-hard knapsack problem. The greedy algorithm, which solves the fractional knapsack problem optimally, is applied to cope with the challenge. Three greedy algorithms are developed using a problem property and two sorted lists. Simulations show the average optimality gaps are 0.1026%, 0.0547%, and 0.0234% and the model can be solved in centiseconds, densiseconds, and seconds for supplier numbers 1000, 10000, and 100000. This allows the full use of data in the big data era.

Date: 2023
References: Add references at CitEc
Citations:

Downloads: (external link)
https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0283585 (text/html)
https://journals.plos.org/plosone/article/file?id= ... 83585&type=printable (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:plo:pone00:0283585

DOI: 10.1371/journal.pone.0283585

Access Statistics for this article

More articles in PLOS ONE from Public Library of Science
Bibliographic data for series maintained by plosone ().