Abstract
The swap body vehicle routing problem (SB-VRP) is a generalization of the classical vehicle routing problem where a particular structure as well as several operational aspects for the trucks composing the fleet are considered. This research has been motivated by the VeRoLog Solver Challenge 2014, organized together by VeRoLog and PTV group, aiming to motivate the study of real-world logistic problems. A truck can carry either only one swap body or, in addition, an extra trailer with an extra swap body. For the latter, special depots, called swap locations, can be used to drop and pickup the swap bodies. These operations may affect the feasibility and the cost of a route, and therefore the overall operational cost. In this paper, we propose a cluster-first route-second heuristic for the SB-VRP. Computational experiments are conducted over the benchmark instances proposed for the competition, simulating a practical environment by considering limited resources and execution time. The results obtained are of very good quality, where our approach ended as runner-up in the final set of instances and performs similarly to the other algorithms in the remaining cases, showing its potential to be applied in practice.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Notes
We remark that the results reported in Absi et al. (2015) for our method are based on a preliminary draft of this research.
References
Absi, N., Cattaruzza, D., Feillet, D., & Housseman, S. (2015). A relax-and-repair heuristic for the swap-body vehicle routing problem. Annals of Operations Research, 1–22. doi:10.1007/s10479-015-2098-8.
Caramia, M., & Guerriero, F. (2010). A heuristic approach for the truck and trailer routing problem. Journal of the Operational Research Society, 61(7), 1168–1180.
Chao, I.-M. (2002). A tabu search method for the truck and trailer routing problem. Computers & Operations Research, 29, 33–51.
Derigs, U., Pullmann, M., & Vogel, U. (2013). Truck and trailer routing problems, heuristics and computational experience. Computers & Operations Research, 40(2), 536–546.
Drexl, M. (2011). Branch-and-price and heuristic column generation for the generalized truck-and-trailer routing problem. Journal of Quantitative Methods for Economics and Business Administration, 12(1), 5–38.
Drexl, M. (2013). Applications of the vehicle routing problem with trailers and transshipments. European Journal of Operational Research, 227(2), 275–283.
Feo, T. A., & Resende, M. G. (1995). Greedy randomized adaptive search procedures. Journal of Global Optimization, 6(2), 109–133.
Gerdessen, J. C. (1996). Vehicle routing problem with trailers. European Journal of Operational Research, 93(1), 135–147.
Gillett, B. E., & Miller, L. R. (1974). A heuristic algorithm for the vehicle-dispatch problem. Operations Research, 22(2), 340–349.
Golden, B. L., Raghavan, S., & Wasil, E. A. (2008). The vehicle routing problem: Latest advances and new challenges (Vol. 43). New York: Springer.
Groer, C. (2012). VRPH. http://projects.coin-or.org/VRPH. Accessed May 2016.
Heid, W., Hasle, G., & Vigo, D. (2014). Verolog solver challenge 2014: Problem description. In VeRoLog (EURO working group on vehicle routing and logistics optimization) and PTV group (pp. 1–6).
Huber, S., & Geiger, M. J. (2014). Swap body vehicle routing problem: A heuristic solution approach. In Computational Logistics (pp. 16–30). Berlin: Springer.
Lin, S.-W., Yu, V. F., & Chou, S.-Y. (2009). Solving the truck and trailer routing problem based on a simulated annealing heuristic. Computers & Operations Research, 36(5), 1683–1692.
Lin, S.-W., Yu, V. F., & Chou, S.-Y. (2010). A note on the truck and trailer routing problem. Expert Systems with Applications, 37(1), 899–903.
Lum, O., Chen, P., Wang, X., Golden, B., & Wasil, E. (2015). A heuristic approach for the swap-body vehicle routing problem. In 14th INFORMS computing society conference (pp. 172–187).
Open MP Architecture Review Board. (2011). OpenMP application program interface version, version 3.1.
Scheuerer, S. (2006). A tabu search heuristic for the truck and trailer routing problem. Computers & Operations Research, 33(4), 894–909.
Semet, F. (1995). A two-phase algorithm for the partial accessibility constrained vehicle routing problem. Annals of Operations Research, 61(1), 45–65.
Semet, F., & Taillard, E. (1993). Solving real-life vehicle routing problems efficiently using tabu search. Annals of Operations Research, 41(4), 469–488.
Tan, K., Chew, Y., & Lee, L. (2006). A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems. European Journal of Operational Research, 172(3), 855–885.
Toth, P., Vigo, D., Toth, P., & Vigo, D. (2014). Vehicle routing: Problems, methods, and applications (2nd ed.). Philadelphia: Society for Industrial and Applied Mathematics.
Villegas, J. G., Prins, C., Prodhon, C., Medaglia, A. L., & Velasco, N. (2011). A GRASP with evolutionary path relinking for the truck and trailer routing problem. Computers & Operations Research, 38(9), 1319–1334.
Acknowledgments
This research is partially supported by Grants PICT-2010-0304, PICT-2011-0817, PICT-2013-2460 and UBACyT 20020100100666. The authors are grateful to two anonymous referees and the associate editors for their careful reading and valuable comments, which helped improving the article.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Miranda-Bront, J.J., Curcio, B., Méndez-Díaz, I. et al. A cluster-first route-second approach for the swap body vehicle routing problem. Ann Oper Res 253, 935–956 (2017). https://doi.org/10.1007/s10479-016-2233-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-016-2233-1