We consider a two-phase method for computing the complete set of efficient solutions of the biobjective minimum spanning tree problem. The first phase computes the extreme efficient solutions by expanding the convex hull of the feasible space. The second phase repeatedly applies a k-best minimum spanning tree algorithm to find all nonextreme efficient solutions. We report results of our computa...

This paper details the Particle Swarm Optimization (PSO) technique for the optimal design of analog circuits. It is shown the practical suitability of PSO to solve both mono-objective and multiobjective discrete optimization problems. Two application examples are presented: maximizing the voltage gain of a low noise amplifier for the UMTS standard and computing the Pareto front of a biobjective...

Recently studies in area of supply chain network (SCN) have focused on the disruption issues in distribution systems. Also this paper extends the previous literature by providing a new biobjective model for cost minimization of designing a three echelon SCN across normal and failure scenarios with considering multi capacity option for manufacturers and distribution centers. Moreover, in order t...

Task scheduling plays an important part in the improvement of parallel and distributed systems. The problem of task scheduling has been shown to be NP hard. The time consuming is more to solve the problem in deterministic techniques. There are algorithms developed to schedule tasks for distributed environment, which focus on single objective. The problem becomes more complex, while considering ...

The problem of finding a minimal cost-reliability ratio path is considered. The optimal solution to this problem is shown to map into an extreme supported non-dominated objective point in the objective space of the biobjective shortest path problem. Different forms of reliability are presented. We assume that this reliability does not change over time. We employ a parametric network simplex alg...

Motivated by the recent rise in need for refugee camps, we address one of key infrastructural problems establishment process: The clean water network design problem. We formulate problem as a biobjective integer programming and determine locations source, distribution units overall (pipelines), considering objectives minimizing cost (total length) maximizing accessibility walking distance) simu...

While using drones (UAVs) for remote surveillance missions, it is mandatory to do path planning of the vehicle since these are pilot-less vehicles. Path planning, whether offline (more popular) or online, entails setting up the path as a sequence of locations in the 3D Euclidean space, whose coordinates happen to be latitude, longitude and altitude. For the specific application of remote survei...