Optimization of Courier Travel Routes Using Genetic Algorithms

Istiono, Wirawan (2020) Optimization of Courier Travel Routes Using Genetic Algorithms. INTERNATIONAL JOURNAL OF ADVANCED STUDIES IN COMPUTER SCIENCE & ENGINEERING, 9 (9).

Full text not available from this repository.

Abstract

Efficiency and effectiveness are two things needed to save time and energy. One example is the optimization of route selection for courier services in delivering goods. The calculation of the best route order selection plays an important role, so the courier can deliver the goods to the customer with optimal time. The more dense and complicated the sequence of travel routes traveled, the time spent becomes less optimal. This study aims to examine the application of genetic algorithms to solve problems in optimizing the route selection, by considering the estimated time. A genetic algorithm is a search method that is inspired by the process of completing natural and genetic selection. Combine the solutions to produce new solutions, using several combinations of crossover and mutation probabilities, as well as population size and generation size. In this research get resulted in an optimization of travel routes for couriers in Tangerang using Genetic Algorithms on 5th chromosome, with an objective function value of 1023.115773 and fitness function 0.000976452 from 50 generations was formed. This value is obtained from a solution that allows the courier to deliver the goods at the optimal time.

Item Type: Article
Subjects: 000 Computer Science, Information and General Works > 000 Computer Science, Knowledge and Systems > 005 Computer Programming
000 Computer Science, Information and General Works > 000 Computer Science, Knowledge and Systems > 006 Special Computer Methods
Divisions: Faculty of Engineering & Informatics > Informatics
Depositing User: Administrator UMN Library
Date Deposited: 15 Oct 2021 03:59
Last Modified: 15 Oct 2021 03:59
URI: https://kc.umn.ac.id/id/eprint/18804

Actions (login required)

View Item View Item