Sciweavers

540 search results - page 13 / 108
» Competitive Routing over Time
Sort
View

Publication
250views
14 years 10 months ago
Limited bus stop service: An evaluation of an implementation strategy
Transit agencies implement limited-stop (express) bus services as a mean to provide an attractive and competitive transportation mode when compared to the automobile. In 2008, the ...
El-Geneidy, A. & Surprenant-Legault, J.
COR
2010
152views more  COR 2010»
13 years 9 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...
ESA
2009
Springer
109views Algorithms» more  ESA 2009»
14 years 1 months ago
Preemptive Online Scheduling with Reordering
We consider online preemptive scheduling of jobs, arriving one by one, on m identical parallel machines. A buffer of a fixed size K > 0, which assists in partial reordering of...
György Dósa, Leah Epstein
ICCAD
2006
IEEE
106views Hardware» more  ICCAD 2006»
14 years 5 months ago
Wire density driven global routing for CMP variation and timing
In this paper, we propose the first wire density driven global routing that considers CMP variation and timing. To enable CMP awareness during global routing, we propose a compac...
Minsik Cho, David Z. Pan, Hua Xiang, Ruchir Puri
EOR
2010
159views more  EOR 2010»
13 years 3 months ago
An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles
The vehicle routing problem with multiple use of vehicles is a variant of the classical vehicle routing problem. It arises when each vehicle performs several routes during the wor...
Nabila Azi, Michel Gendreau, Jean-Yves Potvin