Proceedings of the third international conference on Genetic algorithms
MA|PM: memetic algorithms with population management
Computers and Operations Research
A distance function to support optimized selection decisions
Decision Support Systems
Generating Multiple Solutions for Mixed Integer Programming Problems
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Towards automated structure-based NMR resonance assignment
RECOMB'10 Proceedings of the 14th Annual international conference on Research in Computational Molecular Biology
How to select a small set of diverse solutions to mixed integer programming problems
Operations Research Letters
| Hi-index | 0.00 |
Suppose two solution vectors are needed that have good objective function values and are different from each other. The following question has not yet been systematically researched: Should the two vectors be generated sequentially or simultaneously? We provide evidence that for broad ranges of practically achievable distances, sequential generation usually requires less computational effort and produces solutions that are at least as good as produced by simultaneous generation. This is done using experiments based on publicly available instances of the multi-constrained, zero-one knapsack problem, which are corroborated using experiments conducted with the linear assignment problem.