Eliiyi Türsel, Deniz
Loading...

Profile URL
Name Variants
Tursel, Deniz
Eliiyi, D. T.
Eliiyi, Deniz Türsel
Eliiyi, Deniz T.
Eliiyi, D. T.
Eliiyi, Deniz Türsel
Eliiyi, Deniz T.
Job Title
Email Address
deniz.eliiyi@ieu.edu.tr
Main Affiliation
05.09. Industrial Engineering
Status
Former Staff
Website
ORCID ID
Scopus Author ID
Turkish CoHE Profile ID
Google Scholar ID
WoS Researcher ID
Sustainable Development Goals
1NO POVERTY
0
Research Products
2ZERO HUNGER
0
Research Products
3GOOD HEALTH AND WELL-BEING
0
Research Products
4QUALITY EDUCATION
0
Research Products
5GENDER EQUALITY
0
Research Products
6CLEAN WATER AND SANITATION
0
Research Products
7AFFORDABLE AND CLEAN ENERGY
1
Research Products
8DECENT WORK AND ECONOMIC GROWTH
1
Research Products
9INDUSTRY, INNOVATION AND INFRASTRUCTURE
5
Research Products
10REDUCED INEQUALITIES
0
Research Products
11SUSTAINABLE CITIES AND COMMUNITIES
3
Research Products
12RESPONSIBLE CONSUMPTION AND PRODUCTION
0
Research Products
13CLIMATE ACTION
1
Research Products
14LIFE BELOW WATER
0
Research Products
15LIFE ON LAND
0
Research Products
16PEACE, JUSTICE AND STRONG INSTITUTIONS
0
Research Products
17PARTNERSHIPS FOR THE GOALS
0
Research Products

Documents
58
Citations
1051
h-index
18

Documents
53
Citations
853

Scholarly Output
34
Articles
18
Views / Downloads
94/165
Supervised MSc Theses
4
Supervised PhD Theses
0
WoS Citation Count
287
Scopus Citation Count
366
Patents
0
Projects
0
WoS Citations per Publication
8.44
Scopus Citations per Publication
10.76
Open Access Source
11
Supervised Theses
4
| Journal | Count |
|---|---|
| 24th Mini EURO Conference on Continuous Optimization and Information-Based Technologies in the Financial Sector, MEC EurOPT 2010 | 3 |
| 20Th Internatıonal Conference, Euro Mını Conference Contınuous Optımızatıon And Knowledge-Based Technologıes, Europt'2008 | 2 |
| Computers & Operatıons Research | 2 |
| Engıneerıng Optımızatıon | 2 |
| International Journal of Industrial and Systems Engineering | 2 |
Current Page: 1 / 4
Scopus Quartile Distribution
Competency Cloud

31 results
Scholarly Output Search Results
Now showing 1 - 10 of 31
Article Citation - WoS: 18Citation - Scopus: 25A Vehicle Scheduling Problem With Fixed Trips and Time Limitations(Elsevier Science Bv, 2009-01) Eliiyi Türsel, Deniz; Örnek, Mustafa Arslan; Karakutuk, Sadik SerhatWe consider minimum-cost scheduling of different vehicle types on a predetermined set of one-way trips. Trips have predetermined ready times, deadlines and associated demands. All trips Must be performed. The total time of operations on any vehicle is limited. We develop a mixed integer model to find the optimal number of vehicles at a minimum cost. Based on the hard nature of the problem, we propose six heuristics. Computational results reveal that heuristics return exceptionally good solutions for problem instances with up to 100 jobs in very small computation times, and are likely to perform well for larger instances. (C) 2008 Elsevier B.V. All rights reserved.Book Part Improving Performance and Customer Satisfaction Via the Use of Information Technologies in Public Transportation and Logistics Systems(IGI Global, 2012) Yurdakul, Dicle; Eliiyi, D. T.During the last two decades, the enhancements in Information Technologies (IT) and the extension of their usage have transformed completely the ways of doing business. In addition to providing a competitive advantage, the utilization of information technologies help businesses to organize all information related with their customers, increasing their level of satisfaction from the good or service provided, support decision making processes and increase the collaboration between supply chain members. Due to the increase in overseas trade and the globalization trends, the usage and importance of Information Technologies in transportation have risen up extremely. This chapter aims to emphasize the growing need for and role of IT in Turkish public logistics systems, present examples of these systems' implementation around the world, and specifc benefts to be gained in terms of effcient operations and improved performance, proftability, customer satisfaction, and social welfare. In this respect, the authors aim to draw attention to the signifcance of the management Information Systems in different areas of public service. © 2025 Elsevier B.V., All rights reserved.Conference Object Optimal Berth Allocation With Variable Job Scheduling(Vilnius Gediminas Technical Univ Press, Technika, 2008) Eliiyi Türsel, Deniz; Korkmaz, Aslihan Gizem; Cicek, Abdullah ErcuementIn this study, the problem of Optimal Berth Allocation, which involves the assignment of ships arriving at the port to the appropriate berths within their time windows, while maximizing the total number of ships served is discussed. The problem is treated as a Variable Job Scheduling Problem and an integer programming model is developed. To contribute to the practical use of the study, the eligibility constraint is taken into consideration. Proving that the model is NP-hard, genetic algorithm is used to approximate the optimal solution. The formulated model is implemented and a dataset is generated. Using this dataset an experiment is conducted by changing the parameters of the genetic algorithm model. The initial run results of the tests are provided.Conference Object Simultaneous Allocation of Continuous Berths and Mobile Cranes With Variable Handling Times(Vilnius Gediminas Technical Univ Press, Technika, 2008) Eliiyi Türsel, Deniz; Oezcam, Burcu; Ada, Erhan; Gueldogan, Evrim; Sevil, Bengue; Yumurtacı Hüseyinoğlu, Işık ÖzgePort management is a strategic issue for the developing economies. Its activities directly influence the trade volume of the region where the port is located, increase the investment in the region, and contribute to the overall economic development. There are many activities and decisions to be arranged and managed in a port. In this paper, one of the most important port management activities, Berth Allocation Problem, is studied in detail, to reduce congestion in the port. The contribution of the study is based on simultaneous allocation of continuous berths and mobile cranes. The approach is applied to the Port of Izmir and promising preliminary results of our study are presented.Article Citation - WoS: 1Citation - Scopus: 3Supply Chain Management in Apparel Industry: a Transshipment Problem With Time Constraints(Ege Univ, 2011) Eliiyi Türsel, Deniz; Yurtkulu, Emine Zehra; Sahin, Dicle YurdakulSupply chain management is one of the main sources of competitive advantage for companies. As a useful tool for inventory and transportation management in supply chains, transshipment points provide an effective mechanism for correcting discrepancies between demand and available inventory. This study aims to model the transshipment problem of a company in the apparel industry with multiple subcontractors and customers, and a transshipment depot in between. Unlike a typical transshipment problem that considers only the total cost of transportation, our model also considers the supplier lead times and the customer due dates in the system and it can be used for both supplier selection and timely distribution planning. The proposed model can also be adapted easily by other companies in the industry.Conference Object Citation - WoS: 2An Assignment and Routing Problem With Time Windows and Capacity Restriction(Elsevier Science Bv, 2012-10) Ozdemirel, Aybike; Gokgur, Burak; Eliiyi Türsel, DenizIn under-developed or developing countries, the needs of indigent population are of a pressing nature most of the time. One of the objectives of municipal authorities is to collect donations and distribute the donated items and funds to indigent residents. This task requires a good matching of donations and needs for effectively meeting the needs of recipients. The distribution route is also important for time/cost-effective operations. This study presents a mixed integer programming model that integrates these matching and routing problems. Because of the humanitarian nature of the problem, the main objective is to maximize the utility of the assignment of the donated items. There are several criteria regarding donations and recipients that affect the utility of an assignment, such as the travel time between the location of the donation and the candidate recipient, income level, age, and the number of household of the candidate recipient, the recipient's previous usage of this service, and the age of donated item. Priorities among criteria are set by making a series of judgments based on pairwise comparisons as in the Analytical Hierarchy Process. We consider a real life problem for a district in Izmir, Turkey. The planning period is taken as a working day, and there are time windows in which donors and residents are willing to be served, i.e., the donor must be visited on a specified time interval during the working day. A single truck with a limited capacity is to distribute the donations. The output of the mathematical model is the optimal assignment of the items and the visiting sequence of individuals to maximize total utility. We present our model along with numerical examples and results. (C) 2012. The authors. Published by Elsevier Ltd. Selection and/or peer-review under responsibility of the ProgramArticle Citation - WoS: 17Citation - Scopus: 18Economic and Environmental Viability Analysis for a Photovoltaic-Powered Led System in Tunnel Illumination(Sila Science, 2011) Eliiyi Türsel, Deniz; Caylan, Tayfun; Eliiyi, UgurIn this study, we conduct an economical and environmental viability analysis for a photovoltaic-powered tunnel illumination system in Aydin, Turkey. Recently, the rapid depletion of fossil fuels and global warming concerns render the renewable energy resources as major solutions for the global energy problem. Our study focuses on solar energy and its application to tunnel illumination. One of the longest tunnels in Turkey is considered for the analysis, and three alternative systems are proposed for replacing the current system in the tunnel that uses the grid power. A detailed cost and feasibility analysis is performed for the alternatives, taking into account the time value of money in an inflationary economy. Net present worth, payback period and internal rate of return calculations are used for analytical purposes. The environmental viability is assessed via the computation of resulting reduction in CO2 emissions by the proposed systems. Results indicate that the proposed systems are more advantageous than the existing one.Master Thesis Online Stacking Policies for Container Storage Optimization(İzmir Ekonomi Üniversitesi, 2014) Güven, Ceyhun; Eliiyi, Deniz TürselKonteyner terminallerinde konteyner sahası, vinçler ve araçlar olmak üzere üç önemli kaynak bulunmaktadır. Terminalin temel amacı değişik operasyonları gerçekleştirirken bu kaynakların etkin kullanımını sağlamaktır. Konteynerler konteyner depolama sahasını verimli bir şekilde kullanmak için birbirleri üzerine istiflenirler. Ancak istifleme vinçleri sadece istifin en üstündeki konteynerlere direkt olarak erişebilmektedir. Bunun sonucunda bir başka konteynerin altında depolanmış olan konteynere ulaşmak için gerekli olan yeniden elleçleme hareketi meydana gelir. Bu tezde konteyner terminallerindeki depolama sahası verimliliğini artırmak üzere ihraç konteynerler için konteyner depolama optimizasyonu problemi ele alınmıştır. Problem için farklı istifleme politikaları önerilmiş ve benzetim yolu ile İzmir Limanı'ndan alınan gerçek veri setleri ile çalıştırılmıştır. Sonuçlar dört farklı performans ölçütü üzerinden karşılaştırılmış ve ayrıntılı bir şekilde tartışılmıştır.Research Project Aralık Çizelgelemede Kapasite Planlama ve Kapasite Artırımı Problemleri(2012) Eliiyi, Deniz Türsel[Abstract Not Available]Article Citation - WoS: 8Citation - Scopus: 5Operational Variable Job Scheduling With Eligibility Constraints: a Randomized Constraint-Graph Approach(Vilnius Gediminas Tech Univ, 2009-06-30) Eliiyi Türsel, Deniz; Korkmaz, Aslihan Gizem; Cicek, Abdullah ErcuementIn this study, we consider the problem of Operational Variable Job Scheduling, also referred to as parallel machine scheduling with time windows. The problem is a more general version of the Fixed Job Scheduling problem, involving a Lime window for each job larger than its processing time. The objective is to find the optimal subset of the jobs that can be processed. An interesting application area ties in Optimal Berth Allocation, which involves the assignment of vessels arriving at the port to appropriate berths within their time windows, while maximizing the total profit from the served vessels. Eligibility constraints are also taken into consideration. We develop an integer programming model for the problem. We show that the problem is NP-hard, and develop a constraint-graph-based construction algorithm for generating near-optimal solutions. We use genetic algorithm and other improvement algorithms to enhance the solution. Computational experimentation reveals that our algorithm generates very high quality solutions in very small computation times.

