26 search results - page 2 / 6 » A metaheuristic approach to the urban transit routing proble... |
CEC
2007
IEEE
13 years 9 months ago
2007
IEEE
Routing in computer networks is a nonlinear combinatorial optimization problem with numerous constraints and is classified as an NP-complete problem. There are certain important Qo...
ATMOS
2007
13 years 7 months ago
2007
We discuss timetables in ex-urban bus traffic that consist of many trips serviced every day together with some exceptions that do not repeat daily. Traditional optimization methods...
EUROCAST
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. In this paper the author presents three approaches to parallel Tabu Search, applied to several instances of the Capacitated Vehicle Routing Problem with soft Time Windows...
EMO
2001
Springer
13 years 10 months ago
2001
Springer
Abstract. Topology design of enterprise networks is a hard combinatorial optimization problem. It has numerous constraints, several objectives, and a very noisy solution space. Bes...
IPPS
2007
IEEE
13 years 11 months ago
2007
IEEE
Abstract—In this paper the author presents three approaches to parallel Tabu Search, applied to several instances of the Capacitated Vehicle Routing Problem with Time Windows (CV...