Sciweavers

60 search results - page 8 / 12
» Ant Colony Optimization for dynamic Traveling Salesman Probl...
Sort
View
JUCS
2010
148views more  JUCS 2010»
14 years 8 months ago
Applying RFD to Construct Optimal Quality-Investment Trees
: River Formation Dynamics (RFD) is an evolutionary computation method based on copying how drops form rivers by eroding the ground and depositing sediments. Given a cost-evaluated...
Pablo Rabanal, Ismael Rodríguez, Fernando R...
CCE
2004
14 years 9 months ago
An algorithmic framework for improving heuristic solutions: Part II. A new version of the stochastic traveling salesman problem
The algorithmic framework developed for improving heuristic solutions of the new version of deterministic TSP [Choi et al., 2002] is extended to the stochastic case. To verify the...
Jaein Choi, Jay H. Lee, Matthew J. Realff
ICC
2011
IEEE
272views Communications» more  ICC 2011»
13 years 9 months ago
Dynamic Anycast Routing and Wavelength Assignment in WDM Networks Using Ant Colony Optimization (ACO)
—Ant colony optimization (ACO) is a probabilistic technique used for solving complex computational problems, such as finding optimal routes in networks. It has been proved to pe...
Kavitha Bhaskaran, Joan Triay, Vinod Vokkarane
97
Voted
ANOR
2008
171views more  ANOR 2008»
14 years 9 months ago
A branch and bound method for the job-shop problem with sequence-dependent setup times
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
Christian Artigues, Dominique Feillet
79
Voted
SYNASC
2005
IEEE
133views Algorithms» more  SYNASC 2005»
15 years 3 months ago
Emotional Ant Based Modeling of Crowd Dynamics
It is known that one of the most disastrous forms of collective human behavior is the kind of crowd stampede induced by panic. This situation often leads to fatalities as people a...
Soumya Banerjee, Crina Grosan, Ajith Abraham