Metaheuristic approach for optimization problem
The research conducted to seek a better solution for delivering goods and route by comparing various metaheuristic methods that can produce the shortest distance and classical metaheuristic method consists of Simulated Annealing (SA) and Tabu Search (TS) are then evaluated.
To enrich the analysis, in the first stage we provide a brief literature review. We compare metaheuristic techniques, including simulated annealing, tabu search to solve traveling salesman problem and vehicle routing problem. The literature review framework is shown below.
Figure 1 Literature review framework
These are the overview of the paper:
ØJournal 1: comparing Tabu Search and Simulated Annealing to solve TSP in 29 destinations of food and beverage outlets located in Jakarta.
ØJournal 2: comparing the conventional, evolutionary, and bio-inspired algorithms based on tour length to solve TSP.
Both papers used to find out which algorithm perform better.
Further, we continue our analysis for journal 3, 4 and 5 to find a good performance of the algorithm. The results are as follow:
Figure 2 Journal 3 review analysis
Figure 3 Journal 4 review analysis
Figure 4 Journal 5 review analysis
Conclusion and model development
Based on the literature review, we conclude that:
- Classical algorithms (Tabu Search & Simulated Annealing) can be used to solve TSP or CRV.
- Bio-inspired algorithms perform better to solve more complex problem.
Further, we develop the simulate annealing model in the Mat-Lab to solve TSP and VRP problem. The model simulation as follow:
This article is writen by Lutfi Hidayat, Hadiyanto and Enggar Kurniawan to fulfill engineering optimization class project at Master in Industrial Engineering, Bina Nusantara University.