Showing 1 - 3 of 3
This paper introduces a class of cuts, called reachability cuts, for the Vehicle Routing <p> Problem with Time Windows …
Persistent link: https://www.econbiz.de/10005802218
A substantial amount of research has been devoted to the shortest path problem in networks where travel times are stochastic or (deterministic and) time-dependent. More recently, a growing interest has been attracted by networks that are both stochastic and time-dependent. In these networks, the...
Persistent link: https://www.econbiz.de/10005802221
In this article we introduce a new exact solution approach to the Capacitated Vehicle Routing Problem with Stochastic …
Persistent link: https://www.econbiz.de/10005802231