A Human Intelligence Inspired Meta Heuristic Optimization Algorithm for TSPs

This paper presents a novel heuristic optimization algorithm for discrete optimization problems, the Bandwidth Restricted Transmission-Simulated Optimization Algorithm (BRT-S). This algorithm imitates the intellective behaviors of human in managing network transmission. BRT-S is a constructive heuri...

Full description

Saved in:
Bibliographic Details
Published in2018 3rd International Conference on Computational Intelligence and Applications (ICCIA) pp. 42 - 46
Main Authors Yang, Feng-Cheng, Li, Ren-Fu
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.07.2018
Subjects
ACO
Bandwidth
bandwidth restricted transmission simulated optimization algorithm
heuristic algorithm
Heuristic algorithms
Optimization
Sociology
Statistics
TSP
Urban areas
Wires
Online AccessGet full text
DOI10.1109/ICCIA.2018.00016

Cover

More Information
Summary:This paper presents a novel heuristic optimization algorithm for discrete optimization problems, the Bandwidth Restricted Transmission-Simulated Optimization Algorithm (BRT-S). This algorithm imitates the intellective behaviors of human in managing network transmission. BRT-S is a constructive heuristic algorithm whose optimization procedures simulate processes of data transferring and management operations over the network. A population of solution agents mimicking message transmitters on networks is deployed to quest for optimal solutions. The algorithm however restricts the resource utilized in solution search mimicking the bandwidth resource is limited in network transmission. As a result, agents must compete with others to obtain solution construction resources. Due to the mimicked bandwidth restriction, not every agent is able to complete a solution construction. Only constructed solutions are subject to objective value evaluations. In each evolution iteration, bandwidth resources are separately modulated by conducting bandwidth deterioration, enhancement, or depletion, on the basis of the solution qualities obtained. To illustrate the operation procedures of the algorithm, a BRT-S computation model for solving the Traveling Salesman Problem is presented and the solving system is implemented for benchmark testing. Numerical results of the tests indicate that given similar computation resources, the algorithm generates better solutions than other meta heuristic algorithms, such as ACO and GA.
DOI:10.1109/ICCIA.2018.00016