Multi-objective optimisation problems normally have not one but a set of solutions, which are called Pareto-optimal solutions or non-dominated solutions. Once a Pareto-optimal set has been obtained, the decision-maker faces the challenge of analysing a potentially large set of solutions. Selecting one solution over others can be quite a challenging task because the Pareto set can contain an unm...

Therapeutic proteins continue to yield revolutionary new treatments for a growing spectrum of human disease, but the development of these powerful drugs requires solving a unique set of challenges. For instance, it is increasingly apparent that mitigating potential anti-therapeutic immune responses, driven by molecular recognition of a therapeutic protein's peptide fragments, may be best accomp...

In this paper an approach based on evolutionary algorithms to find Pareto optimal pair of state and control for multi-objective optimal control problems (MOOCP)'s is introduced‎. ‎In this approach‎, ‎first a discretized form of the time-control space is considered and then‎, ‎a piecewise linear control and a piecewise linear trajectory are obtained from the discretized time-control space using ...

Obtaining a fullest possible representation of solutions to a multiobjective optimization problem has been a major concern in Multi-Objective Genetic Algorithms (MOGAs). This is because a MOGA, due to its very nature, can only produce a discrete representation of Pareto solutions to a multiobjective optimization problem that usually tend to group into clusters. This paper presents a new MOGA, o...

In this paper, a multi-objective collaborative optimization (MOCO) strategy is proposed for making decisions on distillation column group. Firstly, based data preprocessing, the operating modes of tower group are determined by use fuzzy C-means clustering method. Secondly, concept variable, discrete state-space model main towers constructed subspace identification Then, MOCO designed ethylene p...

We consider bicriteria scheduling problems involving several classical well-known scheduling objectives on parallel, identical machines with job release dates. The jobs are assumed to have equal processing times. Our bicriteria treatment of these problems includes lexicographic optimization, minimization of a composite linear function, generation of schedules on the efficient frontier and the g...

This paper introduces a novel efficient partial shape matching method named IS-Match. We use sampled points from the silhouette as a shape representation. The sampled points can be ordered which in turn allows to formulate the matching step as an order-preserving assignment problem. We propose an angle descriptor between shape chords combining the advantages of global and local shape descriptio...

The main method of solving multi-objective programming is changing multi-objective programming problem into single objective programming problem, and then get Pareto optimal solution. Conversely, whether all Pareto optimal solutions can be obtained through appropriate method, generally the answer is negative. In this paper, the methods of norm ideal point and membership function are used to sol...

the purpose of this paper is multi-objective optimization of refrigeration cycle by optimization of all components of the cycle contains heat exchangers, air condenser, evaporator and super-heater. studied refrigeration cycle is compression refrigeration cycle of unit 132 third refineries in south pars that provide chilled water for cooling refinery equipment's. cycle will be performed by ...