Sbai, I., Limem, O., Krichen, S. (2020b). An effective genetic algorithm for solving the capacitated vehicle routing problem with two-dimensional loading constraint. International Journal of Computational Intelligence Studies , 9(1/2), 85–106.
Song, X., Jones, D., Asgari, N., Pigden, T. (2019). Multi-objective vehicle routing and loading with time window constraints: A real-life application. Annals of Operations Research , 291, 799–825 [Online]. Available at: https://doi.org/10.1007/s10479-019-03205-2.
Tao, Y. and Wang, F. (2015). An effective Tabu search approach with improved loading algorithms for the 3L-CVRP. Computers & Operations Research , 55, 127–140.
Tarantilis, C.D., Zachariadis, E.E., Kiranoudis, C.T. (2009). A hybrid metaheuristic algorithm for the integrated vehicle routing and three-dimensional container-loading problem. IEEE Transactions on Intelligent Transportation Systems , 10(2), 255–271.
Toth, P. and Vigo, D. (2002). The vehicle routing problem. SIAM Monographs on Discrete Mathematics and Applications . SIAM, Philadelphia [Online]. Available at: http://www.lavoisier.fr/livre/notice.asp?id=OS6WSLARK6SOWC.
Vega-Mejia, C.A., Montoya-Torres, J.R., Islam, S.M.N. (2019). A nonlinear optimization model for the balanced vehicle routing problem with loading constraints. International Transactions in Operational Research , 26(3), 794–835.
Vega-Mejia, C., González-Neira, E., Montoya-Torres, J., Islam, S. (2020). Using a hybrid heuristic to solve the balanced vehicle routing problem with loading constraints. International Journal of Industrial Engineering Computations , 11(2), 255–280.
Wei, L., Zhang, Z., Zhang, D., Lim, A. (2015). A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints. European Journal of Operational Research , 243(3), 798–814.
Wei, L., Zhang, Z., Zhang, D., Leung, S.C. (2018). A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints. European Journal of Operational Research , 265(3), 843–859.
Wei, L., Wang, Y., Cheng, H., Huang, J. (2019). An open space based heuristic for the 2D strip packing problem with unloading constraints. Applied Mathematical Modelling , 70, 67–81.
Wisniewski, M.A., Ritt, M., Buriol, L.S. (2011). A Tabu search algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints. In XLIII Simposio Brasilero de Pesquisa Operacional , 15–18 August, Ubatuba.
Yi, J. and Bortfeldt, A. (2016). The capacitated vehicle routing problem with three-dimensional loading constraints and split delivery – A case study. In Proceedings of the Operations Research , Fink, A., Fügenschuh, A., Geiger, Martin J. (eds). Springer, Cham.
Zachariadis, E., Tarantilis, C., Kiranoudis, C. (2009). A guided Tabu search for the vehicle routing problem with two-dimensional loading constraints. European Journal of Operational Research , 195, 729–743.
Zachariadis, E., Tarantilis, C., Kiranoudis, C. (2013). Integrated distribution and loading planning via a compact metaheuristic algorithm. European Journal of Operational Research , 228, 56–71.
Zachariadis, E.E., Tarantilis, C.D., Kiranoudis, C.T. (2016). The vehicle routing problem with simultaneous pick-ups and deliveries and two-dimensional loading constraints. European Journal of Operational Research , 251(2), 369–386.
Zachariadis, E.E., Tarantilis, C.D., Kiranoudis, C.T. (2017). Vehicle routing strategies for pick-up and delivery service under two-dimensional loading constraints. Operational Research , 17(1), 115–143.
Zhang, D., Cai, S., Ye, F., Si, Y.W., Nguyen, T.T. (2017). A hybrid algorithm for a vehicle routing problem with realistic constraints. Information Sciences , 394/395, 167–182.
Zhou, S., Li, X., Zhang, K., Du, N. (2019). Two-dimensional knapsack-block packing problem. Applied Mathematical Modelling , 73, 1–18.
Zhu, W., Qin, H., Lim, A., Wang, L. (2012). A two-stage Tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP. Computers & Operations Research , 39(9), 2178–2195.
Конец ознакомительного фрагмента.
Текст предоставлен ООО «ЛитРес».
Прочитайте эту книгу целиком, купив полную легальную версию на ЛитРес.
Безопасно оплатить книгу можно банковской картой Visa, MasterCard, Maestro, со счета мобильного телефона, с платежного терминала, в салоне МТС или Связной, через PayPal, WebMoney, Яндекс.Деньги, QIWI Кошелек, бонусными картами или другим удобным Вам способом.