Ant Colony Algorithms for Two Impluse Interplanetary Trajectory Optimization

2006 ◽  
Vol 29 (6) ◽  
pp. 1440-1444 ◽  
Author(s):  
Gianmarco Radice ◽  
German Olmo
Author(s):  
DWEEPNA GARG ◽  
PARTH GOHIL

A Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network without using centralized access points, infrastructure, or centralized administration. Routing means the act of moving information across an internet work from a source to a destination. The biggest challenge in this kind of networks is to find a path between the communication end points, what is aggravated through the node mobility. In this paper we present a new routing algorithm for mobile, multi-hop ad-hoc networks. The protocol is based on swarm intelligence. Ant colony algorithms are a subset of swarm intelligence and consider the ability of simple ants to solve complex problems by cooperation. The introduced routing protocol is well adaptive, efficient and scalable. The main goal in the design of the protocol is to reduce the overhead for routing. We refer to the protocol as the Ant Colony Optimization Routing (ACOR).


Author(s):  
Jihui Zhang ◽  
Junqin Xu ◽  
Siying Zhang

2019 ◽  
Vol 94 (sp1) ◽  
pp. 121
Author(s):  
Hongtao Yu ◽  
Sen Wang ◽  
Yan Bao

Author(s):  
Julio Cesar Ponce Gallegos ◽  
Fatima Sayuri Quezada Aguilera ◽  
José Alberto Hernandez Aguilar ◽  
Christian José Correa Villalón

The contribution of this chapter is to present an approach to explain the Ant Colony System applied on the Waste Collection Problem, because waste management is moving up to the concern over health and environmental impacts. These algorithms are a framework for decision makers in order to analyze and simulate various spatial waste management problems. In the last decade, metaheuristics have become increasingly popular for effectively confronting difficult combinatorial optimization problems. In the present work, an individual metaheuristic Ant Colony System (ACS) algorithm is introduced, implemented and discussed for the identification of optimal routes in the case Solid Waste collection. This algorithm is applied to a waste collection and transport system, obtaining recollection routes with the less total distance with respect to the actual route utilized and to the solution obtained by a previously developed approach.


Sign in / Sign up

Export Citation Format

Share Document