The Adaptive Memory Projection Method for Multidimensional Knapsack problems with generalized Upper Bound Constraints

碩士 === 元智大學 === 工業工程與管理學系 === 97 === An adaptive memory projection (referred as AMP) method is developed for multidimensional knapsack problems with generalized upper bound constraints (referred as the GUBMKP). All the variables are divided into several generalized upper bound (referred as GUB) sets...

Full description

Bibliographic Details
Main Authors: Huan-Fu Chang, 張桓輔
Other Authors: Yun-Chia Liang
Format: Others
Language:en_US
Published: 2009
Online Access:http://ndltd.ncl.edu.tw/handle/20673081374091951368
id ndltd-TW-097YZU05031095
record_format oai_dc
spelling ndltd-TW-097YZU050310952016-05-04T04:17:09Z http://ndltd.ncl.edu.tw/handle/20673081374091951368 The Adaptive Memory Projection Method for Multidimensional Knapsack problems with generalized Upper Bound Constraints 以調適記憶投射法求解附有一般上限限制式之多維袋裝問題 Huan-Fu Chang 張桓輔 碩士 元智大學 工業工程與管理學系 97 An adaptive memory projection (referred as AMP) method is developed for multidimensional knapsack problems with generalized upper bound constraints (referred as the GUBMKP). All the variables are divided into several generalized upper bound (referred as GUB) sets and at most one variable can be chosen from each GUB set. The GUBMKP can be applied to many real-world problems, such as capital budgeting, resource allocation, cargo loading, project selection, just to name a few. The GUBMKP is a special case of multidimensional knapsack problems (referred as MKP), a well-known NP-hard problem. Therefore, it is justified to use metaheuristics to approximate the optimal solution for large problem instances. The adaptive memory procedure keeps track of components of good solutions during the search and creates provisional solution by combining components of better solutions. The projection method, which fixes the selected variables while varying the others, is very useful for metaheuristics, especially in large scale optimization. In this study, the AMP method is implemented by incorporating critical event tabu search and the branch and bound method built in a commercial optimization solver. In addition to the diversification effect within critical event tabu search, the pseudo-cut inequalities and an adjusted frequency penalty scalar are also applied to increase opportunities of exploring new regions. This study conducts a comprehensive sensitivity analysis on the parameters and strategies used in the proposed AMP algorithm. The performance of the algorithm is verified using a set of nine instances that consists of small- to large-scale instances. Therefore, this study has provided a fundamental basis for applying the AMP method to solve the GUBMKP. Yun-Chia Liang 梁韵嘉 2009 學位論文 ; thesis 106 en_US
collection NDLTD
language en_US
format Others
sources NDLTD
description 碩士 === 元智大學 === 工業工程與管理學系 === 97 === An adaptive memory projection (referred as AMP) method is developed for multidimensional knapsack problems with generalized upper bound constraints (referred as the GUBMKP). All the variables are divided into several generalized upper bound (referred as GUB) sets and at most one variable can be chosen from each GUB set. The GUBMKP can be applied to many real-world problems, such as capital budgeting, resource allocation, cargo loading, project selection, just to name a few. The GUBMKP is a special case of multidimensional knapsack problems (referred as MKP), a well-known NP-hard problem. Therefore, it is justified to use metaheuristics to approximate the optimal solution for large problem instances. The adaptive memory procedure keeps track of components of good solutions during the search and creates provisional solution by combining components of better solutions. The projection method, which fixes the selected variables while varying the others, is very useful for metaheuristics, especially in large scale optimization. In this study, the AMP method is implemented by incorporating critical event tabu search and the branch and bound method built in a commercial optimization solver. In addition to the diversification effect within critical event tabu search, the pseudo-cut inequalities and an adjusted frequency penalty scalar are also applied to increase opportunities of exploring new regions. This study conducts a comprehensive sensitivity analysis on the parameters and strategies used in the proposed AMP algorithm. The performance of the algorithm is verified using a set of nine instances that consists of small- to large-scale instances. Therefore, this study has provided a fundamental basis for applying the AMP method to solve the GUBMKP.
author2 Yun-Chia Liang
author_facet Yun-Chia Liang
Huan-Fu Chang
張桓輔
author Huan-Fu Chang
張桓輔
spellingShingle Huan-Fu Chang
張桓輔
The Adaptive Memory Projection Method for Multidimensional Knapsack problems with generalized Upper Bound Constraints
author_sort Huan-Fu Chang
title The Adaptive Memory Projection Method for Multidimensional Knapsack problems with generalized Upper Bound Constraints
title_short The Adaptive Memory Projection Method for Multidimensional Knapsack problems with generalized Upper Bound Constraints
title_full The Adaptive Memory Projection Method for Multidimensional Knapsack problems with generalized Upper Bound Constraints
title_fullStr The Adaptive Memory Projection Method for Multidimensional Knapsack problems with generalized Upper Bound Constraints
title_full_unstemmed The Adaptive Memory Projection Method for Multidimensional Knapsack problems with generalized Upper Bound Constraints
title_sort adaptive memory projection method for multidimensional knapsack problems with generalized upper bound constraints
publishDate 2009
url http://ndltd.ncl.edu.tw/handle/20673081374091951368
work_keys_str_mv AT huanfuchang theadaptivememoryprojectionmethodformultidimensionalknapsackproblemswithgeneralizedupperboundconstraints
AT zhānghuánfǔ theadaptivememoryprojectionmethodformultidimensionalknapsackproblemswithgeneralizedupperboundconstraints
AT huanfuchang yǐdiàoshìjìyìtóushèfǎqiújiěfùyǒuyībānshàngxiànxiànzhìshìzhīduōwéidàizhuāngwèntí
AT zhānghuánfǔ yǐdiàoshìjìyìtóushèfǎqiújiěfùyǒuyībānshàngxiànxiànzhìshìzhīduōwéidàizhuāngwèntí
AT huanfuchang adaptivememoryprojectionmethodformultidimensionalknapsackproblemswithgeneralizedupperboundconstraints
AT zhānghuánfǔ adaptivememoryprojectionmethodformultidimensionalknapsackproblemswithgeneralizedupperboundconstraints
_version_ 1718256391606501376