Skip to main content

A Practical Case of the Multiobjective Knapsack Problem: Design, Modelling, Tests and Analysis

  • Conference paper
  • First Online:
Learning and Intelligent Optimization (LION 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8994))

Included in the following conference series:

  • 1086 Accesses

Abstract

In this paper, we present a practical case of the multiobjective knapsack problem which concerns the elaboration of the optimal action plan in the social and medico-social sector. We provide a description and a formal model of the problem as well as some preliminary computational results. We perform an empirical analysis of the behavior of three metaheuristic approaches: a fast and elitist multiobjective genetic algorithm (NSGA-II), a Pareto Local Search (PLS) algorithm and an Indicator-Based Multi-Objective Local Search (IBMOLS).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    In social and medico-social structures, a project is defined for a period of five years. At the sixth year, the evaluation of the project is carried out and the attainment of each objective is measured. Therefore, the more there are objectives, the more the evaluation is difficult.

References

  1. Basseur, M., Liefooghe, A., Khoi, L., Burke, E.K.: The efficiency of indicator-based local search for multi-objective combinatorial optimisation problems. J. Heuristics 18, 263–296 (2012)

    Google Scholar 

  2. Basseur, M., Talbi, E., Nebro, A., Alba, E.: Metaheuristics for multiobjective combinatorial optimization problems: review and recent issues. INRIA Research Report 5978 (2006)

    Google Scholar 

  3. Basseur, M., Zeng, R.-Q., Hao, J.-K.: Hypervolume-based Multi-objective Local Search. Neural Computing and Applications, pp. 1917–1929. Springer, London (2012)

    Google Scholar 

  4. Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6, 182–197 (2002)

    Google Scholar 

  5. Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer Science & Business Media, Heidelberg (2004)

    Book  MATH  Google Scholar 

  6. Knowles, J.D., Thiele, L., Zitzler, E.: A Tutorial on the performance assessment of stochastic multiobjective optimizers. Technical report, Computer Engineering and Networks Laboratory (TIK) 214, ETH Zurich (2006)

    Google Scholar 

  7. Liefooghe, A., Humeau, J., Mesmoudi, S., Jourdan, L., Talbi, E.-G.: On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems. J. Heuristics 18, 317–352 (2012)

    Google Scholar 

  8. Lust, T., Teghem, J.: The multiobjective multidimensional knapsack problem: a survey and a new approach. Int. Trans. Oper. Res. 19, 495–520 (2012)

    MATH  MathSciNet  Google Scholar 

  9. Paquete, L., Chiarandini, M., Sttzle, T.: Pareto local optimum sets in the biobjective traveling salesman problem: an experimental study. In: Gandibleux, X., Sevaux, M., Sörensen, K., T’kindt, V. (eds.) Metaheuristics for Multiobjective Optimisation, pp. 177–199. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  10. The ministry of social affairs and health: Le champ social et médico-social: une activité en forte croissance, des métiers qui se développent et se diversifient. Repères Anal. 44 (2012)

    Google Scholar 

  11. Trautmann, H., Wagner, T., Brockhoff, D.: R2-EMOA: focused multiobjective search using R2-indicator-based selection. In: Nicosia, G., Pardalos, P. (eds.) LION 7. LNCS, vol. 7997, pp. 70–74. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  12. Zitzler, E., Künzli, S.: Indicator-based selection in multiobjective search. In: Yao, X., Burke, E.K., Lozano, J.A., Smith, J., Merelo-Guervós, J.J., Bullinaria, J.A., Rowe, J.E., Tiňo, P., Kabán, A., Schwefel, H.-P. (eds.) PPSN 2004. LNCS, vol. 3242, pp. 832–842. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

Download references

Acknowledgments

We are grateful to the reviewers for their useful comments. This work was partially supported by the French Ministry for Research and Education through a CIFRE grant (number 0450/2013). We thank M. Rachid Naitali, the Director of GePI Conseil, for his support.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Brahim Chabane .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Chabane, B., Basseur, M., Hao, JK. (2015). A Practical Case of the Multiobjective Knapsack Problem: Design, Modelling, Tests and Analysis. In: Dhaenens, C., Jourdan, L., Marmion, ME. (eds) Learning and Intelligent Optimization. LION 2015. Lecture Notes in Computer Science(), vol 8994. Springer, Cham. https://doi.org/10.1007/978-3-319-19084-6_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-19084-6_23

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-19083-9

  • Online ISBN: 978-3-319-19084-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics