EN|RU
|
![]() |
Volume 28, No 2, 2021, P. 35-59 UDC 519.8+518.25
Keywords: uncapacitated vehicles, matheuristic, split delivery service, time windows. DOI: 10.33048/daio.2021.28.703 Igor N. Kulachenko 1,2 Received November 13, 2020 References[1] O. Bräysy and M. Gendreau, Vehicle routing problem with time windows, Part I: Route construction and local search algorithms, Transp. Sci. 39 (1), 104–118 (2005).[2] M. Gendreau and C. D. Tarantilis, Solving large-scale vehicle routing problems with time windows: The state-of-the-art, Technical Report 2010-04 (CIR?RELT, Montreal, 2010). [3] S. C. Ho and D. Haugland, A tabu search heuristic for the vehicle routing problem with time windows and split deliveries, Comput. Oper. Res. 31 (12), 1947–1964 (2004). [4] T. Vidal, T. G. Crainic, M. Gendreau, and C. Prins, A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows, Comput. Oper. Res. 40 (1), 475–489 (2013). [5] I. N. Kulachenko and P. A. Kononova, A matheuristic for the drilling rig routing problem, in Mathematical Optimization Theory and Operations Research (Proc. 19th Int. Conf. MOTOR, Novosibirsk, Russia, July 6–10, 2020) (Springer, Cham, 2020), pp. 343–358 (Lect. Notes Comput. Sci., Vol. 12095). [6] P. Toth and D. Vigo, Vehicle Routing: Problems, Methods, and Applications (SIAM, Philadelphia, 2014). [7] B. L. Golden, S. Raghavan, and E. A. Wasil, The Vehicle Routing Problem: Latest Advances and New Challenges (Springer, New York, 2008). [8] C. Archetti and M. G. Speranza, Vehicle routing problems with split deliveries, Int. Trans. Oper. Res. 19 (1–2), 3–22 (2012). [9] K. Braekers, K. Ramaekers, and I. Van Nieuwenhuyse, The vehicle routing problem: State of the art classification and review, Comput. Ind. Eng. 99, 300–313 (2016). [10] V. Lambert, G. Laporte, and F. Louveaux, Designing collection routes through bank branches, Comput. Oper. Res. 20 (7), 783–791 (1993). [11] I. N. Kulachenko and P. A. Kononova, A hybrid local search algorithm for consistent periodic vehicle routing problem, Diskretn. Anal. Issled. Oper. 27 (2), 43–64 (2020) [Russian] [J. Ind. Appl. Math. 14 (2), 339–351 (2020)]. [12] S. Salhi, A. Imran, and N. A. Wassan, The multi-depot vehicle routing problem with heterogeneous vehicle fleet: Formulation and a variable neighborhood search implementation, Comput. Oper. Res. 52, 315–325 (2014). [13] F. Li, B. Golden, and E. Wasil, The open vehicle routing problem: Algorithms, large-scale test problems, and computational results, Comput. Oper. Res. 34 (10), 2918–2930 (2007). [14] E. Yakici and O. Karasakal, A min-max vehicle routing problem with split delivery and heterogeneous demand, Optim. Lett. 7, 1611–1625 (2013). [15] D. J. Aloise, D. Aloise, C. Rocha, C. C. Ribeiro, R. Filho, and L. Moura, Scheduling workover rigs for onshore oil production, Discrete Appl. Math. 154 (5), 695–702 (2006). [16] G. Ribeiro, G. Desaulniers, J. Desrosiers, T. Vidal, and B. Vieira, Efficient heuristics for the workover rig routing problem with a heterogeneous fleet and a finite horizon, J. Heur. 20, 677–708 (2014). [17] D. Pecin, C. Contardo, G. Desaulniers, and E. Uchoa, New enhancements for the exact solution of the vehicle routing problem with time windows, INFORMS J. Comput. 29 (3), 489–502 (2017). [18] C. Archetti and M. G. Speranza, A survey on matheuristics for routing problems, EURO J. Comput. Optim. 2, 223–246 (2014). [19] Matheuristics: Hybridizing Metaheuristics and Mathematical Programming (Springer, New York, 2009) (Ann. Inf. Syst., Vol. 10). [20] El-G. Talbi, Hybrid Metaheuristics (Springer, Berlin, 2013). [21] N. Mladenovic and P. Hansen, Variable neighborhood search, Comput. Oper. Res. 24, 1097–1100 (1997). [22] N. Mladenovic, P. Hansen, R. Todosijevic, and S. Hanafi, Variable neighborhood search: Basics and variants, EURO J. Comput. Optim. 5 (3), 423–454 (2017). [23] V. C. Hemmelmayr, K. F. Doerner, R. F. Hartl, and D. Vigo, Models and algorithms for the integrated planning of bin allocation and vehicle routing in solid waste management, Transp. Sci. 48, 103–120 (2014). [24] El-G. Talbi, Metaheuristics: From Design to Implementation (Wiley, Hoboken, NJ, 2009). [25] M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979; Mir, Moscow, 1982 [Russian]). [26] B. W. Kernighan and S. Lin, An efficient heuristic procedure for partitioning graphs, Bell Labs Tech. J. 49 (2), 291–307 (1970). [27] Y. Nagata, O. Bräysy, and W. Dullaert, A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows, Comput. Oper. Res. 37 (4), 724–737 (2010). [28] M. M. Solomon, Algorithms for the vehicle routing and scheduling problems with time window constraints, Oper. Res. 35, 254–265 (1985). [29] S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, Optimization by simulated annealing, Science 220 (4598), 671–680 (1983). [30] F. Hutter, H. H. Hoos, and K. Leyton-Brown, Sequential model-based optimization for general algorithm configuration, in Learning and Intelligent Optimization (Sel. Pap. 5th Int. Conf., Rome, Italy, Jan. 17–21, 2011) (Springer, Heidelberg, 2011), pp. 507–523 (Lect. Notes Comput. Sci., Vol. 6683). |
|
![]() |
|
© Sobolev Institute of Mathematics, 2015 | |
![]() |
|