The probe metaheuristic and its application to the multiconstraint knapsack problem

Authors:
Mousbah Barake;Pierre Chardaire;Geoff P. McKeown
Affiliations:
23 Alexandra Road, Colchester, CO3 3DF, UK;School of Information Systems, University of East Anglia, Norwich, NR4 7TJ, UK;School of Information Systems, University of East Anglia, Norwich, NR4 7TJ, UK
Venue:
Metaheuristics
Year:
2004

Citing 6
Cited 2

Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra

SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Genetic algorithms + data structures = evolution programs (3rd ed.)

Genetic algorithms + data structures = evolution programs (3rd ed.)
A Genetic Algorithm for the Multidimensional Knapsack Problem

Journal of Heuristics
Application of GRASP to the Multiconstraint Knapsack Problem

Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
Octane: A New Heuristic for Pure 0-1 Programs

Operations Research

A PROBE-Based Heuristic for Graph Partitioning

IEEE Transactions on Computers
Genetic approaches for graph partitioning: a survey

Proceedings of the 13th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new metaheuristic technique called PROBE is presented. The application of PROBE to the multiconstraint knapsack problem is described. Experimental results obtained using the resulting algorithm are compared with the results obtained by Chu and Beasley using a Genetic Algorithm.