In this paper, a class of chance constrained multiobjective linear programming model with birandom coefficients is considered for vendor selection problem. Firstly we present a crisp equivalent model for a special case and give a traditional method for crisp model. Then, the technique of birandom simulation is applied to deal with general birandom objective functions and birandom constraints wh...

Multiple, often conflicting objectives arise naturally in most real-world optimization scenarios. As evolutionary algorithms possess several characteristics that are desirable for this type of problem, this class of search strategies has been used for multiobjective optimization for more than a decade. Meanwhile evolutionary multiobjective optimization has become established as a separate subdi...

This report documents the program and outcomes of the Dagstuhl Seminar 15031 Understanding Complexity in Multiobjective Optimization. This seminar carried on the series of four previous Dagstuhl Seminars (04461, 06501, 09041 and 12041) that were focused on Multiobjective Optimization, and strengthening the links between the Evolutionary Multiobjective Optimization (EMO) and Multiple Criteria De...

We present in this paper a new multiobjective memetic algorithm scheme called MEMOX. In current multiobjective memetic algorithms, the parents used for recombination are randomly selected. We improve this approach by using a dynamic hypergrid which allows to select a parent located in a region of minimal density. The second parent selected is a solution close, in the objective space, to the fir...

The Linear Shelf Space Allocation Problem (LiSSAP) consists on allocating lengths of shelves in a given shop to specific products or groups of products. Previously we gave the first steps towards the development of a commercially viable tool that used evolutionary computation to address the problem. In this paper we take a multiobjective approach which we consider more suitable to the problem, ...

This paper proposes a new multiobjective location problem for emergency facilities, e.g. ambulance service stations and fire stations. In the problem, one of the objectives is to minimize the maximal distance of the paths from the located emergency facilities to hospitals via accidents. The other is to maximize the frequency of accidents that the emergency facilities can respond quickly. An int...

The paper is concerned with the optimistic formulation of a bilevel optimization problem with multiobjective lower-level problem. Considering the scalarization approach for the multiobjective program, we transform our problem into a scalar-objective optimization problem with inequality constraints by means of the well-known optimal value reformulation. Completely detailed first-order necessary ...

In this paper we study the bilevel linear programming problem with multiple objective functions at the upper level, with particular focus on the bi-objective case. We examine some properties of this problem and propose a methodological approach based on the reformulation of the problem as a multiobjective mixed 0-1 linear programming problem. The basic idea consists in applying a reference poin...

In this article, we consider the problem of planning inspections and other tasks within a software development (SD) project with respect to the objectives quality (no. of defects), project duration, and costs. Based on a discrete-event simulation model of SD processes comprising the phases coding, inspection, test, and rework, we present a simplified formulation of the problem as a multiobjecti...

This paper proposes a multiobjective harmony search (MOHS) algorithm for optimal power flow (OPF) problem. OPF problem is formulated as a nonlinear constrained multiobjective optimization problem where different objectives and different constraints have been considered. Fast elitist non dominated sorting and crowding distance have been used to find and manage the Pareto optimal front. Finally, ...