Finding highly preferred points for multi-objective integer programs

Date

2014-01-01

Author

LOKMAN, BANU
Köksalan, Mustafa Murat

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

46
views

0
downloads

This article develops exact algorithms to generate all non-dominated points in a specified region of the criteria space in Multi-Objective Integer Programs (MOIPs). Typically, there are too many non-dominated points in large MOIPs and it is not practical to generate them all. Therefore, the problem of generating non-dominated points in the preferred region of the decision-maker is addressed. To define the preferred region, the non-dominated set is approximated using a hyper-surface. A procedure is developed that then finds a preferred hypothetical point on this surface and defines a preferred region around the hypothetical point. Once the preferred region is defined, all non-dominated points in that region are generated. The performance of the proposed approach is tested on multi-objective assignment, multi-objective knapsack, and multi-objective shortest path problems with three and four objectives. Computational results show that a small set of non-dominated points is generated that contains highly preferred points in a reasonable time.

Subject Keywords

Industrial and Manufacturing Engineering

URI

https://hdl.handle.net/11511/57666

Journal

IIE TRANSACTIONS

DOI

https://doi.org/10.1080/0740817x.2014.882532

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

APPLICATION OF 3 NONLINEAR-PROGRAMMING TECHNIQUES IN OPTIMIZING MACHINING CONDITIONS ESKICIOGLU, AM; ESKICIOGLU, H (SAGE Publications, 1992-01-01) Mathematical models used for determining optimal machining conditions are non-linear functions subject to non-linear constraints. In this paper models for unit production cost and unit production time for multi-pass milling operations are developed, taking cutting speed, depth of cut, feed and number of passes as design variables. The problem is then solved by three non-linear programming methods, namely the generalized reduced gradient (GRG) method, the sequential unconstrained minimization technique (SUMT...
Application of genetic algorithms to geometry optimization of microclusters: A comparative study of empirical potential energy functions for silicon Erkoc, S; Leblebicioğlu, Mehmet Kemal; Halıcı, Uğur (Informa UK Limited, 2003-01-01) Evolutionary computation techniques (in particular, genetic algorithms) have been applied to optimize the structure of microclusters. Various empirical potential energy functions have been used to describe the interactions among the atoms in the clusters. A comparative study of silicon microclusters has been performed.
Analysis of a deterministic demand production/inventory system under nonstationary supply uncertainty Gullu, R; Onol, E; Erkip, N (Informa UK Limited, 1997-08-01) In this article we investigate a periodic review inventory model under deterministic dynamic demand and supply unavailability. In a given period, supply is either available or completely unavailable with given probabilities. Supply unavailability probabilities are nonstationary over time. We show the optimality of an order-up-to level policy, and obtain a newsboy-like formula that determines the optimal order-up-to levels. Our formula would provide guidence as to the appropriate amount of inventory to stock...
Genetic Algorithm Application to the Structural Properties of Si-Ge Mixed Clusters Dugan, Nazim; Erkoç, Şakir (Informa UK Limited, 2009-01-01) Optimum geometries of silicon-germanium (Si-Ge) clusters are found using a single parent genetic algorithm. 100 atom and 150 atom clusters are studied with some variety of compositions and initial geometries. Total interaction energies, distances of Si and Ge atoms to the cluster centers, and average bond lengths are calculated. Si-core Ge-shell geometry is found to be favorable compared to other geometries.
Finding a representative nondominated set for multi-objective mixed integer programs Ceyhan, Gokhan; Koksalan, Murat; Lokman, Banu (2019-01-01) In this paper, we develop algorithms to find small representative sets of nondominated points that are well spread over the nondominated frontiers for multi-objective mixed integer programs. We evaluate the quality of representations of the sets by a Tchebycheff distance-based coverage gap measure. The first algorithm aims to substantially improve the computational efficiency of an existing algorithm that is designed to continue generating new points until the decision maker (DM) finds the generated set sat...

Citation Formats

B. LOKMAN and M. M. Köksalan, “Finding highly preferred points for multi-objective integer programs,” IIE TRANSACTIONS, pp. 1181–1195, 2014, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/57666.