Please use this identifier to cite or link to this item:
http://ithesis-ir.su.ac.th/dspace/handle/123456789/5320
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor | Ratchadakorn POOHOI | en |
dc.contributor | รัชฎากรณ์ ภู่ห้อย | th |
dc.contributor.advisor | KANATE PUNTUSAVASE | en |
dc.contributor.advisor | คเณศ พันธุ์สวาสดิ์ | th |
dc.contributor.other | Silpakorn University | en |
dc.date.accessioned | 2024-08-13T06:44:52Z | - |
dc.date.available | 2024-08-13T06:44:52Z | - |
dc.date.created | 2024 | |
dc.date.issued | 28/6/2024 | |
dc.identifier.uri | http://ithesis-ir.su.ac.th/dspace/handle/123456789/5320 | - |
dc.description.abstract | Genetic Algorithm is the search algorithms and optimization methods. The basic concept is based on the mechanisms of evolution and natural selection, according to Darwin’s theory of survival of the fittest. A novel crossover operator is a combination of four crossover operators, including Single point crossover, Two points crossover, Arithmetic crossover, and Scattered crossover, which is called “Stas Crossover”. The most important advantage of Stas crossover is that it provides greater diversity in the choice of methods for creating offspring and increases the opportunity for offspring to directly obtain good genetic information. It presents the performance of the crossover operator, which tests with multi-product and multi-period aggregate production planning problems (APP), provides optimal levels of inventory, backorders, overtime and regular production rates, and other controllable variables, and finally chooses appropriate crossover options. Moreover, Stas crossover in GA was modified to solve the standard Solomon’s benchmark problem instances for vehicle routing problems with time windows (VRPTW) by developing the problem with K-mean clustering. Results from K-mean clustering show that it performs better for minimum distance and average distance than without K-mean clustering. The paths with K-mean clustering are arranged into groups and are orderly, but the paths without K-mean clustering are disordered in terms of location and dispersion characteristics of the customer. After that, the research presents a comparison of the performance of the crossover operator with the instance of the Solomon benchmark, and it is recommended to use the appropriate crossover operator for each type of problem. It has been shown that adding K-mean clustering to the Stas crossover efficiently contributes to its performance. In some instances, the results of Stas crossover are better than the known solutions from previous studies. Furthermore, the proposed research will serve as a guideline for a real-world case study. | en |
dc.description.abstract | - | th |
dc.language.iso | en | |
dc.publisher | Silpakorn University | |
dc.rights | Silpakorn University | |
dc.subject | Genetic Algorithm | en |
dc.subject | Aggregate production planning | en |
dc.subject | Vehicle routing problems with time windows | en |
dc.subject | K-mean clustering | en |
dc.subject.classification | Decision Sciences | en |
dc.subject.classification | Computer Science | en |
dc.subject.classification | Manufacturing | en |
dc.subject.classification | Computer science | en |
dc.title | Genetic Algorithm for multi-product multi-period aggregate production planning and vehicle routing problems with time windows | en |
dc.title | ขั้นตอนวิธีเชิงพันธุกรรมสำหรับการวางแผนการผลิตแบบหลายผลิตภัณฑ์หลายช่วงเวลาและปัญหาการจัดเส้นทางยานพาหนะแบบมีกรอบเวลาในการขนส่ง | th |
dc.type | Thesis | en |
dc.type | วิทยานิพนธ์ | th |
dc.contributor.coadvisor | KANATE PUNTUSAVASE | en |
dc.contributor.coadvisor | คเณศ พันธุ์สวาสดิ์ | th |
dc.contributor.emailadvisor | kanate.engineer@gmail.com | |
dc.contributor.emailcoadvisor | kanate.engineer@gmail.com | |
dc.description.degreename | Doctor of Philosophy (Ph.D.) | en |
dc.description.degreename | ปรัชญาดุษฎีบัณฑิต (ปร.ด.) | th |
dc.description.degreelevel | Doctoral Degree | en |
dc.description.degreelevel | ปริญญาเอก | th |
dc.description.degreediscipline | INDUSTRIAL ENGINEERING AND MANAGEMENT | en |
dc.description.degreediscipline | วิศวกรรมอุตสาหการและการจัดการ | th |
Appears in Collections: | Engineering and Industrial Technology |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
630930003.pdf | 5.02 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.