Skip to main content
SpringerLink
Log in

Two-phases Method and Branch and Bound Procedures to Solve the Bi–objective Knapsack Problem

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

The classical 0–1 knapsack problem is considered with two objectives. Two methods of the “two–phases” type are developed to generate the set of efficient solutions. In the first phase, the set of supported efficient solutions is determined by optimizing a parameterized single-objective knapsack problem. Two versions are proposed for a second phase, determining the non-supported efficient solutions: both versions are Branch and Bound approaches, but one is “breadth first”, while the other is “depth first”. Extensive numerical experiments have been realized to compare the results of both methods.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Czyzak, P. and Jaszkiewicz, A. (1995), Pareto Simulated annealing – a Meta-heuristic Technique for Multiple Objective Combinatorial Optimization, Technical report, Institute of Computing Science, Poznan University of Technology. Submitted for publication.

  2. Dyer, R., Foreman, E. and Mustafa, M. (1988), Decision support for media selection, Technical report, Georges Washington University. Presented at the Third International Summer School on MCDM held at Estoril (Portugal).

  3. Ferreira, H. and Pardalos, P. (1996), Solving Combinatorial Optimization Problems in Parallel, Vol. 1054 of Lecture notes in computer science, Springer-Verlag.

  4. Martello, S. and Toth, P. (1990), Knapsack Problems: Algorithm and Computer Implementation, Wiley.

  5. Rosenblatt, M. and Sinuany-Stern, Z. (1989), Generating the discrete efficient frontier to the capital budgeting problem, Operations Research 37(3), 384–394.

    Google Scholar 

  6. Ulungu, E. and Teghem, J. (1994), Multi-objective combinatorial optimization: A survey, Journal of Multi-Criteria Decision Analysis 3(2), 83–104.

    Google Scholar 

  7. Ulungu, E. and Teghem, J. (1995), The two-phases method: An efficient procedure to solve biobjective combinatorial optimization problems, Foundations of Computing and Decision Sciences 20(2), 149–165.

    Google Scholar 

  8. Ulungu, E. and Teghem, J. (1997), Solving multi-objective knapsack problems by a branch-and-bound procedure in Multicriteria Analysis, J. N. Climaco (ed.), 269–278 Springer-Verlag.

  9. Ulungu, E., Teghem, J. and Fortemps, Ph. (1995), Heuristics for multi-objective combinatorial optimization by simulated annealing, in Multiple Criteria Decision Making: Theory and Application. Proceedings of the 6th National Conference on MCDM, Beijing (China).

Download references

Author information

Authors and Affiliations

  1. Laboratory of Mathematics and Operational Research, Faculté, Polytechnique de Mons, 9, rue de Houdain, B-7000, Mons, Belgium

    M. Visée, J. Teghem, M. Pirlot & E.L. Ulungu

Authors
  1. M. Visée
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. Teghem
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. Pirlot
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. E.L. Ulungu
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Visée, M., Teghem, J., Pirlot, M. et al. Two-phases Method and Branch and Bound Procedures to Solve the Bi–objective Knapsack Problem. Journal of Global Optimization 12, 139–155 (1998). https://doi.org/10.1023/A:1008258310679

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008258310679

Search

Navigation