Loading...
Please wait, while we are loading the content...
Similar Documents
A Branch-and-Cut-and-Price algorithm for the Multi-Depot Capacitated Vehicle Routing Problem with Stochastic Demands
| Content Provider | Semantic Scholar |
|---|---|
| Author | Christiansen, Christian H. Eglese, Richard W. Letchford, Adam N. Lysgaard, Jens |
| Copyright Year | 2007 |
| Abstract | In this article we introduce and implement a branch-and-cut-and-price algorithm for the Multiple Depot Vehicle Routing Problem with Stochastic Demands. We consider the delivery of a common commodity to a set of customers from a set of non-capacitated depots. The demand of each customer is described by a random variable, whose actual value becomes known upon arrival at the customer. The deliveries are conducted by a fleet of capacitated vehicles. Our implementation of pricing introduces heuristic algorithms for speeding up the pricing in addition to exact pricing. We also introduce domination criteria, which are embedded in the exact pricing. This greatly increases the efficiency of the overall pricing procedure. We have tested our algorithm on a large number of test instances and results are reported. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.lancs.ac.uk/staff/letchfoa/articles/mdcvrpsd.pdf |
| Alternate Webpage(s) | https://www.researchgate.net/profile/Adam_Letchford/publication/228917948_A_Branch-and-Cut-and-Price_algorithm_for_the_Multi-Depot_Capacitated_Vehicle_Routing_Problem_with_Stochastic_Demands/links/0fcfd50d07c161159d000000.pdf |
| Alternate Webpage(s) | http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.108.7797&rep=rep1&type=pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
