A Comparative Study of Multiple-Objective Metaheuristics on the Bi-Objective Set Covering Problem and the Pareto Memetic Algorithm

@article{Jaszkiewicz2004ACS,
  title={A Comparative Study of Multiple-Objective Metaheuristics on the Bi-Objective Set Covering Problem and the Pareto Memetic Algorithm},
  author={Andrzej Jaszkiewicz},
  journal={Annals OR},
  year={2004},
  volume={131},
  pages={135-158}
}
The paper describes a comparative study of multiple-objective metaheuristics on the bi-objective set covering problem. Ten representative methods based on genetic algorithms, multiple start local search, hybrid genetic algorithms and simulated annealing are evaluated in the computational experiment. Nine of the methods are well known from the literature. The paper introduces also a new hybrid genetic algorithm called Pareto memetic algorithm. The results of the experiment indicate very good… CONTINUE READING
27 Citations
24 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 27 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 24 references

MOSA method: a tool for solving multiobjective combinatorial optimization problems

  • E. L. Ulungu, J. Teghem, Ph. Fortemps, D. Tuyttens
  • Journal of Multi-Criteria Decision Analysis,
  • 1999
Highly Influential
19 Excerpts

Pareto simulated annealing – a metaheuristic technique for multiple-objective combinatorial optimisation

  • P. Czyżak, A. Jaszkiewicz
  • Journal of Multi-Criteria Decision Analysis,
  • 1998
Highly Influential
12 Excerpts

Comparison of local search-based metaheuristics on the multiple objective knapsack problem

  • A. Jaszkiewicz
  • Foundations of Computing and Decision Sciences,
  • 2001
1 Excerpt

Multiple objective metaheuristic algorithms for combinatorial optimization, Habilitation thesis, 360, Poznan University of Technology, Poznan

  • A. Jaszkiewicz
  • 2001
2 Excerpts

Similar Papers

Loading similar papers…