Genetic Algorithm for Web-Based Food Stand Assignment Scheduling

Oktaviani, Sintya and Putri, Farica Perdana and Gunawan, Dennis (2018) Genetic Algorithm for Web-Based Food Stand Assignment Scheduling. IJNMT (International Journal of New Media Technology), 5 (2). ISSN 2355-0082

Full text not available from this repository.

Abstract

Scheduling is a hard problem due to much considerations in many goals. Combination of goals in this scheduling cause the problem hard to solve even when using mathematical techniques. Optimization is a method which aim to achieve the best result with the least cost as possible. Optimization for large scale problem usually done with more modern technic, such as metaheuristic. Genetic Algorithm belongs to a larger system called Evolutionary Algorithm which is often used for solving the best value in optimization problem. Hence, this food stand assignment scheduling is build using Genetic Algorithm with population size of 50, uniform crossover with crossover rate of 0.25, mutation rate of 0.0125, and roulette wheel selection. An interview was conducted with three coordinators of fund and consumtion that results in three constraints used in building this system. Testing is done for three events and achieve mean fitness that is 87.967%, 89.609%, and 85.001% for FesTIval, TechnoFest, and DISCO, respectively.

Item Type: Article
Subjects: 000 Computer Science, Information and General Works > 000 Computer Science, Knowledge and Systems
000 Computer Science, Information and General Works > 000 Computer Science, Knowledge and Systems > 005 Computer Programming
Divisions: Faculty of Engineering & Informatics > Informatics
Depositing User: mr admin umn
Date Deposited: 08 Oct 2021 01:59
Last Modified: 08 Oct 2021 01:59
URI: https://kc.umn.ac.id/id/eprint/18582

Actions (login required)

View Item View Item