Solving vehicle routing problem by using improved genetic algorithm for optimal solution
Bus transportation; Buses; Cost reduction; Costs; Education; Genetic algorithms; Location; Optimal systems; Routing algorithms; Students; Transportation; Transportation routes; Vehicle routing; Vehicles; Capacitated vehicle routing problem; Crossover operations; Economic interests; Evaluation criter...
Saved in:
Main Authors: | , , , , , |
---|---|
Other Authors: | |
Format: | Article |
Published: |
Elsevier B.V.
2023
|
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
my.uniten.dspace-23175 |
---|---|
record_format |
dspace |
spelling |
my.uniten.dspace-231752023-05-29T14:38:11Z Solving vehicle routing problem by using improved genetic algorithm for optimal solution Mohammed M.A. Abd Ghani M.K. Hamed R.I. Mostafa S.A. Ahmad M.S. Ibrahim D.A. 57192089894 24491611800 35752800100 37036085800 56036880900 57191545030 Bus transportation; Buses; Cost reduction; Costs; Education; Genetic algorithms; Location; Optimal systems; Routing algorithms; Students; Transportation; Transportation routes; Vehicle routing; Vehicles; Capacitated vehicle routing problem; Crossover operations; Economic interests; Evaluation criteria; Optimal solutions; Transportation cost; Vehicle routing problem; Vehicle Routing Problems; Problem solving Context The Vehicle Routing Problem (VRP) has numerous applications in real life. It clarifies in a wide area of transportation and distribution such as transportation of individuals and items, conveyance service and garbage collection. Thus, an appropriate selecting of vehicle routing has an extensive influence role to improve the economic interests and appropriateness of logistics planning. Problem In this study the problem is as follows: Universiti Tenaga Nasional (UNITEN) has eight buses which are used for transporting students within the campus. Each bus starts from a main location at different times every day. The bus picks up students from eight locations inside the campus in two different routes and returns back to the main location at specific times every day, starting from early morning until the end of official working hours, on the following conditions: Every location will be visited once in each route and the capacity of each bus is enough for all students included in each route. Objectives Our paper attempt to find an optimal route result for VRP of UNITEN by using genetic algorithm. To achieve an optimal solution for VRP of UNITEN with the accompanying targets: To reduce the time consuming and distance for all paths. which leads to the speedy transportation of students to their locations, to reduce the transportation costs such as fuel utilization and additionally the vehicle upkeep costs, to implement the Capacitated Vehicle Routing Problem (CVRP) model for optimizing UNITEN's shuttle bus services. To implement the algorithm which can be used and applied for any problems in the like of UNITEN VRP. Approach The Approach has been presented based on two phases: firstly, find the shortest route for VRP to help UNITEN University reduce student's transportation costs by genetic algorithm is used to solve this problem as it is capable of solving many complex problems; secondly, identify The CVRP model is implemented for optimizing UNITEN shuttle bus services. Finding The findings outcome from this study have shown that: (1) A comprehensive listed of active GACVRP; (2) Identified and established an evaluation criterion for GACVRP of UNITEN; (3) Highlight the methods, based on hybrid crossover operation, for selecting the best way (4) genetic algorithm finds a shorter distance for route A and route B. The proportion of reduction the distance for each route is relatively short, but the savings in the distance becomes greater when calculating the total distances traveled by all buses daily or monthly. This applies also to the time factor that has been reduced slightly based on the rate of reduction in the distances of the routes. � 2017 Elsevier B.V. Final 2023-05-29T06:38:11Z 2023-05-29T06:38:11Z 2017 Article 10.1016/j.jocs.2017.04.003 2-s2.0-85017507511 https://www.scopus.com/inward/record.uri?eid=2-s2.0-85017507511&doi=10.1016%2fj.jocs.2017.04.003&partnerID=40&md5=26524c1707011d187c599d483cf037b4 https://irepository.uniten.edu.my/handle/123456789/23175 21 255 262 Elsevier B.V. Scopus |
institution |
Universiti Tenaga Nasional |
building |
UNITEN Library |
collection |
Institutional Repository |
continent |
Asia |
country |
Malaysia |
content_provider |
Universiti Tenaga Nasional |
content_source |
UNITEN Institutional Repository |
url_provider |
http://dspace.uniten.edu.my/ |
description |
Bus transportation; Buses; Cost reduction; Costs; Education; Genetic algorithms; Location; Optimal systems; Routing algorithms; Students; Transportation; Transportation routes; Vehicle routing; Vehicles; Capacitated vehicle routing problem; Crossover operations; Economic interests; Evaluation criteria; Optimal solutions; Transportation cost; Vehicle routing problem; Vehicle Routing Problems; Problem solving |
author2 |
57192089894 |
author_facet |
57192089894 Mohammed M.A. Abd Ghani M.K. Hamed R.I. Mostafa S.A. Ahmad M.S. Ibrahim D.A. |
format |
Article |
author |
Mohammed M.A. Abd Ghani M.K. Hamed R.I. Mostafa S.A. Ahmad M.S. Ibrahim D.A. |
spellingShingle |
Mohammed M.A. Abd Ghani M.K. Hamed R.I. Mostafa S.A. Ahmad M.S. Ibrahim D.A. Solving vehicle routing problem by using improved genetic algorithm for optimal solution |
author_sort |
Mohammed M.A. |
title |
Solving vehicle routing problem by using improved genetic algorithm for optimal solution |
title_short |
Solving vehicle routing problem by using improved genetic algorithm for optimal solution |
title_full |
Solving vehicle routing problem by using improved genetic algorithm for optimal solution |
title_fullStr |
Solving vehicle routing problem by using improved genetic algorithm for optimal solution |
title_full_unstemmed |
Solving vehicle routing problem by using improved genetic algorithm for optimal solution |
title_sort |
solving vehicle routing problem by using improved genetic algorithm for optimal solution |
publisher |
Elsevier B.V. |
publishDate |
2023 |
_version_ |
1806426588094398464 |
score |
13.214268 |