README

CIH(Cheapest Insertion Heuristic)

Acknowledgments

This repository has been cited in the following publication:

• Implementation of Cheapest Insertion Heuristic Algorithm in Determining Shortest Delivery Route
  • Authors: [Farid Fargiana, Respitawulan Respitawulan, Yusuf Fajar, Didi Suhaedi & Erwin Harahap]
  • Journal: International Journal of Geoinformatics and Remote Sensing (IJGOR)
  • Published by: Department of Mathematics, Universitas Islam Bandung, Bandung, Indonesia
  • Publication Date: 2022-05-05
  • Read the paper here

We appreciate the recognition and are glad to contribute to the academic community.

Description

CIH is one of the methods used to solve the ATSP problem. The ATSP (Asymmetric Traveling Salesman Problem) is a classic problem that seeks to find the shortest route typically traveled by salespeople or postal workers who wish to visit several cities without revisiting any city more than once.

If the number of cities to be visited is small, this problem can be solved easily. However, it becomes challenging when the number of cities to be visited is 100 or more. Therefore, with the help of computers, the ATSP problem can be solved quickly by implementing the CIH (Cheapest Insertion Heuristic) algorithm.

This source code is an example of implementing the CIH algorithm using Borland Delphi.

Screnshot

Requirement

• IDE : Borland Delphi 7
• Database : Firebird
• Component : Nice Grid, silahkan download di websitenya pak Priyatna http://priyatna.org/nicegrid.php

Update

I recently recoded this project with JavaScript. You can see it here 🚀 .