The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper proposes an optimization based approach to multi-UGV surveillance. In particular, we formulate both the minimum time- and connectivity constrained surveillance problems, show NP-hardness of them and propose decomposition techniques that allow us to solve them efficiently in an algorithmic manner. The minimum time formulation is the following. Given a set of surveillance UGVs and a polyhedral...
The ant colony optimization is a new meta-heuristic, it is a population based algorithm and is a good method for combination optimizations. Due to the random probabilistic search strategy, the slow convergence is the main problem of the ACO. In order to improve the convergence of the algorithm, the premium-penalty ant colony optimization (PPACO) is proposed. In this new algorithm, the good solutions...
Most past researches on determining parking scale did not consider individual driver's different parking choice behavior. This paper focuses on how to optimize parking scale while taking driver's parking choice behavior into account. Firstly, the main factors of individual driver are analyzed, including parking service radius, length of parking time, trip purpose. With analysis of data from stated...
In recent years there has been growing interest in algorithms inspired by the observation of natural phenomena to define computational procedures which can solve complex problems. In this paper, through an analysis of the constructive procedure of the solution in the ant colony system (ACS), a vehicle routing problem (VRP) is examined and a hybrid ant colony system coupled with a stochastic local...
Currently many non-tractable considered problems have been solved satisfactorily through methods of approximate optimization called metaheuristic. These methods use non-deterministic approaches that find good solutions which, however, do not guarantee the determination of the global optimum. The success of a metaheuristic is conditioned by capacity to adequately alternate between exploration and exploitation...
The efficient design of meander line antennas for RFID devices is a significant real-world problem. Traditional manual tuning of antenna designs is becoming impractical for larger problems. Thus the use of automated techniques, in the form of combinatorial search algorithms, is a necessity. Ant colony system (ACS) is a very efficient meta-heuristic that is commonly used to solve path construction...
Ants are a fascinating creature that demonstrates a capability of finding food and bring it back to their nest. Their ability as a colony to find paths or routes to the food sources has inspired the development of an algorithm namely ant colony system (ACS). The principle of cooperation has been the backbone in these algorithmic developments. However, observing the behavior of a single ant can provide...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.