A Method for Generating a Well-Distributed Pareto Set in Multiple Objective Mixed Integer Linear Programs Based on the Decision Maker's Initial Aspiration Level

作者：Razavyan S^*

来源：Asia Pacific Journal of Operational Research, 2016, 33(4): 1650031.

DOI：10.1142/S0217595916500317

• Multiple objective programming
• integer programming
• Pareto optimal
• discrete representation
• ideal-point

This paper attempt to generate a representative subset of the Pareto optimal set for multiple objective mixed integer linear programming problem using the weighted L-1 norm distance. The procedure presented in this paper is somewhat similar to the one used in the ideal-point methods and its aim is to generate at each iteration the closest-points to the ideal vector corresponding to the decision maker's initial aspiration level for a new tradeoff parameter. Unlike most of the known algorithms for generating a discrete representation of the Pareto optimal set, the procedure generates at each iteration a nondominated point by solving only one mixed integer linear programming problem. The obtained solution minimizes the weighted L1 norm distance to the ideal vector with respect to the distance between the ideal vector and previously found vectors. More generally, this approach is able to generate all Pareto optimal solutions, where all of the decision variables are restricted to be integer. In order to explain the presented details, several illustrative examples are provided.

• 出版日期2016-8