Sciweavers

2343 search results - page 65 / 469
» The Locomotive Routing Problem
Sort
View
WSC
2008
13 years 10 months ago
Multi-objective UAV mission planning using evolutionary computation
This investigation develops an innovative algorithm for multiple autonomous unmanned aerial vehicle (UAV) mission routing. The concept of a UAV Swarm Routing Problem (SRP) as a ne...
Adam J. Pohl, Gary B. Lamont
INFOCOM
2000
IEEE
14 years 3 days ago
Dynamic Routing of Bandwidth Guaranteed Tunnels with Restoration
— This paper presents new algorithms for dynamic routing of restorable bandwidth guaranteed paths. Dynamic routing implies routing of requests that arrive one-by-one with no a pr...
Murali S. Kodialam, T. V. Lakshman
ENDM
2006
77views more  ENDM 2006»
13 years 7 months ago
A Two-stage Model for a Day-ahead Paratransit Planning Problem
We consider a dynamic planning problem for paratransit transportation. The focus is on a decision to take one day ahead: which requests to serve with own vehicles, and which reque...
Maria L. A. G. Cremers, Willem K. Klein Haneveld, ...
COR
2007
112views more  COR 2007»
13 years 7 months ago
The bi-objective covering tour problem
The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the ...
Nicolas Jozefowiez, Frédéric Semet, ...
ANOR
2011
214views more  ANOR 2011»
13 years 2 months ago
A hybrid constraint programming approach to the log-truck scheduling problem
Abstract. Scheduling problems in the forest industry have received significant attention in the recent years and have contributed many challenging applications for optimization te...
Nizar El Hachemi, Michel Gendreau, Louis-Martin Ro...