Sciweavers

2343 search results - page 100 / 469
» The Locomotive Routing Problem
Sort
View
GECCO
2003
Springer
162views Optimization» more  GECCO 2003»
14 years 3 months ago
Optimization of Spare Capacity in Survivable WDM Networks
A network with restoration capability requires spare capacity to be used in the case of failure. Optimization of spare capacity is to find the minimum amount of spare capacity for ...
H. W. Chong, Sam Kwong
KES
2000
Springer
14 years 1 months ago
Knowledge based genetic algorithm for dynamic route selection
This paper addresses the problem of selecting route to a given destination on a load map under a dynamic environment. The proposed solution is using a genetic algorithm adopting v...
Hitoshi Kanoh, Tomohiro Nakamura
JNW
2007
112views more  JNW 2007»
13 years 10 months ago
A Multi-Commodity Flow Model for Optimal Routing in Wireless MESH Networks
— We propose a mathematical programming model of the routing problem in multi-hop wireless networks that takes into account quality of service requirements considering bandwidth ...
Antonio Capone, Fabio Martignon
IFIPTCS
2010
13 years 8 months ago
A Game-Theoretic Approach to Routing under Adversarial Conditions
Abstract. We present a game-theoretic framework for modeling and solving routing problems in dynamically changing networks. The model covers the aspects of reactivity and non-termi...
James Gross, Frank G. Radmacher, Wolfgang Thomas
JGO
2011
165views more  JGO 2011»
13 years 1 months ago
A biased random-key genetic algorithm for routing and wavelength assignment
The problem of routing and wavelength assignment (RWA) in wavelength division multiplexing (WDM) optical networks consists in routing a set of lightpaths and assigning a wavelength...
Thiago F. Noronha, Mauricio G. C. Resende, Celso C...