TRANSPORTATION ROUTE PLANNING WITH HEURISTIC ALGORITHM: A CASE STUDY OF A CONSTRUCTION MATERIALS COMPANY

Authors

  • Peerapong PAKAWANICH Silpakorn University
  • Kamonchanok SAENGCHEAM Silpakorn University

Keywords:

Routing, Freight Transport, Nearest Neighbor Heuristic, Saving Algorithm

Abstract

The objective of this research is to minimize the total distance from transportation for a case study of a construction materials company.  The study focuses on 11 customers located in Bangkok and Samut Sakhon provinces. The transportation route starts from the company's distribution center, delivers goods to all customers, and then returns to the distribution center. Distances between locations are obtained using Google Maps, and the Nearest Neighbor Heuristic is applied for route optimization. The study reveals that the previous company's transportation route had a total distance of 113.3 kilometers. By applying the Nearest Neighbor Heuristic, the total transportation distance was reduced to 79.0 kilometers, a decrease of 34.3 kilometers or 30.28%.

Downloads

Published

2025-01-24