Sciweavers

320 search results - page 1 / 64
» A Model and Algorithm for the Courier Delivery Problem with ...
Sort
View
TRANSCI
2010
169views more  TRANSCI 2010»
12 years 11 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...
NETWORKS
2007
13 years 4 months ago
Models and branch-and-cut algorithms for pickup and delivery problems with time windows
In the pickup and delivery problem with time windows (PDPTW), capacitated vehicles must be routed to satisfy a set of transportation requests between given origins and destination...
Stefan Ropke, Jean-François Cordeau, Gilber...
MP
2010
145views more  MP 2010»
13 years 3 months ago
The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm
The Traveling Salesman Problem with Pickup and Delivery (TSPPD) is defined on a graph containing pickup and delivery vertices between which there exists a one-toone relationship. ...
Irina Dumitrescu, Stefan Ropke, Jean-Franço...
WSC
2004
13 years 5 months ago
A Stochastic On-Line Model for Shipment Date Quoting with On-Time Delivery Guarantees
The paper introduces a new model for shipment date quoting with potential applications in E-commerce. First, a customer sends to the vendor a request for an item advertised at a c...
Yunpeng Pan, Leyuan Shi
SIAMSC
2011
219views more  SIAMSC 2011»
12 years 11 months ago
Fast Algorithms for Bayesian Uncertainty Quantification in Large-Scale Linear Inverse Problems Based on Low-Rank Partial Hessian
We consider the problem of estimating the uncertainty in large-scale linear statistical inverse problems with high-dimensional parameter spaces within the framework of Bayesian inf...
H. P. Flath, Lucas C. Wilcox, Volkan Akcelik, Judi...