Sciweavers

2343 search results - page 66 / 469
» The Locomotive Routing Problem
Sort
View
ARCS
2004
Springer
14 years 1 months ago
Ant Colony Optimization for dynamic Traveling Salesman Problems
: This paper addresses the optimization of a dynamic Traveling Salesman Problem using the Ant Colony Optimization algorithm. Ants are social insects with limited skills that live i...
Carlos A. Silva, Thomas A. Runkler
COR
2010
152views more  COR 2010»
13 years 7 months ago
Variable neighborhood search for the dial-a-ride problem
In dial-a-ride problems passengers have to be transported between pre-specified pickup and delivery locations under user inconvenience considerations. The problem variant consider...
Sophie N. Parragh, Karl F. Doerner, Richard F. Har...
INFORMS
2008
241views more  INFORMS 2008»
13 years 7 months ago
Solving the Capacitated Local Access Network Design Problem
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
F. Sibel Salman, R. Ravi, John N. Hooker
TRANSCI
2010
169views more  TRANSCI 2010»
13 years 2 months ago
A Model and Algorithm for the Courier Delivery Problem with Uncertainty
We consider the Courier Delivery Problem, a variant of the Vehicle Routing Problem with time windows in which customers appear probabilistically and their service times are uncert...
Ilgaz Sungur, Yingtao Ren, Fernando Ordó&nt...
COMCOM
1999
87views more  COMCOM 1999»
13 years 7 months ago
Virtual path layout in ATM networks based on the P-median problem
We study the problem of virtual path layout in ATM networks. Virtual path (VP) and virtual channel are used by the ATM networks in realizing multiplexing, resource management and ...
W. K. Lai, R. F. Chang