An interactive solution approach for a bi-objective semi-desirable location problem

Date

2008-10-01

Author

Karasakal, Esra

Metadata

Show full item record

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

Item Usage Stats

81
views

0
downloads

In this study, we consider a semi-desirable facility location problem in a continuous planar region considering the interaction between the facility and the existing demand points. A facility can be defined as semi-desirable if it has both undesirable and desirable effects to the people living in the vicinity. Our aim is to maximize the weighted distance of the facility from the closest demand point as well as to minimize the service cost of the facility. The distance between the facility and the demand points is measured with the rectilinear metric. For the solution of the problem, a three-phase interactive geometrical branch and bound algorithm is suggested to find the most preferred efficient solution. In the first two phases, we aim to eliminate the parts of the feasible region the inefficiency of which can be proved. The third phase has been suggested for an interactive search in the remaining regions with the involvement of a decision maker (DM). In the third phase, the DM is given the opportunity to use either an exact or an approximate procedure to carry out the search. The exact procedure is based on the reference point approach and guarantees to find an efficient point as the most preferred solution. On the other hand, in the approximate procedure, a hybrid methodology is used to increase the efficiency of the reference point approach. The approximate procedure can be used when the DM prefers to see locally efficient solutions so as to save computation time. We demonstrate the performance of the proposed method through example problems.

Subject Keywords

Management Science and Operations Research, Control and Optimization, Applied Mathematics, Computer Science Applications

URI

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

Journal

JOURNAL OF GLOBAL OPTIMIZATION

DOI

https://doi.org/10.1007/s10898-007-9237-y

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

An adaptive fully discontinuous Galerkin level set method for incompressible multiphase flows KARAKUS, Ali; WARBURTON, Tim; AKSEL, MEHMET HALUK; Sert, Cüneyt (Emerald, 2018-01-01) Purpose This study aims to focus on the development of a high-order discontinuous Galerkin method for the solution of unsteady, incompressible, multiphase flows with level set interface formulation.
A review of hierarchical facility location models Sahin, Guvenc; Süral, Haldun (Elsevier BV, 2007-08-01) In this study, we review the hierarchical facility location models. Although there have been a number of review papers on hierarchical facility problems, a comprehensive treatment of models has not been provided since the mid-80s. This review fills the gap in the literature. We first classify the hierarchical facility problems according to the features of systems studied, which are based on flow pattern, service availability at each level of the hierarchy, and spatial configuration of services in addition t...
On the classical Maki-Thompson rumour model in continuous time Belen, Selma; Kropat, Erik; Weber, Gerhard Wilhelm (Springer Science and Business Media LLC, 2011-03-01) In this paper, the Maki-Thompson model is slightly refined in continuous time, and a new general solution is obtained for each dynamics of spreading of a rumour. It is derived an equation for the size of a stochastic rumour process in terms of transitions. We give new lower and upper bounds for the proportion of total ignorants who never learned a rumour and the proportion of total stiflers who either forget the rumour or cease to spread the rumour when the rumour process stops, under general initial condit...
A conic quadratic formulation for a class of convex congestion functions in network flow problems Gürel, Sinan (Elsevier BV, 2011-06-01) In this paper we consider a multicommodity network flow problem with flow routing and discrete capacity expansion decisions. The problem involves trading off congestion and capacity assignment (or expansion) costs. In particular, we consider congestion costs involving convex, increasing power functions of flows on the arcs. We first observe that under certain conditions the congestion cost can be formulated as a convex function of the capacity level and the flow. Then, we show that the problem can be effici...
AN ALGEBRAIC APPROACH TO SUPERVISORY CONTROL INAN, K (Springer Science and Business Media LLC, 1992-01-01) Supervisory control problems are formulated in terms of a process model where the mechanism of control is expressed in terms of an algebraic operator with the plant and supervision processes as its arguments. The solution subspaces for supervisory processes restrict the observation and the control capability of supervision. The main result corresponds to decentralized marked supervision under partial observations, and specific cases are derived from this result in a unified, algebraic way. The result and it...

Citation Formats

E. Karasakal, “An interactive solution approach for a bi-objective semi-desirable location problem,” JOURNAL OF GLOBAL OPTIMIZATION, pp. 177–199, 2008, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/47472.