Convergence speed and diversity of nondominated solutions are two important performance indicators for Multi-Objective Evolutionary Algorithms (MOEAs). In this paper, we propose a Resource Allocation (RA) model based on Game Theory to accelerate the convergence speed of MOEAs, and a novel...

This paper presents a backward state reduction dynamic programming algorithm for generating the exact Pareto frontier for the bi-objective integer knapsack problem. The algorithm is developed addressing a reduced problem built after applying variable fixing techniques based on the core concept....

Recently, there is a growing concern about the environmental and social footprint of business operations. While most of the papers in the field of supply chain network design focus on economic performance, recently, some studies have considered environmental dimensions.

This paper discusses a manufacturing inventory model with shortages where carrying cost, shortage cost, setup cost and demand quantity are considered as fuzzy numbers. The fuzzy parameters are transformed into corresponding interval numbers and then the interval objective function has been...

This paper investigates a fuzzy multi-objective vendor selection program under lean procurement based on cost minimization, delivery schedule violation minimization, and maximizing the quality level of the purchased quantity. Specifically, the paper incorporates the vendor production capacity...

Lack of discrimination power and poor weight dispersion remain major issues in Data Envelopment Analysis (DEA). Since the initial multiple criteria DEA (MCDEA) model developed in the late 1990s, only goal programming approaches; that is, the GPDEA-CCR and GPDEA-BCC were introduced for solving...

A simple augmented ∊-constraint (SAUGMECON) method is put forward to generate all non-dominated solutions of multi-objective integer programming (MOIP) problems. The SAUGMECON method is a variant of the augmented ∊-constraint (AUGMECON) method proposed in 2009 and improved in 2013 by...

In most multi-objective optimization problems we aim at selecting the most preferred among the generated Pareto optimal solutions (a subjective selection among objectively determined solutions). In this paper we consider the robustness of the selected Pareto optimal solution in relation to...