SOLVING A FUEL DISTRIBUTION PROBLEM USING GENETIC ALGORITHM: A TRAVELING SALESMAN PROBLEM APPROACH

Authors

  • Rosshairy Abd Rahman Decision Science Department, School of Quantitative Sciences, Universiti Utara Malaysia
  • Nurul Ezatty Mokhtar Decision Science Department, School of Quantitative Sciences, Universiti Utara Malaysia
  • Ummu Latifah Bahrom Decision Science Department, School of Quantitative Sciences, Universiti Utara Malaysia

DOI:

https://doi.org/10.32890/jtom2017.12.1.6

Keywords:

Fuel distribution, travelling salesman problem, genetic algorithm, hill climbing

Abstract

Petrol or fuel is the product that people use daily and have a high demand. Therefore, the delivery of petrol from origin to each petrol station is done daily. This distribution process concerns the management as they have to minimize the cost while maximizing the profit. Hence, this paper aims to develop a model that is able to determine the shortest path for delivery these petrol in one company in Selangor. The problem is solved using Traveling Salesman Problem (TSP) approach, where the data were collected using Google Maps application. The shortest distance was attained using Genetic Algorithm (GA) technique. The solution obtained from GA was then compared with Hill Climbing technique. The results shows that GA produces better solution and could cut the distance up to 23 km. The finding of this research would help the company to reduce the cost of distributing refined fuel around Selangor.

Metrics

Metrics Loading ...

References

Chauhan, C. Gupta, R. & Pathak, K. (2012). Survey of methods of solving TSP along with its implementation using Dynamic Programming Approach. International Journal of Computer Applications, 52(4), 12-19.

Goldberg, D. E. (1989). Genetic algorithms in search, optimization, and machine learning. United States of America: Addison-Wesley Publishing Company, Inc.

Hernandez-Perez, H. (2004). A branch-and-cut algorithm for a travelling salesman problem with pickup and delivery, Journal Discrete Applied Mathematics. 145(1), 126-139.

Lin, B., Sun, X., Salous, S. (2016). Solving Travelling Salesman Problem with an Improved Hybrid Genetic Algorithm. Journal of Computer and Communications, 4, 98-106.

Mehmet Fatih Demiral & Halil Åžen (2016). Integer Programming Model for Two-Centered Double Traveling Salesman Problem, European Journal of Economics and Business Studies, 5(1), 80-86.

Mitchell, M. (1996). An introduction to genetic algorithms. London: The MIT Press.

Selman, B., & Gomes, C. (2006). Hill-climbing search. In Encyclopedia of Cognitive Science. John Wiley & Sons.

Wang, Y., Chen, Y. & Lin, Y. (2016). Memetic algorithm based on sequential variable neighborhood descent for the minmax multiple traveling salesman problem. Computers and Industrial Engineering, In Press http://dx.doi.org/10.1016/j.cie.2016.12.017

Winston, W. L. (2004). Operations Research: Applications and Algorithms (4th Edition). Canada: Cengage Learning.

Downloads

Published

27-06-2017

How to Cite

Abd Rahman, R., Mokhtar, N. E., & Bahrom, U. L. (2017). SOLVING A FUEL DISTRIBUTION PROBLEM USING GENETIC ALGORITHM: A TRAVELING SALESMAN PROBLEM APPROACH. Journal of Technology and Operations Management, 12(1), 51–55. https://doi.org/10.32890/jtom2017.12.1.6

Issue

Vol. 12 No. 1 (2017): Journal of Technology and Operations Management (JTOM)

Section

Articles

License

Disclaimer

The Journal of Technology and Operation Management (JTOM) has taken all reasonable measures to ensure that material contained in this website is the original work of the author(s). However, the Journal gives no warranty and accepts no responsibility for the accuracy or the completeness of the material; no reliance should be made by any user on the material. The user should check with the authors for confirmation. Articles published in the Journal of Technology and Operation Management (JTOM) do not represent the views held by the editors and members of the editorial board. Authors are responsible for all aspects of their articles except the editorial screen design.