Vehicle Routing Problem by Combining Nearest Neighbour and Local Search

Kurnia Iswardani (Universitas Panca Marga)
Ira Aprilia (Universitas Panca Marga)
Dwi Putri K (Universitas Panca Marga)

Unisda Journal of Mathematics and Computer Science (UJMC)
Vol 9 No 1 (2023): Unisda Journal of Mathematics and Computer science

PT. X is a company tasked with distributing Elpiji Gas to major agents. The problem under study is to find a more optimal distribution route so it can maximize the use of other resources, for example the number of trucks used. This distribution problem will be solved by a combination two methods, Nearest Neighbor and Local Search with the hope of getting the shortest route. The way the Nearest Neighbor method works is selecting the Agent's location based on the shortest distance from the last location and improving the solution using Local Search (intra-route insertion (1-0)) by moving one customer's position in one route so that a good distribution route is produced