Optimal Control of Mobile Agents for Monitoring of Points on a Network

2014 ◽  
Vol 11 (2) ◽  
pp. 2-6
Author(s):  
V. Sgurev ◽  
S. Drangajov
Keyword(s):  
Mobile Agents ◽  
Network Flow ◽  
Hamiltonian Path ◽  
Hamiltonian Cycles ◽  
Optimal Trajectories ◽  
Network Nodes ◽  
Np Complete ◽  
Network Flow Programming ◽  
Similar Class ◽  
Edge Decomposition

Abstract This paper concerns the problems of finding optimal trajectories between nodes on a network, which must be periodically surveyed, and probably serviced. It is shown, that such trajectories may be generated if optimal Hamiltonian cycles are used between the separate network nodes under inspection. It is known that the Hamiltonian path problem is NP-complete, but an edge decomposition of the network is proposed. This is performed by reducing in a particular way to network flow circulations. The requirements and the equations for describing such circulation are pointed out. Defining of the optimal circulations of the mobile agents is reduced to network flow programming problems. A numerical example is presented for solving a similar class of monitoring problems by mobile agents.

Power generation scheduling through use of generalised network flow programming

1991 ◽  
Vol 138 (1) ◽  
pp. 39 ◽  
Author(s):  
R.E. Rice ◽  
W.M. Grady ◽  
W.G. Lesso ◽  
A.H. Noyola ◽  
M.E. Connolly
Keyword(s):  
Power Generation ◽  
Network Flow ◽  
Generation Scheduling ◽  
Network Flow Programming

scholarly journals A Discrete Imperialist Competitive Algorithm for WSN Deployment

2018 ◽  
Vol 7 (4.1) ◽  
pp. 4
Author(s):  
Kamal Jadidy Aval ◽  
Masumeh Damrudi
Keyword(s):  
Event Detection ◽  
Optimization Problem ◽  
Solution Space ◽  
Imperialist Competitive Algorithm ◽  
Message Delivery ◽  
Exact Methods ◽  
Network Nodes ◽  
Competitive Algorithm ◽  
Minimum Probability ◽  
Np Complete

The WSN deployment problem is addressed in this paper. The problem applies to the monitored areas with different detection needs at different points. In this problem, every point of the terrain is assigned with a predefined minimum probability of event detection. The objective is providing the best position for the network nodes and at the same time assuring event detection, detection message delivery, and reducing deployment cost. We have formulated the problem as an optimization problem with three objectives, which is NP-complete. Because of the huge solution space for the problem and the exponential computational complexity, none of the exact methods known yet can solve the problem unless for a pretty small scaled case. To battle the complexity of the solution, a new scalable solution is proposed based on imperialist competitive algorithm namely imperialist competitive deployment algorithm (ICDA). We compare the proposal to the related deployment strategies, and the results show that ICDA outperforms them.  

DIMMA-Implemented Metaheuristics for Finding Shortest Hamiltonian Path Between Iranian Cities Using Sequential DOE Approach for Parameters Tuning

2012 ◽  
pp. 289-305
Author(s):  
Masoud Yaghini ◽  
Mohsen Momeni ◽  
Mohammadreza Sarmadi
Keyword(s):  
Hamiltonian Path ◽  
Search Algorithms ◽  
Sequential Design ◽  
Cpu Time ◽  
Local Search Methods ◽  
Parameters Tuning ◽  
Efficiency And Effectiveness ◽  
Np Complete ◽  
First Time

A Hamiltonian path is a path in an undirected graph, which visits each node exactly once and returns to the starting node. Finding such paths in graphs is the Hamiltonian path problem, which is NP-complete. In this paper, for the first time, a comparative study on metaheuristic algorithms for finding the shortest Hamiltonian path for 1071 Iranian cities is conducted. These are the main cities of Iran based on social-economic characteristics. For solving this problem, four hybrid efficient and effective metaheuristics, consisting of simulated annealing, ant colony optimization, genetic algorithm, and tabu search algorithms, are combined with the local search methods. The algorithms’ parameters are tuned by sequential design of experiments (DOE) approach, and the most appropriate values for the parameters are adjusted. To evaluate the proposed algorithms, the standard problems with different sizes are used. The performance of the proposed algorithms is analyzed by the quality of solution and CPU time measures. The results are compared based on efficiency and effectiveness of the algorithms.

DIMMA-Implemented Metaheuristics for Finding Shortest Hamiltonian Path Between Iranian Cities Using Sequential DOE Approach for Parameters Tuning

2011 ◽  
Vol 2 (2) ◽  
pp. 74-92 ◽  
Author(s):  
Masoud Yaghini ◽  
Mohsen Momeni ◽  
Mohammadreza Sarmadi
Keyword(s):  
Social Economic ◽  
Undirected Graph ◽  
Hamiltonian Path ◽  
Sequential Design ◽  
Local Search Methods ◽  
Parameters Tuning ◽  
Efficiency And Effectiveness ◽  
Np Complete ◽  
First Time

A Hamiltonian path is a path in an undirected graph, which visits each node exactly once and returns to the starting node. Finding such paths in graphs is the Hamiltonian path problem, which is NP-complete. In this paper, for the first time, a comparative study on metaheuristic algorithms for finding the shortest Hamiltonian path for 1071 Iranian cities is conducted. These are the main cities of Iran based on social-economic characteristics. For solving this problem, four hybrid efficient and effective metaheuristics, consisting of simulated annealing, ant colony optimization, genetic algorithm, and tabu search algorithms, are combined with the local search methods. The algorithms’ parameters are tuned by sequential design of experiments (DOE) approach, and the most appropriate values for the parameters are adjusted. To evaluate the proposed algorithms, the standard problems with different sizes are used. The performance of the proposed algorithms is analyzed by the quality of solution and CPU time measures. The results are compared based on efficiency and effectiveness of the algorithms.

An Inter-Domain Agent Based Secure Authorization and Communication for Mobile Clients in Wireless AdHoc Networks

2010 ◽  
Vol 2 (3) ◽  
pp. 34-46
Author(s):  
Neeraj Kumar ◽  
R. B. Patel
Keyword(s):  
Mobile Agents ◽  
Dynamic Network ◽  
Time Interval ◽  
Network Nodes ◽  
Agent Based ◽  
Mobile Adhoc Network ◽  
Adhoc Network ◽  
Mobile Clients ◽  
Wireless Adhoc Networks ◽  
High Degree

Wireless mobile adhoc network (MANET) is a dynamic network. Nodes in a MANET have high degree of mobility from one domain to another in a particular time interval. In such a dynamic network, security is a major concern. In this paper, the authors propose an inter domain agent based secure authorization and communication for mobile clients/nodes (MCs) in MANET. Mobile agents (MAs) are software programs that support the mobility of clients in different domain and provide necessary resources to the clients for safe execution. It also shares the key with MCs in different domains. An algorithm for secure authorization and communication between MCs having mobility in different domains is proposed. The scheme is evaluated on ns-2 w.r.t. metrics such as overall cost in terms of overhead generated, admission and traceability cost, and itinerary chosen by MAs w.r.t. mobility of MCs.

NONLINEAR COMPUTABILITY BASED ON CHAOS

2000 ◽  
Vol 10 (02) ◽  
pp. 415-429 ◽  
Author(s):  
GABRIELE MANGANARO ◽  
JOSE PINEDA DE GYVEZ
Keyword(s):  
Hamiltonian Path ◽  
Combinatorial Problem ◽  
Combinatorial Problems ◽  
Information Coding ◽  
Computing Power ◽  
Complete Problems ◽  
Np Complete ◽  
Systematic Solution ◽  
Chaotic Simulated Annealing ◽  
Computing Models

Two new computing models based on information coding and chaotic dynamical systems are presented. The novelty of these models lies on the blending of chaos theory and information coding to solve complex combinatorial problems. A unique feature of our computing models is that despite the nonpredictability property of chaos, it is possible to solve any combinatorial problem in a systematic way, and with only one dynamical system. This is in sharp contrast to methods based on heuristics employing an array of chaotic cells. To prove the computing power and versatility of our models, we address the systematic solution of classical NP-complete problems such as the three colorability and the directed Hamiltonian path in addition to a new chaotic simulated annealing scheme.

Winding indexes of Max. and Min. Hamiltonians in N-Gons

2017 ◽  
Vol 09 (05) ◽  
pp. 1750061
Author(s):  
Blanca Isabel Niel
Keyword(s):  
Hamiltonian Path ◽  
Hamiltonian Cycles ◽  
Arithmetic Algorithm ◽  
Hamiltonian Path Problems

The resolutions of the different Shortest and Longest Euclidean Hamiltonian Path Problems on the vertices of simple regular [Formula: see text]-Gons, by means of a geometric and arithmetic algorithm allow us to define winding indexes for Euclidean Hamiltonian cycles. New statements characterize orientation of non-necessarily regular Hamiltonian cycles on the [Formula: see text]th roots of the unity embedded in the plane and deal with the existence of reflective bistarred Hamiltonian tours on vertices of coupled [Formula: see text]-Gons.

Sign in / Sign up

Export Citation Format

Share Document