17th EURO Mini Conference "Continuous Optimization in the Industry", Pecs, Hungary, June 29-July 1, 2005

2008-12-16
Illes, Tibor
Lopez, Marco A.
Terlaky, Tamas
Voeroes, Jozsef
Weber, Gerhard Wilhelm

Suggestions

Interactive algorithms for a broad underlying family of preference functions
Karakaya, Gülşah; AHİPAŞAOĞLU, Selin Damla (Elsevier BV, 2018-02-16)
In multi-criteria decision making approaches it is typical to consider an underlying preference function that is assumed to represent the decision maker's preferences. In this paper we introduce a broad family of preference functions that can represent a wide variety of preference structures. We develop the necessary theory and interactive algorithms for both the general family of the preference functions and for its special cases. The algorithms guarantee to find the most preferred solution (point) of the ...
Reinforcement learning with internal expectation for the random neural network
Halıcı, Uğur (Elsevier BV, 2000-10-01)
The reinforcement learning scheme proposed in Halici (1977) (Halici, U., 1997. Journal of Biosystems 40 (1/2), 83-91) for the random neural network (Gelenbe, E., 1989b. Neural Computation 1 (4), 502-510) is based on reward and performs well for stationary environments. However: when the environment is not stationary it suffers from getting stuck to the previously learned action and extinction is not possible. In this paper, the reinforcement learning scheme is extended by introducing a weight update rule wh...
Multi-objective integer programming: A general approach for generating all non-dominated solutions
Oezlen, Melih; Azizoğlu, Meral (Elsevier BV, 2009-11-16)
In this paper we develop a general approach to generate all non-dominated solutions of the multi-objective integer programming (MOIP) Problem. Our approach, which is based on the identification of objective efficiency ranges, is an improvement over classical epsilon-constraint method. Objective efficiency ranges are identified by solving simpler MOIP problems with fewer objectives. We first provide the classical epsilon-constraint method on the bi-objective integer programming problem for the sake of comple...
Considering manufacturing cost and scheduling performance on a CNC turning machine
Gürel, Sinan (Elsevier BV, 2007-02-16)
A well known industry application that allows controllable processing times is the manufacturing operations on CNC machines. For each turning operation as an example, there is a nonlinear relationship between the manufacturing cost and its required processing time on a CNC turning machine. If we consider total manufacturing cost (F-1) and total weighted completion time (F-2) objectives simultaneously on a single CNC machine, making appropriate processing time decisions is as critical as making job sequencin...
Multiobjective traveling salesperson problem on Halin graphs
Ozpeynirci, Ozgur; Köksalan, Mustafa Murat (Elsevier BV, 2009-07-01)
In this paper, we study traveling salesperson (TSP) and bottleneck traveling salesperson (BTSP) problems on special graphs called Halin graphs. Although both problems are NP-Hard on general graphs, they are polynomially solvable on Halin graphs. We address the multiobjective versions of these problems. We show computational complexities of finding a single nondominated point as well as finding all nondominated points for different objective function combinations. We develop algorithms for the polynomially s...
Citation Formats
T. Illes, M. A. Lopez, T. Terlaky, J. Voeroes, and G. W. Weber, “17th EURO Mini Conference “Continuous Optimization in the Industry”, Pecs, Hungary, June 29-July 1, 2005,” EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, pp. 771–772, 2008, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/57259.