|Title:||An OR practitioner's solution approach to the multidimensional knapsack problem||Authors:||Kern, Z
|Keywords:||Mixed-integer programming; Payment term; Trade credit; Logistics; Quantity flexible contract; Factoring||Issue Date:||2020||Publisher:||GROWING SCIENCE||Journal Volume:||11||Journal Issue:||1||Start page/Pages:||73||Source:||INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING COMPUTATIONS||Abstract:||
© 2019 by the authors; licensee Growing Science, Canada. The 0-1 Multidimensional Knapsack Problem (MKP) is an NP-Hard problem that has many important applications in business and industry. However, business and industrial applications typically involve large problem instances that can be time consuming to solve for a guaranteed optimal solution. There are many approximate solution approaches, heuristics and metaheuristics, for the MKP published in the literature, but these typically require the fine-tuning of several parameters. Fine-tuning parameters is not only time-consuming (especially for operations research (OR) practitioners), but also implies that solution quality can be compromised if the problem instances being solved change in nature. In this paper, we demonstrate an efficient and effective implementation of a robust population-based metaheuristic that does not require parameter fine-tuning and can easily be used by OR practitioners to solve industrial size problems. Specifically, to solve the MKP, we provide an efficient adaptation of the two-phase Teaching-Learning Based Optimization (TLBO) approach that was originally designed to solve continuous nonlinear engineering design optimization problems. Empirical results using the 270 MKP test problems available in Beasley’s OR-Library demonstrate that our implementation of TLBO for the MKP is competitive with published solution approaches without the need for time-consuming parameter fine-tuning.
|Appears in Collections:||食品安全與健康研究所|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.