Solving the Multiscenario Max-Min Knapsack Problem Exactly with Column Generation and Branch-and-Bound

Author:

Pinto Telmo1ORCID,Alves Cláudio1ORCID,Mansi Raïd1,Valério de Carvalho José1

Affiliation:

1. Centro de Investigação Algoritmi da Universidade do Minho, Escola de Engenharia, Universidade do Minho, 4710-057 Braga, Portugal

Abstract

Despite other variants of the standard knapsack problem, very few solution approaches have been devised for the multiscenario max-min knapsack problem. The problem consists in finding the subset of items whose total profit is maximized under the worst possible scenario. In this paper, we describe an exact solution method based on column generation and branch-and-bound for this problem. Our approach relies on a reformulation of the standard compact integer programming model based on the Dantzig-Wolfe decomposition principle. The resulting model is potentially stronger than the original one since the corresponding pricing subproblem does not have the integrality property. The details of the reformulation are presented and analysed together with those concerning the column generation and branch-and-bound procedures. To evaluate the performance of our algorithm, we conducted extensive computational experiments on large scale benchmark instances, and we compared our results with other state-of-the-art approaches under similar circumstances. We focused in particular on different relevant aspects that allow an objective evaluation of the efficacy of our approach. From different standpoints, the branch-and-price algorithm proved to outperform the other state-of-the-art methods described so far in the literature.

Funder

FEDER

Publisher

Hindawi Limited

Subject

General Engineering,General Mathematics

Cited by 15 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Dynamic, fair, and efficient routing for cooperative autonomous vehicle fleets;Expert Systems with Applications;2024-10

2. An incremental method-based machine learning approach for max–min knapsack with multiple scenarios;Computers & Industrial Engineering;2024-04

3. A Cooperative Machine Learning-Based Algorithm: The Case of Max-Min Knapsack Problem with Multiple Scenarios;Lecture Notes in Networks and Systems;2024

4. Vehicle Routing Problem with Fair Profits and Time Windows (VRP-FPTW);2023 IEEE International Conference on Systems, Man, and Cybernetics (SMC);2023-10-01

5. A Cooperative Population-Based Method for Solving the Max-Min Knapsack Problem with Multi-scenarios;2022 9th International Conference on Soft Computing & Machine Intelligence (ISCMI);2022-11-26

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3