Arşiv logosu
  • Türkçe
  • English
  • Giriş
    Yeni kullanıcı mısınız? Kayıt için tıklayın. Şifrenizi mi unuttunuz?
Arşiv logosu
  • Koleksiyonlar
  • Sistem İçeriği
  • Analiz
  • Talep/Soru
  • Türkçe
  • English
  • Giriş
    Yeni kullanıcı mısınız? Kayıt için tıklayın. Şifrenizi mi unuttunuz?
  1. Ana Sayfa
  2. Yazara Göre Listele

Yazar "Basligil, Huseyin" seçeneğine göre listele

Listeleniyor 1 - 3 / 3
Sayfa Başına Sonuç
Sıralama seçenekleri
  • [ N/A ]
    Öğe
    JOB SCHEDULING WITH THE HELP OF DOMINANCE PROPERTIES AND GENETIC ALGORITHM ON HYBRID FLOW SHOP PROBLEM
    (Yildiz Technical Univ, 2015) Alcan, Pelin; Basligil, Huseyin
    Products are accessed easier with the industrial revolution. Product accessibility increases the customer demand. Consequently, to satisfy increased customer demands companies expand their manufacturing capacities. After a literature review, we determined that there is hardly any study on unrelated parallel machine and set up time constrained Hybrid Flow Shop problems. Specifically, the techniques, i.e, dominance properties, that help heuristics methods are not used. In almost all studies, either heuristics or meta-heuristics methods are applied. The problem complexity plays an important role in selecting the solution methodologies. In this dissertation, genetic algorithm, which is an evolutionary algorithm, with dominance property is used to solve the proposed problem.
  • [ N/A ]
    Öğe
    A META-HEURISTIC APPROACH FOR IPPS PROBLEM
    (World Scientific Publ Co Pte Ltd, 2016) Alcan, Pelin; Uslu, Mehmet Fatih; Basligil, Huseyin
    In this paper, we focused on the Integrated Process Planning and Scheduling (IPPS) which was an example of job-shop scheduling problem. Several approaches were proposed to solve this problem and Ant Colony Optimization (ACO) was one of the widely used approaches. Examining the articles in which ACO algorithm was described and applied to the IPPS problem gave us an insight of current performance of optimization algorithms to this problem. We then proposed a Genetic Algorithm (GA) for the problem and implemented both algorithms, ACO and GA, in Javascript. According to the results, increasing the running time of GA leaded to more optimal results than ACO. In addition, GA found better results compared to ACO in small-scale problems. On the other hand, ACO performed better than GA in limited time or in bigger problems. In this paper, we proposed a GA approach for IPPS problems. Our chromosome model had 2 parts; first part represented machines of processes and second part showed the orders of the jobs. We applied different mutation/crossover types to these parts and then determined better parameters with numerous experiences. Also, we created an iOS application for visually comparing this GA approach with an ACO algorithm previously proposed. Our GA approach gave better results in some problem types. Our application could be downloaded in the following link (iPad was recommended): https://itunes.apple.com/co/app/ipps-solver/id876097527? l=en&mt=8
  • [ N/A ]
    Öğe
    A meta-heuristic approach for ipps problem
    (World Scientific Publishing Co. Pte Ltd, 2016) Alcan, Pelin; Uslu, Mehmet Fatih; Basligil, Huseyin
    In this paper, we focused on the Integrated Process Planning and Scheduling (IPPS) which was an example of job-shop scheduling problem. Several approaches were proposed to solve this problem and Ant Colony Optimization (ACO) was one of the widely used approaches. Examining the articles in which ACO algorithm was described and applied to the IPPS problem gave us an insight of current performance of optimization algorithms to this problem. We then proposed a Genetic Algorithm (GA) for the problem and implemented both algorithms, ACO and GA, in Javascript. According to the results, increasing the running time of GA leaded to more optimal results than ACO. In addition, GA found better results compared to ACO in small-scale problems. On the other hand, ACO performed better than GA in limited time or in bigger problems. In this paper, we proposed a GA approach for IPPS problems. Our chromosome model had 2 parts; first part represented machines of processes and second part showed the orders of the jobs. We applied different mutation/crossover types to these parts and then determined better parameters with numerous experiences. Also, we created an iOS application for visually comparing this GA approach with an ACO algorithm previously proposed. Our GA approach gave better results in some problem types. Our application could be downloaded in the following link (iPad was recommended): https://itunes.apple.com/co/app/ipps-solver/id876097527?l=en&mt=8. © 2016 by World Scientific Publishing Co. Pte. Ltd.

| İstanbul Gelişim Üniversitesi | Kütüphane | Açık Erişim Politikası | Rehber | OAI-PMH |

Bu site Creative Commons Alıntı-Gayri Ticari-Türetilemez 4.0 Uluslararası Lisansı ile korunmaktadır.


Cihangir Mahallesi, Şehit Jandarma Komando Er Hakan Öner Sokak, No:1, Avcılar, İstanbul, TÜRKİYE
İçerikte herhangi bir hata görürseniz lütfen bize bildirin

DSpace 7.6.1, Powered by İdeal DSpace

DSpace yazılımı telif hakkı © 2002-2025 LYRASIS

  • Çerez Ayarları
  • Gizlilik Politikası
  • Son Kullanıcı Sözleşmesi
  • Geri Bildirim