We study the first passage time (FPT) problem for biased continuous time random walks. Using the recently formulated framework of fractional Fokker-Planck equations, we obtain the Laplace transform of the FPT density function when the bias is constant. When the bias depends linearly on the position, the full FPT density function is derived in terms of Hermite polynomials and generalized Mittag-...

We address in this paper the problem of modifying both profits and costs of a fractional knapsack problem optimally such that a prespectified solution becomes an optimal solution with prespect to new parameters. This problem is called the inverse fractional knapsack problem. Concerning the l1-norm, we first prove that the problem is NP -hard. The problem can be however solved in quadratic time ...

In this paper we give the solution methods for a multicriterial transportation problem of a nonlinear type. We would like to note that the problems of this type do not have any classical solution algorithms. The article consists of two parts dealing with 2 and 3 objectives respectively, one being non-linear of “bottleneck” type, and the rest being linear ones. Definitions of efficient and extre...

In this paper we suggest a multiobjective evolutionary algorithm based on a restricted mating pool (REMO) with a separate archive for storing the remaining population. Such archive based algorithms have been used for solving real-world applications, however, no theoretical results are available. In this paper, we present a rigorous expected running time complexity analysis for the algorithm on ...

‎In this paper‎, ‎we present an algorithm for generating approximate nondominated points of a multiobjective optimization problem (MOP)‎, ‎where the constraints and the objective functions are convex‎. ‎We provide outer and inner approximations of nondominated points and prove that inner approximations provide a set of approximate weakly nondominated points‎. ‎The proposed algorithm can be appl...

This article introduces several algorithms for finding a representative subset of the non-dominated point set of a biobjective discrete optimization problem with respect to uniformity, coverage and the -indicator. We consider the representation problem itself as multiobjective, trying to find a good compromise between these quality measures. These representation problems are formulated as parti...

We present a new mechanism to introduce diversity into two multiobjective approaches based on ant colony optimisation and randomised greedy algorithms to solve a more realistic extension of a classical industrial problem: time and space assembly line balancing. Promising results are shown after applying the designed constructive metaheuristics to ten real-like problem instances.

We apply a multi-color extension of the Beck-Fiala theorem to show that the multiobjective maximum traveling salesman problem is randomized 1/2-approximable on directed graphs and randomized 2/3-approximable on undirected graphs. Using the same technique we show that the multiobjective maximum satisfiabilty problem is 1/2-approximable. 1998 ACM Subject Classification F.2.2 Nonnumerical Algorith...

Aalto University, P.O. Box 11000, FI-00076 Aalto www.aalto.fi Author Timo Laukkanen Name of the doctoral dissertation Multiobjective Heat Exchanger Network Synthesis Based on Grouping of Process Streams Publisher School of Engineering Unit Department of Energy Technology Series Aalto University publication series DOCTORAL DISSERTATIONS 83/2012 Field of research Process Systems Engineering, Ener...