Abstract
Drayage is the stage of the intermodal transport that deals with transport of freight on trucks among the intermodal terminal, and customers and suppliers that are located in its hinterland. This work proposes an algorithm based on simulated annealing heuristics to solve the operations of drayage. This algorithm has been used to solve battery problems, demonstrating the validity and suitability of its results, which were compared with exact method.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Caris, A., & Janssens, G. K. (2009). A local search heuristic for the pre- and end-haulage of intermodal container terminals. Computers & Operations Research, 36(10), 2763–2772.
Caris, A., & Janssens, G. K. (2010). A deterministic annealing algorithm for the pre- and end-haulage of intermodal container terminals. International Journal of Computer Aided Engineering and Technology, 2(4), 340–355.
Chiang, W. C., & Russell, R. A. (1996). Simulated annealing metaheuristics for the vehicle routing problem with time windows. Annals of Operations Research, 63(1), 3–27.
Eglese, R. W. (1990). Simulated annealing: A tool for operational research. European Journal of Operational Research, 46, 271–281.
Escudero-Santana, A., Munuzuri, J., Cortes, P., & Aparicio, P. (2015). A viral system to optimise the daily drayage problem. International Journal of Bio-Inspired Computation, 3(7), 176–182.
Escudero-Santana, A., Munuzuri, J., Guadix, J., & Arango, C. (2013). Dynamic approach to solve the daily drayage problem with transit time uncertainty. Computers in Industry, 62(2), 165–175.
Jula, H., Dessouky, M. M., Ioannou, P., & Chassiakos, A. (2005). Container movement by trucks in metropolitan networks: Modeling and optimization. Transportation Research Part E, 41(3), 235–259.
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220(4598), 671–680.
Smilowitz, K. (2006). Multi-resource routing with flexible tasks: An application in drayage operations. IIE Transactions Institute of Industrial Engineers, 38(7), 570–590.
Solomon, M. (1987). Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research, 35(2), 254–265.
Xue, Z., Zhang, C., Lin, W. H., Miao, L., & Yang, P. (2014). A tabu search heuristic for the local container drayage problem under a new operation mode. Transportation Research Part E, 62, 136–150.
Zhang, R., Yun, W. Y., & Moon, I. (2009). A reactive tabu search algorithm for the multi-depot container truck transportation problem. Transportation Research Part E, 45(6), 904–914.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Escudero-Santana, A., Cuberos-Gallardo, M., Muñuzuri, J., Cortés, P. (2019). Using Simulated Annealing to Solve the Daily Drayage Problem with Hard Time Windows. In: Mula, J., Barbastefano, R., Díaz-Madroñero, M., Poler, R. (eds) New Global Perspectives on Industrial Engineering and Management. Lecture Notes in Management and Industrial Engineering. Springer, Cham. https://doi.org/10.1007/978-3-319-93488-4_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-93488-4_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-93487-7
Online ISBN: 978-3-319-93488-4
eBook Packages: EngineeringEngineering (R0)