Experiments Using Scatter Search for the Multidemand Multidimensional Knapsack Problem

  • Lars Magnus Hvattum
  • Arne Løkketangen
Chapter
Part of the Operations Research/Computer Science Interfaces Series book series (ORCS, volume 39)

Abstract

The evolutionary, population based metaheuristic called Scatter Search has been successfully applied to many combinatorial optimization problems. Within the Scatter Search framework, however, there are numerous alternatives for how to implement the different components of the search. In this paper we explore a variety of these alternatives in a Scatter Search for solving the demand constrained multidimensional knapsack problem. Our best Scatter Search implementations produce good results, compared both to previous heuristic work as well as to exact solvers.

Keywords

Scatter Search 0/1 Multidemand Multidimensional Knapsack Problem 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Beasley, J. (1995). OR Library. (http: www.ms.ic.ac.uk/info.html).Google Scholar
  2. Cappanera, P. (1999). “Discrete Facility Location and Routing of Obnoxious Facilities”. Ph.D. thesis, University of Milano.Google Scholar
  3. Cappanera, P. and M. Trubian. (2004). “A Local Search Based Heuristic for the Demand Constrained Multidimensional Knapsack Problem”, INFORMS Journal of Computing, to appear.Google Scholar
  4. Glover, F. (1998). “A Template for Scatter Search and Path Relinking”, In: Artificial Evolution, Lecture Notes in Computer Science 1363, Springer, eds.: J.-K. Hao, E. Lutton, E. Ronald, M. Schoenauer and D. Snyers, pp. 13-54.Google Scholar
  5. Glover, F., M. Laguna and R. Martí. (2000). “Fundamentals of Scatter Search and Path Relinking”, Control and Cybernetics 39, pp. 653-684.Google Scholar
  6. Glover, F., M. Laguna and R. Martí. (2002). “New Ideas and Applications of Scatter Search and Path Relinking”. In: New Optimization Techniques in Engineering, Springer, ed.: G. Onwubolu, to appear.Google Scholar
  7. Glover, F., M. Laguna and R. Martí. (2003). “Scatter Search”. In: Advances in Evolutionary Computation: Theory And Applications, Springer, eds.: A. Ghosh and S. Tsutsui, pp. 519-537.Google Scholar
  8. Laguna, M. and R. Martí. (2003). Scatter Search: Methodology and Implementations in C, Kluwer Academic Publishers.Google Scholar
  9. Martí, R., M. Laguna, and F. Glover. (2006). “Principles of Scatter Search”. European Journal of Operations Research169, pp. 359-372.CrossRefGoogle Scholar
  10. Plastria, F. (2001). “Static Competitive Facility Location: an overview of Optimization Approaches”. European Journal of Operational Research 129, pp 461-470.CrossRefGoogle Scholar
  11. Reeves, C. (2003). “Genetic Algorithms”. In: Handbook of Metaheuristics, Kluwer Academic Publishers, Boston, eds.: F. Glover and G. Kochenberger, pp. 55-82.CrossRefGoogle Scholar
  12. Romero-Morales,D., E. Carrizosa and E. Conde. (1997). “Semi-Obnoxious Location Models: a Global Optimization Approach”. European Journal of Operational Research 102, pp. 295-301.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2007

Authors and Affiliations

  • Lars Magnus Hvattum
    • 1
  • Arne Løkketangen
    • 1
  1. 1.Molde University CollegeMolde

Personalised recommendations