A META-HEURISTIC APPROACH FOR IPPS PROBLEM

Basit Öğe Kaydı
dc.authoridUSLU, Mehmet Fatih/0000-0002-0775-4193;
dc.contributor.authorAlcan, Pelin
dc.contributor.authorUslu, Mehmet Fatih
dc.contributor.authorBasligil, Huseyin
dc.date.accessioned2024-09-11T19:53:55Z
dc.date.available2024-09-11T19:53:55Z
dc.date.issued2016
dc.departmentİstanbul Gelişim Üniversitesien_US
dc.description12th International Conference on Fuzzy Logic and Intelligent Technologies in Nuclear Science (FLINS) -- AUG 24-26, 2016 -- Roubaix, FRANCEen_US
dc.description.abstractIn 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=8en_US
dc.identifier.endpage784en_US
dc.identifier.isbn978-981-3146-96-9
dc.identifier.scopusqualityN/Aen_US
dc.identifier.startpage778en_US
dc.identifier.urihttps://hdl.handle.net/11363/8227
dc.identifier.volume10en_US
dc.identifier.wosWOS:000417158200121en_US
dc.identifier.wosqualityN/Aen_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherWorld Scientific Publ Co Pte Ltden_US
dc.relation.ispartofUncertainty Modelling In Knowledge Engineering And Decision Makingen_US
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.snmz20240903_Gen_US
dc.titleA META-HEURISTIC APPROACH FOR IPPS PROBLEMen_US
dc.typeConference Objecten_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu