A novel metaheuristic for traveling salesman problem: blind mole-rat algorithm
<p style="font: 13.33px/20px Tahoma, Geneva, sans-serif; text-align: left; color: #515151; text-transform: none; text-indent: 0px; letter-spacing: normal; word-spacing: 0px; white-space: normal; widows: 1; font-size-adjust: none; font-stretch: normal; background-color: #eceaeb; -webkit-text-...
Main Authors: | Tevfik YILDIRIM, Can Berk KALAYCI, Özcan MUTLU |
---|---|
Format: | Article |
Language: | English |
Published: |
Pamukkale University
2016-02-01
|
Series: | Pamukkale University Journal of Engineering Sciences |
Online Access: | http://dergipark.ulakbim.gov.tr/pajes/article/view/5000180424 |
Similar Items
-
A novel metaheuristic for traveling salesman problem: blind mole-rat algorithm
by: Can Berk Kalaycı, et al.
Published: (2016-02-01) -
Applying Metaheuristic for Time-Dependent Traveling Salesman Problem in Postdisaster
by: Ha-Bang Ban
Published: (2021-03-01) -
A Hybrid Metaheuristic Solution Method to Traveling Salesman Problem with Drone
by: Noyan Sebla Gunay-Sezer, et al.
Published: (2023-05-01) -
An optimization framework of K-means clustering and metaheuristic for traveling salesman problem
by: Wang, Benquan
Published: (2021) -
Gezgin satıcı problemi için yeni bir meta-sezgisel: kör fare algoritması
by: Tevfik YILDIRIM, et al.
Published: (2016-02-01)