Open Access Journal

ISSN : 2394-2320 (Online)

International Journal of Engineering Research in Computer Science and Engineering (IJERCSE)

Monthly Journal for Computer Science and Engineering

Open Access Journal

International Journal of Engineering Research in Computer Science and Engineering (IJERCSE)

Monthly Journal for Computer Science and Engineering

ISSN : 2394-2320 (Online)

Ant-Colony Optimization Algorithm for Travel Industry

Author : Ravi Katukam 1 Vineeth Reddy Kudumula 2

Date of Publication :7th June 2016

Abstract: Tours and Travel industry needs an intelligent scheduling system for the optimal use their assets, minimal fuel consumption, minimal waiting time for passengers. Popularly Travelling salesman problem has been solved by optimization programs like simplex method etc. In recent times, Artificial intelligence algorithms have been used effectively for designing a travel plan under given constraints. In current research Anti colony optimization is used for developing an intelligent digital platform for tours & travel agencies. The constraint is each city needs to be visited once. The objective is to arrive at minimal distance travelled leading to minima cost and time. Anti-colony optimization is applied to solve problems like pilgrimage, visiting important cities in a given country. In current paper two problems are addressed, minimal distance to travel chosen pilgrimage places Andhra Pradesh, and also minimum distance needed to travel all state capital cities in India.

Reference :

    1. Budi Santosa, Tutorial on Ant Colony Optimization,https://bsantosa.files.wordpress.com/ 2015/03/aco-tutorial-english.pdf.
    2. Zar Chi Su Su Hlaing and May Aye Khine, Solving Traveling Salesman Problem by Using Improved Ant Colony Optimization Algorithm, International Journal of Information and Education Technology, Vol. 1, No. 5, December 2011.

Recent Article