PENERAPAN MODEL MATEMATIKA ALGORITMA ANT COLONY OPTIMIZATION DALAM PENENTUAN RUTE BUS TRANS BANYUMAS

نویسندگان

چکیده

Travelling Salesman Problem (TSP) adalah upaya salesman untuk mengunjungi setiap kota tepat satu kali dan kemudian kembali ke tempat asal sekaligus meminimalisasi total biaya yang ditempuh. Siklus Hamilton siklus melalui simpul di dalam graf asal. TSP mencoba mencari jarak optimal dari graf. Trans Banyumas beroperasi dengan semua pemberhentian bus titik awal. Penelitian ini menerapkan algoritma Ant Colony Optimization (ACO) menentukan rute Banyumas. Perhitungan ACO secara manual pada penelitian menggunakan 2 semut. Selanjutnya dilakukan komputasi software Matlab 25 sampel halte Koridor 3.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ant Colony Optimization in Model Checking

Most of model checkers found in the literature use exact deterministic algorithms to check the properties. The memory required for the verification with these algorithms usually grows in an exponential way with the size of the system to verify. When the search for errors with a low amount of computational resources (memory and time) is a priority (for example, in the first stages of the impleme...

متن کامل

Ant Colony Optimization for Model Checking

Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulas on the program variables. Most of model checkers found in the literature use exact deterministic algorithms to check the properties. These algorithms usually require huge amounts of computational resources if the checked model is large. We propose here the use ...

متن کامل

Ant Colony System Optimization

Successful heuristic algorithms for solving combinatorial optimization problems have mimicked processes observed in nature. Two highly successful families of algorithms that do this are simulated annealing and genetic algorithms. Here, a third family of algorithms, ant colony optimization is explored and implemented in C#. The test bed for evaluating the quality of solutions is based on several...

متن کامل

Ant Colony Optimization

Swarm intelligence is a relatively novel approach to problem solving that takes inspiration from the social behaviors of insects and of other animals. In particular, ants have inspired a number of methods and techniques among which the most studied and the most successful one is the ant colony optimization. Ant colony optimization (ACO) algorithm, a novel population-based and meta-heuristic app...

متن کامل

Evolving Ant Colony Optimization

Ant Colony Optimization (ACO) is a promising new approach to combinatorial optimization. Here ACO is applied to the traveling salesman problem (TSP). Using a genetic algorithm (GA) to nd the best set of parameters, we demonstrate the good performance of ACO in nding good solutions

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Jurnal mathematic paedagogic

سال: 2022

ISSN: ['2580-5320', '2597-6338']

DOI: https://doi.org/10.36294/jmp.v7i1.2701