This paper deals with multi- objective nonlinear programming problem having rough intervals in the constraints. The problem is approached by taking maximum value range and minimum value range inequalities as constraints conditions, reduces it into two classical multi-objective nonlinear programming problems, called lower and upper approximation problems.  All of the lower and upper approximatio...

in a supply chain, cross-docking is one of the most innovative systems for ameliorating the operational performance at distribution centers. cross-docking is a logistics strategy in which freight is unloaded from inbound trucks and (almost) directly loaded into outbound trucks, with little or no storage in between, thus no inventory remains at the distribution center. in this paper, we consider...

The aim of this study is to propose a comprehensive approach for handling the crew scheduling problem in the railway systems. In this approach, the information of different railway trips are considered as input and the problem is divided to three separated phases. In phase I, we generate all feasible sequences of the trips, which are named as the pairings. A depth-first search algorithm is deve...

This paper presents an efficient hybrid method, namely fuzzy particleswarm optimization (FPSO) and fuzzy c-means (FCM) algorithms, to solve the fuzzyclustering problem, especially for large sizes. When the problem becomes large, theFCM algorithm may result in uneven distribution of data, making it difficult to findan optimal solution in reasonable amount of time. The PSO algorithm does find ago...

The main propose of this paper, is performing a new solution on the basis of Linear Matrix Inequality (LMI) for designing induced ∞ l optimal controllers. Induced ∞ l optimal control allows directly time-domain specifications into the controller synthesis procedure and furnishes a complete solution to the robust performance problem. The new technique, which is proposed as an algorithm, combines...

A relatively optimal control is a stabilizing controller that, without initialization nor feedforwarding and tracking the optimal trajectory, produces the optimal (constrained) behavior for the nominal initial condition of the plant. In a previous work, a linear dynamic relatively optimal control, for discrete–time linear systems, was presented. Here a static solution is shown, namely a dead–be...

This paper describes a method for the parallel solution of tr/ans_lar sets of equations, appropriate when there are many rlght-hand sides. By preproceuing, the method can reduce the number of parsl/el steps required to solve Zz = b compared to parallel forward or backsolve. AppUcations are to iterative solvers with tzian_d&r preconditioners, to structural sns]ysds, or to power system= applicati...

The Polar Diagram [1] of a set of points (i.e. sites) is a partition of the plane. It is a locus approach for problems processing angles. Also, Dynamic Polar Diagram problem is a problem in which some points can be added to or removed from the point set of the Polar Diagram. Sadeghi et al. [4] introduced this problem and solved it using an algorithm which is optimal in the case that some points...

We define the distributed, continuous-time combinatorial optimization problem. We propose a general, semantically well-defined notion of solution stability in such systems, based on the cost of change from an already implemented solution to the new one. This approach allows maximum flexibility in specifying these costs through the use of stability constraints. We present the first mechanism for...