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

Author： Jaszkiewicz Andrzej  

Publisher： Springer Publishing Company

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.131, Iss.1-4, 2004-10, pp. : 135-158

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Two-phase method and Lagrangian relaxation to solve the Bi-Objective Set Covering Problem

By Prins Christian  

Annals of Operations Research, Vol. 147, Iss. 1, 2006-10 ,pp. : 23-41

Springer Publishing Company

Access to resources Recommend Favorite

A study of the bi-objective next release problem

By Durillo Juan  

Empirical Software Engineering, Vol. 16, Iss. 1, 2011-02 ,pp. : 29-60

Springer Publishing Company

Access to resources Recommend Favorite

A multiple-objective grouping genetic algorithm for the cell formation problem with alternative routings

By Vin E.   Lit P.   Delchambre A.  

Journal of Intelligent Manufacturing, Vol. 16, Iss. 2, 2005-04 ,pp. : 189-205

Springer Publishing Company

Access to resources Recommend Favorite

A Fast Two-objective Differential Evolutionary Algorithm based on Pareto-optimal Set

By  

International Journal of Software Science and Computational Intelligence (IJSSCI), Vol. 8, Iss. 1, 2016-01 ,pp. : 46-59

IGI Global_journal

Access to resources Recommend Favorite

A Bilinear Algorithm for Optimizing a Linear Function over the Efficient Set of a Multiple Objective Linear Programming Problem

By Jorge Jesús  

Journal of Global Optimization, Vol. 31, Iss. 1, 2005-01 ,pp. : 1-16

Springer Publishing Company

Access to resources Recommend Favorite