In this paper, we consider the problem of adaptive traffic control on single junctions with the three following objectives to be minimized: the total waiting time and the number of stops for private vehicles, and a public transport criterion. This problem being modeled as a multi-objective mixed...

Multi-objective optimization algorithms aim at finding Pareto-optimal solutions. Recovering Pareto fronts or Pareto sets from a limited number of function evaluations are challenging problems. A popular approach in the case of expensive-to-evaluate functions is to appeal to metamodels. Kriging...

Various preference-based multi-objective evolutionary algorithms have been developed to help a decision-maker search for his/her preferred solutions to multi-objective problems. In most of the existing approaches the decision-maker preferences are formulated either by mathematical expressions...

Multi-objective optimization problems arise frequently in applications, but can often only be solved approximately by heuristic approaches. Evolutionary algorithms have been widely used to tackle multi-objective problems. These algorithms use different measures to ensure diversity in the...

Pareto Local Search (PLS) is a simple and effective local search method for tackling multi-objective combinatorial optimization problems. It is also a crucial component of many state-of-the-art algorithms for such problems. However, PLS may be not very effective when terminated before...

This paper introduces a novel two-phase supplier selection procedure. Unlike most supplier selection researches, which are decisive based on supplier eligibility at the time of the decision making, the proposed method is based on the long term trend of value, stability, and relationship of...

In this paper, we suggest a new multi-objective artificial bee colony (ABC) algorithm by introducing an elitism strategy. The algorithm uses a fixed-size archive that is maintained based on crowding-distance to store non-dominated solutions found during the search process. In the proposed...

In this paper, we deal with the bi-objective non-convex combined heat and power (CHP) planning problem. A medium and long term planning problem decomposes into thousands of single period (hourly) subproblems and dynamic constraints can usually be ignored in this context. The hourly subproblem...

This paper presents two new dynamic programming (DP) algorithms to find the exact Pareto frontier for the bi-objective integer knapsack problem. First, a property of the traditional DP algorithm for the multi-objective integer knapsack problem is identified. The first algorithm is developed by...

The line-cell (or line-seru) conversion is an innovation of assembly system applied widely in the electronics industry. Its essence is tearing out an assembly line and adopting a mini-assembly unit, called seru (or Japanese style assembly cell). In this paper, we develop a multi-objective...