We introduce a parameterized version of set cover that generalizes several previously studied problems. Given a ground set V and a collection of subsets Si of V , a feasible solution is a partition of V such that each subset of the partition is included in one of the Si. The problem involves maximizing the mean subset size of the partition, where the mean is the generalized mean of parameter p,...

We present the first fast route planning algorithm that answers shortest paths queries for a customizable linear combination of two different metrics, e. g. travel time and energy cost, on large scale road networks. The precomputation receives as input a directed graph, two edge weight functions t(e) and c(e), and a discrete interval [L,U ]. The resulting flexible query algorithm finds for a pa...

using new approaches to optimize the process of power transmission line routing can solve many complex problems which power transmission line routing decision-makers are faced. due to the expansion of involved parameters we can consider multi-objective evolutionary algorithms as appropriate method in this area. in this thesis with using multi-objective evolutionary algorithms nsga-ii and offere...

Abstract. A new algorithm for optimization problems with three objective functions is presented which computes a representation for the set of nondominated points. This representation is guaranteed to have a desired coverage error and a bound on the number of iterations needed by the algorithm to meet this coverage error is derived. Since the representation does not necessarily contain nondomin...

the vehicle driving comfort has become one of the important factors of vehicle quality and receives increasing attention. in this paper, optimal points of vehicle suspension parameters are generated using modified non-dominated sorting genetic algorithm (nsga-ii) for pareto optimization of 5-degree of freedom vehicle vibration model considering three conflicting functions simultaneously. in thi...