首页    期刊浏览 2024年09月19日 星期四
登录注册

文章基本信息

  • 标题:CAPACITATED MULTI DEPOT MULTI VEHICLE ROUTING PROBLEM USING GENETIC ALGORITHM (CASE STUDY: WATERING THE MEDAN CITY PARK)
  • 本地全文:下载
  • 作者:DIAN RACHMAWATI ; POLTAK SIHOMBING ; VELLYNA ANGELICHA SITORUS
  • 期刊名称:Journal of Theoretical and Applied Information Technology
  • 印刷版ISSN:1992-8645
  • 电子版ISSN:1817-3195
  • 出版年度:2020
  • 卷号:98
  • 期号:24
  • 页码:4215-4227
  • 出版社:Journal of Theoretical and Applied
  • 摘要:Watering a city park is one of the steps taken to treat city parks in the city of Medan so that plants remain alive and fresh so they can reduce air pollution. The water capacity needed to water the plants in each location is adjusted to the area of the site to be watered. Therefore, the city park watering vehicle must be able to adjust the route to be passed with the capacity of water that can be carried. To determine the route that must be traversed in quite complex problems like this, Genetic Algorithms can be used to obtain an approach solution to the optimization problem in this case. The genetic algorithm will generate chromosomes that represent the route to be followed, then the chromosomes will go through the process of evaluation, selection, crossover, and mutation so that new chromosomes are produced by many generations. After several trials in the case of the Capacitated Vehicle Routing Problem using the Genetic Algorithm for determining the park watering route in Medan, the route was found to be the closest to optimal for depot A in the 173rd generation with a fitness value of 0.00292227 and the route for depot B at 148th generation with a fitness value of 0.00261028. From several trials, it can be concluded that the chance of finding the best route is influenced by the size of the population and the maximum number of generations used. The greater the population size and the maximum number of generations used, the more optimal the best route found.
  • 关键词:Capacitated Vehicle Routing Problem;Heuristic;Genetic;Route.
国家哲学社会科学文献中心版权所有