Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Exact solution approaches for the directed bi-objective chinese postman problem
Download
index.pdf
Date
2018-06-01
Author
Eroglu, Ezgi
Azizoğlu, Meral
Metadata
Show full item record
Item Usage Stats
226
views
93
downloads
Cite This
In this study, we consider a directed bi-objective Chinese Postman Problem with two additive objectives (like total cost and total distance) and propose two solution approaches to generate all non-dominated objective vectors. The first approach, namely classical approach, uses the optimal solutions of the mixed integer linear programs and generates the non-dominated objective vectors’ set sequentially. The second approach, namely branch and bound algorithm takes its spirit from the optimal solutions of the linear programming relaxations and generates the non-dominated objective vectors’ set simultaneously. The results of our extensive computational study show that our approaches are capable of solving large-sized problem instances in reasonable times.
Subject Keywords
Bi-objective programming
,
Chinese postman problem
,
Mixed integer linear programming
,
Classical approach
,
Branch and bound algorithm
,
İki-objektifli programlama
,
Çinli postacı problemi
,
Karmaşık tam sayılı doğrusal programlama
,
Klasik yaklaşım
,
Dal ve sınır algoritması
URI
https://hdl.handle.net/11511/83903
https://dergipark.org.tr/en/pub/endustrimuhendisligi/issue/46685/583931
Journal
Endüstri Mühendisliği
Collections
Department of Industrial Engineering, Article
Suggestions
OpenMETU
Core
Optimal Inverse Kinematic Solutions for Redundant Manipulators by Using Analytical Methods to Minimize Position and Velocity Measures
Özgören, Mustafa Kemal (2013-08-01)
Two methods are presented to obtain optimal inverse kinematic solutions for redundant manipulators, according to two different performance criteria stipulated in the position and velocity levels. Both methods are analytical throughout except their final stages, which involve the numerical solution of a simplified minimization problem in a position-level case and the numerical integration of a set of differential equations derived optimally in a velocity-level case. Owing to the analytical nature of the meth...
Optimising a nonlinear utility function in multi-objective integer programming
Ozlen, Melih; Azizoğlu, Meral; Burton, Benjamin A. (2013-05-01)
In this paper we develop an algorithm to optimise a nonlinear utility function of multiple objectives over the integer efficient set. Our approach is based on identifying and updating bounds on the individual objectives as well as the optimal utility value. This is done using already known solutions, linear programming relaxations, utility function inversion, and integer programming. We develop a general optimisation algorithm for use with k objectives, and we illustrate our approach using a tri-objective i...
EFIE-Tuned Testing Functions for MFIE and CFIE
Karaosmanoglu, Bariscan; Ergül, Özgür Salih (Institute of Electrical and Electronics Engineers (IEEE), 2017-01-01)
A recently developed numerical technique for improving the accuracy of the magnetic-field integral equation and the combined-field integral equation with low-order discretizations using the Rao-Wilton-Glisson functions is demonstrated on iterative solutions of large-scale complex problems, in order to prove the effectiveness of the proposed strategy as an alternative way for accurate and efficient analysis of multifrequency applications.
Numerical Aspects of POD-Based Reduced-Order Modeling forDarcy-Brinkman Equations
Güler Eroğlu, Fatma; Kaya Merdan, Songül (2018-10-21)
We propose, analyze and test a reduced order modelling with proper orthogonal decomposition (POD) method for the modeling to flows governed by double diffusive convection, which models flow driven by two potentials with different rates of diffusion. We present a theoretical analysis of the method and give results for various numerical tests on benchmark problems that will demonstrate both the theory and the effectiveness of the proposed method.
Numerical methods for multiphysics flow problems
Belenli Akbaş, Mine; Kaya Merdan, Songül; Rebholz, Leo G.; Department of Mathematics (2016)
In this dissertation, efficient and reliable numerical algorithms for approximating solutions of multiphysics flow problems are investigated by using numerical methods. The interaction of multiple physical processes makes the systems complex, and two fundamental difficulties arise when attempting to obtain numerical solutions of these problems: the need for algorithms that reduce the problems into smaller pieces in a stable and accurate way and for large (sometimes intractable) amount of computational resou...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
E. Eroglu and M. Azizoğlu, “Exact solution approaches for the directed bi-objective chinese postman problem,”
Endüstri Mühendisliği
, pp. 15–30, 2018, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/83903.