Branch‐and‐cut algorithms for the vehicle routing problem with trailers and transshipments
- 20 September 2013
- Vol. 63 (1), 119-133
- https://doi.org/10.1002/net.21526
Abstract
No abstract availableKeywords
Funding Information
- Deutsche Forschungsgemeinschaft (IR 122/5-1)
This publication has 22 references indexed in Scilit:
- The combined manpower-vehicle routing problem for multi-staged servicesExpert Systems with Applications, 2010
- A new mixed integer linear model for a rich vehicle routing problem with docking constraintsAnnals of Operations Research, 2010
- The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution methodEuropean Journal of Operational Research, 2010
- A robust branch‐cut‐and‐price algorithm for the heterogeneous fleet vehicle routing problemNetworks, 2009
- An attribute–decision model for cross-border drayage problemTransportation Research. Part E, Logistics and Transportation Review, 2008
- A tabu search heuristic for the truck and trailer routing problemComputers & Operations Research, 2006
- Formulations and Valid Inequalities for the Heterogeneous Vehicle Routing ProblemMathematical Programming, 2005
- A polyhedral study of the asymmetric traveling salesman problem with time windowsNetworks, 2000
- Holonic transport scheduling with teletruckApplied Artificial Intelligence, 2000
- Solving real-life vehicle routing problems efficiently using tabu searchAnnals of Operations Research, 1993