Results 81 to 90 of about 108,421 (273)
Coordination of Pheromone Deposition Might Solve Time-Constrained Travelling Salesman Problem
Complexity, 2018 In this study, we develop two Ant Colony Optimization (ACO) models as new metaheuristic models for solving the time-constrained Travelling Salesman Problem (TSP).
Tomoko Sakiyama, Ikuo Arizono
doaj +1 more source
A Comparative Performance Analysis of Computational Intelligence Techniques to Solve the Asymmetric Travelling Salesman Problem. [PDF]
Comput Intell Neurosci, 2021 Odili JB, Noraziah A, Zarina M.
europepmc +1 more source
Automating Algorithm Experiments With ALGator: From Problem Modeling to Reproducible Results
Software: Practice and Experience, Volume 56, Issue 1, Page 26-41, January 2026.ABSTRACT Background Theoretical algorithm analysis provides fundamental insights into algorithm complexity but relies on simplified and often outdated computational models. Experimental algorithmics complements this approach by evaluating the empirical performance of algorithm implementations on real data and modern computing platforms.
Tomaž Dobravec
wiley +1 more source
Complexity indices for the travelling salesman problem and data mining [PDF]
Transactions on Combinatorics, 2012 In this survey paper we extend our previous work on complexity indices for the travelling salesman problem (TSP), summarized in cite{CvCK3}, using graph spectral techniques of data mining. A complexity index is an invariant of an instance $I$ by which we
Dragos Cvetković
doaj
MAPSOFT: A Multi-Agent based Particle Swarm Optimization Framework for Travelling Salesman Problem
Journal of Intelligent Systems, 2020 This paper proposes a Multi-Agent based Particle Swarm Optimization (PSO) Framework for the Traveling salesman problem (MAPSOFT). The framework is a deployment of the recently proposed intelligent multi-agent based PSO model by the authors.
Blamah Nachamada Vachaku +3 more
doaj +1 more source
IET Optoelectronics, Volume 20, Issue 1, January/December 2026.In this paper, we have reviewed six distinct metaheuristic optimisation algorithms applicable to challenging problems in electromagnetics and optics. Specifically, we applied each method to the synthesis of GMR narrowband reflection filters and performed a systematic comparative evaluation. ABSTRACT The design of optical elements often requires precise
Amirreza Asadollahzadeh +2 more
wiley +1 more source
Trajectory Optimisation for UAV Data Collection in IoT‐Based WSN: A Lévy Flight‐Based Approach
IET Smart Cities, Volume 8, Issue 1, January/December 2026.In large‐scale IoT and WSN deployments, data transmission to base stations is often limited by restricted network coverage, and drones can help extend connectivity by collecting data from cluster head nodes. This work proposes an energy‐efficient drone‐assisted data collection approach that jointly optimises system costs and energy consumption, taking ...
Hamayadji Abdoul Aziz +6 more
wiley +1 more source
IMPLEMENTASI ALGORITMA BEE COLONY UNTUK OPTIMASI RUTE DISTRIBUSI CARICA NIDA FOOD WONOSOBO
Sistemasi: Jurnal Sistem Informasi, 2019 “Nida Food” merupakan UMKM produksi carica, memiliki permasalahan dalam menentukan rute minimum untuk mendistribusikan produksi carica ke semua konsumen.
Muhammad Darwis Arifin, Arif Dwi Laksito
doaj +1 more source
Workload equity in multiperiod vehicle routing problems
International Transactions in Operational Research, Volume 33, Issue 1, Page 245-267, January 2026.Abstract An equitable distribution of workload is essential when deploying vehicle routing solutions in practice. For this reason, previous studies have formulated vehicle routing problems with workload‐balance objectives or constraints, leading to trade‐off solutions between routing costs and workload equity.
Najmeh Nekooghadirli +3 more
wiley +1 more source
IEEE AccessFirefly Algorithm (FA) mimics the flashing light characteristic of fireflies to solve optimization problems. An area where its utilization is limited is Travelling Salesman Problem (TSP).
Ravneil Nand +2 more
doaj +1 more source