Eliiyi Türsel, Deniz

Loading...
Profile Picture
Name Variants
Tursel, Deniz
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
Scopus Author ID
Turkish CoHE Profile ID
Google Scholar ID
WoS Researcher ID

Sustainable Development Goals

NO POVERTY1
NO POVERTY
0
Research Products
ZERO HUNGER2
ZERO HUNGER
0
Research Products
GOOD HEALTH AND WELL-BEING3
GOOD HEALTH AND WELL-BEING
0
Research Products
QUALITY EDUCATION4
QUALITY EDUCATION
0
Research Products
GENDER EQUALITY5
GENDER EQUALITY
0
Research Products
CLEAN WATER AND SANITATION6
CLEAN WATER AND SANITATION
0
Research Products
AFFORDABLE AND CLEAN ENERGY7
AFFORDABLE AND CLEAN ENERGY
1
Research Products
DECENT WORK AND ECONOMIC GROWTH8
DECENT WORK AND ECONOMIC GROWTH
1
Research Products
INDUSTRY, INNOVATION AND INFRASTRUCTURE9
INDUSTRY, INNOVATION AND INFRASTRUCTURE
5
Research Products
REDUCED INEQUALITIES10
REDUCED INEQUALITIES
0
Research Products
SUSTAINABLE CITIES AND COMMUNITIES11
SUSTAINABLE CITIES AND COMMUNITIES
3
Research Products
RESPONSIBLE CONSUMPTION AND PRODUCTION12
RESPONSIBLE CONSUMPTION AND PRODUCTION
0
Research Products
CLIMATE ACTION13
CLIMATE ACTION
1
Research Products
LIFE BELOW WATER14
LIFE BELOW WATER
0
Research Products
LIFE ON LAND15
LIFE ON LAND
0
Research Products
PEACE, JUSTICE AND STRONG INSTITUTIONS16
PEACE, JUSTICE AND STRONG INSTITUTIONS
0
Research Products
PARTNERSHIPS FOR THE GOALS17
PARTNERSHIPS 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

JournalCount
24th Mini EURO Conference on Continuous Optimization and Information-Based Technologies in the Financial Sector, MEC EurOPT 20103
20Th Internatıonal Conference, Euro Mını Conference Contınuous Optımızatıon And Knowledge-Based Technologıes, Europt'20082
Computers & Operatıons Research2
Engıneerıng Optımızatıon2
International Journal of Industrial and Systems Engineering2
Current Page: 1 / 4

Scopus Quartile Distribution

Competency Cloud

GCRIS Competency Cloud

Scholarly Output Search Results

Now showing 1 - 10 of 31
  • 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 Ercuement
    In 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 Özge
    Port 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: 18
    Citation - Scopus: 25
    A Vehicle Scheduling Problem With Fixed Trips and Time Limitations
    (Elsevier Science Bv, 2009-01) Eliiyi Türsel, Deniz; Örnek, Mustafa Arslan; Karakutuk, Sadik Serhat
    We 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.
  • Article
    Citation - WoS: 1
    Citation - Scopus: 3
    Supply Chain Management in Apparel Industry: a Transshipment Problem With Time Constraints
    (Ege Univ, 2011) Eliiyi Türsel, Deniz; Yurtkulu, Emine Zehra; Sahin, Dicle Yurdakul
    Supply 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.
  • Article
    Citation - WoS: 6
    Citation - Scopus: 6
    Working Time Constraints in Operational Fixed Job Scheduling
    (Taylor & Francis Ltd, 2009-11-20) Eliiyi Türsel, Deniz; Azizoglu, Meral
    In this study we consider the operational fixed job scheduling problem under working time limitations. The problem has several practical implications in both production and service operations; however the relevant research is scarce. We analyse pre-emptive and non pre-emptive versions of the problem and its special cases. We provide polynomial-time algorithms for some special cases. We show that the non pre-emptive jobs problem is strongly NP-hard, and propose a branch-and-bound algorithm that employs efficient bounding procedures and dominance properties. We conduct a numerical experiment to observe the effects of parameters on the quality of the solution. The results of our computational tests for the branch-and-bound algorithm reveal that our algorithm can solve the instances with up to 100 jobs in reasonable times. To the best of our knowledge our branch-and-bound algorithm is the first optimisation attempt to solve the problem.
  • Master Thesis
    An Integrated Assignment-Routing Problem With Time Windows
    (İzmir Ekonomi Üniversitesi, 2014) Akıcı, Aybike Özdemirel; Eliiyi, Deniz Türsel
    Bu tez çalışmasında İzmir Türkiye'de bulunan bir bağış merkezindeki bir gerçek hayat kamu hizmeti problemi ele alınmıştır. Merkez bağışlanan ürünlerin bağış sahiplerinden toplanılması, bu ürünlerin gelen istekler doğrultusunda ihtiyaç sahibi vatandaşlara atanması ve dağıtımından sorumludur. Atanamayan ürünler tek bir depoda geçici olarak bekletilmektedir. Günlük dağıtım ve toplama için tek araç kullanılmakta, gelen bağışçı ve ihtiyaç sahiplerinin ziyaret edilme saatlerine dair zaman aralıkları bulunmaktadır. Bu çalışmada problem için yeni ve özgün, fayda bazlı atama ve rotalamayı bir arada yapan tamsayılı programlama modelleri önerilmektedir. Modellerde bağışçı ve ihtiyaç sahiplerinin hizmet aldıkları zaman aralıkları bağlayıcı ve bağlayıcı olmayan kısıtlar olarak ele alınmıştır. Bağlayıcı olmayan kısıtlara sahip modelin performansının sayısal olarak değerlendirilmesi için geliştirilen deney tasarımı ve sonuçları ayrıntılarıyla sunulmuş ve tartışılmıştır. Bu tez çalışmasıyla hem rotalama literatürüne yeni ve özgün modellerle katkıda bulunmak, hem de pratik öneme sahip insani bir probleme optimal çözümler getirmek amaçlanmıştır.
  • Master Thesis
    Sales and Returns Forecasting for Inventory Control
    (İzmir Ekonomi Üniversitesi, 2013) Karabağ, Oktay; Eliiyi, Deniz Türsel; Fadıloğlu, Mehmet Murat
    Gelişen çevre duyarlılığı, geleneksel üretim sistemlerini kullanan üreticileri yeni stratejiler benimsemeye zorlamaktadır. Piyasaya verilen ürünlerin kullanımlarından sonra toplanıp, işlenerek tekrar tüketiciye ulaştırılmasına, yeniden üretim (remanufacturing) ismi verilmektedir. Yeniden üretim sistemlerinde talep ve geri dönüş tahmini, satın alma kararları, üretim planlama ve envanter yönetimi vb. gibi yönetim konuları için vazgeçilemez öğelerdir. Bu çalışma, talep ve geri dönüş tahmini için yeni metotlar geliştirmeyi ve mevcut literatürü incelemeyi amaçlamaktadır. İlk olarak, talep tahmini için en bilindik ve uygulaması kolay olan HoltWinters metodu incelenmiştir. Ancak, Gregoryen ve Hicri takvim gibi iki asenkron takvimin ortak etkisi belirli bir pazarda kendini gösterdiğinde, bu metodun talep eğilimini yakalamakta yeterli olmadığı gerçeği fark edilmiştir. Bu nedenle, HoltWinters metodu iki asenkron takvim nedeniyle oluşan sezonluk etkiler dikkate alınarak geliştirilmiştir ve oluşturulan bu yeni yöntem Augmented HoltWinters metodu olarak adlandırılmıştır. İkinci olarak, geri dönüş tahmini için Kelle ve Silver tarafından geliştirilen metotlar incelenmiş ve farklı bir bakış açısıyla yeniden sunulmuşlardır. Kelle ve Silvera ait bu yöntemler durağan talep şartıyla sınırlandırıldıklarından, talebin durağan olmadığı durumlarda etkili olmayacaktır. Bu sorunu gidermek için, ilgili yöntemler durağan olmayan talebe izin veren daha gerçekçi bir bakış açısı ile revize edilmiştir. Son olarak, talep ve geri dönüşler için geliştirilen yeni tahmin yöntemleri önceki halleri ile gerçek zaman serisi kullanılarak karşılaştırılmıştır. Elde edilen sonuçlar, talep ve geri dönüş tahmini için önerilen yeni metotlar kullanıldığında önemli iyileştirmeler sağlanabileceğini göstermiştir.
  • Article
    Citation - WoS: 8
    Citation - Scopus: 5
    Operational 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 Ercuement
    In 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.
  • Article
    Citation - WoS: 4
    Citation - Scopus: 8
    Storage Optimization for Export Containers in the Port of Izmir
    (Svenciliste U Zagrebu, Fakultet Prometnih Znanosti, 2013-07-19) Eliiyi Türsel, Deniz; Mat, Gamze; Ozmen, Burcu
    This study considers a real-life export container storage problem at an important container terminal in the Port of Izmir, Turkey. Currently, the container storage decisions at the port are taken by operators manually, which leads to continuous unnecessary re-handling movements of the containers. High transportation costs, waste of time, and inefficient capacity utilization in the container storage area are the consequences of non-optimal decisions. The main goal of this study is to minimize the transportation costs and the number of re-handling moves while storing the export containers at the terminal yard. The problem has been formulated in two stages. While the first stage assigns the containers of the same vessel to a group of yard bays via an optimization model, the second stage decides on the exact location of each container with the help of an efficient heuristic approach. The experimental results with real data are presented and discussed.