Sciweavers

228 search results - page 7 / 46
» Optimization of Multiple Vehicle Routing Problems using Appr...
Sort
View
ICRA
2010
IEEE
128views Robotics» more  ICRA 2010»
13 years 5 months ago
On optimal AUV track-spacing for underwater mine detection
— This work addresses the task of designing the optimal survey route that an autonomous underwater vehicle (AUV) should take in mine countermeasures (MCM) operations. It is assum...
David P. Williams
CDC
2009
IEEE
168views Control Systems» more  CDC 2009»
14 years 2 days ago
Content distribution by multiple multicast trees and intersession cooperation: Optimal algorithms and approximations
—The paper addresses the problem of massive content distribution in the network where multiple sessions coexist. In the traditional approaches, the sessions form separate overlay...
Xiaoying Zheng, Chunglae Cho, Ye Xia
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...
TAMC
2009
Springer
14 years 1 months ago
A Simple Greedy Algorithm for the k-Disjoint Flow Problem
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
Maren Martens
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, ...