Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Dominance in Incomplete Solvers for the Multiple Knapsack Problem Alex S. Fukunaga
 

Summary: Dominance in Incomplete Solvers for the Multiple Knapsack Problem
Alex S. Fukunaga
Global Edge Institute
Tokyo Institute of Technology
fukunaga@is.titech.ac.jp
Abstract
We investigate incomplete search algorithms in
a search space constrained by a dominance cri-
terion. We propose a new genetic algorithm for
the Multiple Knapsack Problem (MKP) which
searches a space of candidates which are not
dominated according to a dominance criterion.
We compare the new algorithm to previous
heuristics for the MKP, as well as alternative
algorithms, and show experimentally that our
new algorithm yields the best performance on
difficult instances where item weights and prof-
its are highly correlated.
1 Introduction
Symmetry and dominance constraints are related, gen-

  

Source: Aloul, Fadi - Department of Computer Engineering, American University of Sharjah

 

Collections: Engineering