The following paper provides an insight into application of the contemporary heuristic methods to graph coloring problem. Variety of algorithmic solutions for the Graph Coloring Problem (GCP) are discussed and recommendations for their implementation provided. The GCP is the NP-hard problem, aiming at finding the minimum number of colors for vertices in such a way that none of two adjacent vertices are marked with the same color. With the advent of modern processing units metaheuristic approaches to solve GCP were extended to discrete optimization here. To explain the phenomenon of these methods, a thorough survey of AI-based algorithms for GCP is provided, with the main differences between specific techniques pointed out.
The paper presents the analysis of the magnetic sensor’s applicability to the energy harvesting operations. The general scheme and technical advancement of the energy extraction from the electric vehicle (such as a tram or a train) is presented. The proposed methodology of applying the magnetic sensor to the energy harvesting is provided. The experimental scheme for the sensor characteristics and measurement results is discussed. Conclusions and future prospects regarding the practical implementation of the energy harvesting system are provided.