Additional Information
| Author(s) | Dehmer, Matthias, Iantovics, Barna, Pintea, Camelia-Mihaela, Pop, Petrică C. |
|---|
Escape from solutions stagnation. A Study on Ant System solving TSP
Pintea, Camelia-M., Iantovics, Barna, Pop, Petrică C. and Dehmer, Matthias
Full PDF
creative_2019_28_1_77_83DOI: https://doi.org/10.37193/CMI.2019.01.11
Nowadays, routing problems arise in different contexts of distribution of goods, transportation of commodities and people. Routing problems deals with traveling along a given network in an optimal way. One of the major goals in optimization, including optimization of routing problems, is to reduce the time of stagnation by finding an exit state. The current work is a study about the ability of ants to escape from solution stagnation on a particular routing problem, the Traveling Salesman Problem.
Recently posted
-
Power Domination in Generalized Mycielskian of Cycles
-
Fixed point theorem for composition of multivalued and single-valued mappings in Banach spaces
-
Initial Value Problem for Hybrid Improved Conformable Fractional Differential Equations with Retardation and Anticipation
-
On a Subclass of Meromorphic Functions Defined by a Differential Operator on Hilbert Space
-
Countably Many Positive Symmetric Solutions For Sturm Liouville Type Boundary Conditions Of Second Order Iterative System
-
On the derived numbers of a real function
-
Some considerations about l'Hôpital-type rules for the monotonicity
-
On Minimum Second neighborhood Degree Energy of Graphs
-
Preserver Problems on Infinite Divisibility and Separability
-
A Note on Moritoh Transforms