delivering perishable products to customers as soon as possible and with the minimum cost has been always a challenge for producers and has been emphasized over recent years due to the global market becoming more competitive. in this paper a multi-objective mix integer non-linear programming model is proposed to maximize both profits of a distributer and the total freshness of the several produ...

data envelopment analysis (dea) is a method to evaluate the relative efficiency of decision making units (dmus). in this method, the issue has always been to determine a set of weights for each dmu which often caused many problems. since the dea models also have the multi-objective linear programming (molp) problems nature, a rational relationship can be established between molp and dea problem...

Many problems in multi-agent systems can be represented as a Distributed Constraint Optimization Problem (DCOP) where the goal is to find the best assignment to variables in order to minimize the cost. More complex problems including several criteria can be represented as a Multi-Objective Distributed Constraint Optimization Problem (MODCOP) where the goal is to optimize several criteria at the...

In this paper, we study the structure and computational complexity of optimal multi-robot path planning problems on graphs. Our results encompass three formulations of the discrete multi-robot path planning problem, including a variant that allows synchronous rotations of robots along fully occupied, disjoint cycles on the graph. Allowing rotation of robots provides a more natural model for mul...

in this study, a two-objective mixed-integer linear programming model (milp) for multi-product re-entrant flow shop scheduling problem has been designed. as a result, two objectives are considered. one of them is maximization of the production rate and the other is the minimization of processing time. the system has m stations and can process several products in a moment. the re-entrant flow sho...

The problem of solving a multi-objective programming problem, by assuming that the decision maker has fuzzy goals for each of the objectives, is addressed. In this case a fuzzy goal programming problem has to be solved. But when we have several objectives it can be a difficult task for the decision maker to determine coherent aspiration levels, so it is possible that the tolerance thresholds be...

The problem of designing an effective models and methods for data transmission between group of microsatellites and network of ground stations in the dynamically changing environment is considered. Multi-agent technology for solving the problem by adaptive resource allocation and scheduling is proposed. It is shown that solution of the considered complex problem evolutionary emerges from intera...

One common characterization of how simple hill climbing optimization methods can fail is that they become trapped in local op tima a state where no small modi cation of the current best solution will produce a solution that is better This measure of better depends on the performance of the solution with respect to the single objective be ing optimized In contrast multi objective optimization MO...