Effects of repair procedures on the performance of EMO algorithms for multiobjective 0/1 knapsack problems

@article{Ishibuchi2003EffectsOR,
  title={Effects of repair procedures on the performance of EMO algorithms for multiobjective 0/1 knapsack problems},
  author={Hisao Ishibuchi and Shiori Kaige},
  journal={The 2003 Congress on Evolutionary Computation, 2003. CEC '03.},
  year={2003},
  volume={4},
  pages={2254-2261 Vol.4}
}
Multiobjective 0/1 knapsack problems have been used for examining the performance of EMO (evolutionary multiobjective optimization) algorithms in the literature. We demonstrate that their performance on such a test problem strongly depends on the choice of a repair procedure. We show through computational experiments that much better results are obtained from greedy repair based on a weighted scalar fitness function than the maximum profit/weight ratio, which has been often used for ordering… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 17 CITATIONS

Learning and Intelligent Optimization

  • Lecture Notes in Computer Science
  • 2013
VIEW 10 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Control of Variable Exchange Probability for Directed Mating in Evolutionary Constrained Multi-objective Continuous Optimization

  • 2015 3rd International Symposium on Computational and Business Intelligence (ISCBI)
  • 2015
VIEW 1 EXCERPT
CITES BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-9 OF 9 REFERENCES

Algorithms for Solving MttltiObjective Problems

D. A. van Veldhuizen, G . B. Lamont, Evolutionan
  • 2002

Come, “On metrics for memetic algorithm for multiobjective optimization,” comparing non-dominated sets,

J. D. Knowles, D. W. Come
  • Proc. of 2002 Proc. of 2000 Congress on Evolutionary Congress on Evolittfonaw Compittation,
  • 2000

A comparison of diverse approaches to memetic multiobjective combinatorial optimization

D. W. Come
  • IEEE Trans . on Evolutionaiy Computation

A fast and elitist multiobjective genetic algorithm : NSGA - 11 . ”

Ishibuchi, T. Murata
  • IEEE Trans . on Evolutionan Computat