Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015, Article ID 134763, 7 pages
http://dx.doi.org/10.1155/2015/134763
Research Article

A Combinatorial Benders’ Cuts Algorithm for the Local Container Drayage Problem

1Department of Transportation Engineering, College of Civil Engineering, Shenzhen University, Shenzhen 518060, China
2Research Center for Modern Logistics, Graduate School at Shenzhen, Tsinghua University, Shenzhen 518055, China
3Shenzhen Logistics Engineering & Simulation Laboratory, Graduate School at Shenzhen, Tsinghua University, Shenzhen 518055, China

Received 6 November 2014; Accepted 15 February 2015

Academic Editor: Jun-Juh Yan

Copyright © 2015 Zhaojie Xue et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. X. Wang and A. C. Regan, “Local truckload pickup and delivery with hard time window constraints,” Transportation Research Part B: Methodological, vol. 36, no. 2, pp. 97–112, 2002. View at Publisher · View at Google Scholar · View at Scopus
  2. A. Imai, E. Nishimura, and J. Current, “A Lagrangian relaxation-based heuristic for the vehicle routing with full container load,” European Journal of Operational Research, vol. 176, no. 1, pp. 87–105, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  3. A. Caris and G. K. Janssens, “A local search heuristic for the pre- and end-haulage of intermodal container terminals,” Computers and Operations Research, vol. 36, no. 10, pp. 2763–2772, 2009. View at Publisher · View at Google Scholar · View at Scopus
  4. R. K. Cheung, N. Shi, W. B. Powell, and H. P. Simao, “An attribute-decision model for cross-border drayage problem,” Transportation Research Part E: Logistics and Transportation Review, vol. 44, no. 2, pp. 217–234, 2008. View at Publisher · View at Google Scholar · View at Scopus
  5. R. Namboothiri and A. L. Erera, “Planning local container drayage operations given a port access appointment system,” Transportation Research Part E: Logistics and Transportation Review, vol. 44, no. 2, pp. 185–202, 2008. View at Publisher · View at Google Scholar · View at Scopus
  6. L. Coslovich, R. Pesenti, and W. Ukovich, “Minimizing fleet operating costs for a container transportation company,” European Journal of Operational Research, vol. 171, no. 3, pp. 776–786, 2006. View at Publisher · View at Google Scholar · View at Scopus
  7. R. Y. Zhang, W. Y. Yun, and I. K. Moon, “Modeling and optimization of a container drayage problem with resource constraints,” International Journal of Production Economics, vol. 133, no. 1, pp. 351–359, 2011. View at Publisher · View at Google Scholar · View at Scopus
  8. R. Y. Zhang, W. Y. Yun, and I. Moon, “A reactive tabu search algorithm for the multi-depot container truck transportation problem,” Transportation Research Part E: Logistics and Transportation Review, vol. 45, no. 6, pp. 904–914, 2009. View at Publisher · View at Google Scholar · View at Scopus
  9. R. Zhang, W. Y. Yun, and H. Kopfer, “Heuristic-based truck scheduling for inland container transportation,” OR Spectrum, vol. 32, no. 3, pp. 787–808, 2010. View at Publisher · View at Google Scholar · View at Scopus
  10. K. Smilowitz, “Multi-resource routing with flexible tasks: an application in drayage operations,” IIE Transactions, vol. 38, no. 7, pp. 555–568, 2006. View at Google Scholar
  11. Z. Xue, C. Zhang, W.-H. Lin, L. Miao, and P. Yang, “A tabu search heuristic for the local container drayage problem under a new operation mode,” Transportation Research Part E: Logistics and Transportation Review, vol. 62, pp. 136–150, 2014. View at Publisher · View at Google Scholar · View at Scopus
  12. M. Drexl, “Synchronization in vehicle routing—a survey of VRPs with multiple synchronization constraints,” Transportation Science, vol. 46, no. 3, pp. 297–316, 2012. View at Publisher · View at Google Scholar · View at Scopus
  13. D. Bredström and M. Rönnqvist, “Combined vehicle routing and scheduling with temporal precedence and synchronization constraints,” European Journal of Operational Research, vol. 191, no. 1, pp. 19–31, 2008. View at Publisher · View at Google Scholar · View at Scopus
  14. A. Dohn, M. S. Rasmussen, and J. Larsen, “The vehicle routing problem with time windows and temporal dependencies,” Networks, vol. 58, no. 4, pp. 273–289, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. J. K. Lenstra and A. H. G. Rinnooy Kan, “Complexity of vehicle-routing and scheduling problems,” Networks, vol. 11, no. 2, pp. 221–227, 1981. View at Publisher · View at Google Scholar · View at Scopus
  16. J. Hooker, Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction, John Wiley & Sons, New York, NY, USA, 2000. View at Publisher · View at Google Scholar · View at MathSciNet
  17. G. Codato and M. Fischetti, “Combinatorial Benders' cuts for mixed-integer linear programming,” Operations Research, vol. 54, no. 4, pp. 756–766, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus