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
Multiobjective traveling salesperson problem on Halin graphs
Date
2009-07-01
Author
Ozpeynirci, Ozgur
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
212
views
0
downloads
Cite This
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 solvable combinations.
Subject Keywords
Management Science and Operations Research
,
Modelling and Simulation
,
Information Systems and Management
URI
https://hdl.handle.net/11511/57206
Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
DOI
https://doi.org/10.1016/j.ejor.2008.04.011
Collections
Department of Industrial Engineering, Article
Suggestions
OpenMETU
Core
Bank asset and liability management under uncertainty
Oguzsoy, CB; Güven, Sibel (Elsevier BV, 1997-11-01)
This study presents a multiperiod stochastic linear simple recourse model for asset and liability management in banking. The model determines the portfolio of assets and liabilities over the planning horizon given a set of deterministic rates of returns of investments and costs of borrowings, and a set of random outstanding deposit levels, liquidity and total reserve requirements with a given discrete probability distribution. The intention is to develop an optimization tool to assure sustained profitabilit...
THE SCHEDULING OF ACTIVITIES TO MAXIMIZE THE NET PRESENT VALUE OF PROJECTS - COMMENT
SEPIL, C (Elsevier BV, 1994-02-24)
In a recent paper, Elmaghraby and Herroelen have presented an algorithm to maximize the present value of a project. Here, with the help of an example, it is shown that the algorithm may not find the optimal solution.
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...
JOB-SHOP SCHEDULING UNDER A NONRENEWABLE RESOURCE CONSTRAINT
TOKER, A; KONDAKCI, S; ERKIP, N (JSTOR, 1994-08-01)
In this paper we consider the job shop scheduling problem under a discrete non-renewable resource constraint. We assume that jobs have arbitrary processing times and resource requirements and there is a unit supply of the resource at each time period. We develop an approximation algorithm for this problem and empirically test its effectiveness in finding the minimum makespan schedules.
A NEW HEURISTIC APPROACH FOR THE MULTIITEM DYNAMIC LOT-SIZING PROBLEM
KIRCA, O; KOKTEN, M (Elsevier BV, 1994-06-09)
In this paper a framework for a new heuristic approach for solving the single level multi-item capacitated dynamic lot sizing problem is presented. The approach uses an iterative item-by-item strategy for generating solutions to the problem. In each iteration a set of items are scheduled over the planning horizon and the procedure terminates when all items are scheduled. An algorithm that implements this approach is developed in which in each iteration a single item is selected and scheduled over the planni...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
O. Ozpeynirci and M. M. Köksalan, “Multiobjective traveling salesperson problem on Halin graphs,”
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
, pp. 155–161, 2009, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/57206.