Vol.: 02 Issue: 01 & 02: The Solution to the Automotive Routing Problem Using Genetic Algorithm

Mohseu Minhaj Niloy:

Adjunct Faculty of CSE, Manarat International University, Bangladesh, Email: [email protected]

Shahriar Alam Tonmoy:

BSC in Computer Science and Engineering, North South University, Bangladesh, Email: [email protected]

Mirza Sabbir Ahmed:

BSC in Computer Science and Engineering, North South University, Bangladesh, Email: [email protected]

Ahmed Fahmin:

Faculty of CSE North South University,Bangladesh, Email: [email protected]

Keywords

Vehicle Routing Problem (VRP), Genetic algorithm, Meta heuristic algorithm, Automotive routing problem.

JEL Classification:

D85, G14, L11, L14, M11, M15, M31, P23, R41

Abstract

This paper aims to identify automotive routing problems using genetic algorithms. It will also find an appropriateroute for the automotive industry to serve customers. Road and distance are very important for a routing problem. Genetic algorithms will reduce the distance, minimize time, and savethe drivers’ working hours. It will play a crucial role in preventing accidents. The automotive routing problem has wide applications in logistics and transportation and is of growingeconomic importance. And reducing distance and time will surely contribute to the economy. There are a variety of heuristics and approach-based solutions accessible for specific conditions and various restrictions of the automotive routing problem, but precise solutions to the problem are not possible because of the high computation time requirement. Meta-heuristic algorithms, as well as genetic algorithms, are selected to solve the introduced problem.