During the last decades, research in multi-objective optimisation has seen considerable growth. However, this activity been focused on linear, non-linear, and combinatorial with multiple objectives. Multi-objective mixed integer (linear or non-linear) programming received considerably less attention. In paper we propose an algorithm to compute a finite set of non-dominated points/efficient solu...

In this research paper, n jobs have to be scheduled on one-machine minimize the sum of maximum earliness and tardiness. We solved a series bi-criteria scheduling problems that related Three new algorithms were presented, two for hierarchical objective one simultaneous objective. Using results these algorithms, we This considered as NP-hard problem, it is also irregular, so missed some helpful p...

nowadays, the environmental impact of transportation project and, especially air pollution impacts, are major concerns in evaluating transportation projects. based on this concern, beside definition of traditional objective functions like total travel time and total investment cost, different type of environmental related function is considered as objective function in urban network design. in ...

The paper deals with the definition and the computation of surrogate upper bound sets for the bi-objective bi-dimensional binary knapsack problem. It introduces the Optimal Convex Surrogate Upper Bound set, which is the tightest possible definition based on the convex relaxation of the surrogate relaxation. Two exact algorithms are proposed: an enumerative algorithm and its improved version. Th...

Dynamic Multi-Objective Optimization Problems (DMOPs) and Many-Objective (MaOPs) are two classes of the optimization field that have potential applications in engineering. Modified Evolutionary Algorithms hybrid approaches seem to be suitable effectively deal with such problems. However, standard Crow Search Algorithm has not been considered for either DMOPs or MaOPs date. This paper proposes a...