A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit (original) (raw)
References
Archetti, C., Hertz, A., & Speranza, M. (2007). Metaheuristics for the team orienteering problem. Journal of Heuristics, 13(1), 49–76. Google Scholar
Avci, M., & Avci, M. G. (2017). A grasp with iterated local search for the traveling repairman problem with profits. Computers & Industrial Engineering, 113, 323–332. Google Scholar
Ben-Said, A., El-Hajj, R., & Moukrim, A. (2019). A variable space search heuristic for the capacitated team orienteering problem. J Heuristics, 25(2), 273–303. Google Scholar
Bouly, H., Dang, D. C., & Moukrim, A. (2010). A memetic algorithm for the team orienteering problem. A Quarterly Journal of Operations Research, 8(1), 49–70. Google Scholar
Boussier, S., Feillet, D., & Gendreau, M. (2007). An exact algorithm for team orienteering problems. A Quarterly Journal of Operations Research, 5(3), 211–230. Google Scholar
Butt, S. E., & Cavalier, T. M. (1994). A heuristic for the multiple tour maximum collection problem. Computers & Operations Research, 21, 101–111. Google Scholar
Butt, S. E., & Ryan, D. M. (1999). An optimal solution procedure for the multiple tour maximum collection problem using column generation. Computers & Operations Research, 26(4), 427–441. Google Scholar
Chao, I. M., Golden, B., & Wasil, E. (1996). The team orienteering problem. European Journal of Operational Research, 88(4), 464–474. Google Scholar
Chena, L., Chiangb, W. C., Russellb, R., Chenc, J., & Sunc, D. (2018). The probabilistic vehicle routing problem with service guarantees. Transportation Research Part E: Logistics and Transportation Review, 111, 149–164. Google Scholar
Croes, G. A. (1958). A method for solving traveling salesman problems. Operations Research, 6(6), 791–812. Google Scholar
Dang, D., Guibadj, R. N., & Moukrim, A. (2011). A pso-based memetic algorithm for the team orienteering problem, pp. 471–480.
Dang, D. C., El-Hajj, R., & Moukrim, A. (2013a). A branch-and-cut algorithm for solving the team orienteering problem. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR), 7874, 332–339. Article Google Scholar
Dang, D. C., Guibadj, R. N., & Moukrim, A. (2013b). An effective PSO-inspired algorithm for the team orienteering problem. European Journal of Operational Research, 229(2), 332–344. Article Google Scholar
Dantzig, G. B., & Ramser, J. H. (1959). The truck dispatching problem. Management Science, 6, 80–91. Article Google Scholar
El-Hajj, R., Dang, D. C., & Moukrim, A. (2016). Solving the team orienteering problem with cutting planes. Computers & Operations Research, 74, 21–30. Article Google Scholar
Feillet, D., Dejax, P., & Gendreau, M. (2005). Traveling salesman problems with profits. Transportation Science, 39(2), 188–205. Article Google Scholar
Francis, P. M., Smilowitz, R. K., & Tzur, M. (2008). The period vehicle routing problem and its extensions. In B. Golden, S. Raghavan, & E. Wasil (Eds.), The vehicle routing problem: Latest advances and new challenges (Vol. 43, pp. 73–102). Boston, MA: Springer. Chapter Google Scholar
Gavalas, D., Konstantopoulos, C., & Pantziou, K. M. G. (2014). A survey on algorithmic approaches for solving tourist trip design problems. Journal of Heuristics, 20(3), 291–328. Article Google Scholar
Golden, B. L., Wasil, E. A., Kelly, J. P., & Chao, I. M. (1998). The impact of metaheuristics on solving the vehicle routing problem: Algorithms, problem sets, and computational results. In T. G. Crainic & G. Laporte (Eds.), Fleet management and logistics. Centre for research on transportation (pp. 33–56). Boston, MA: Springer.
Groër, C. (2008). Parallel and serial algorithms for vehicle routing problems. Ph.d. thesis, University of Maryland, College Park, MD.
Ke, L., Zhai, L., Li, J., & Chan, F. T. (2016). Pareto mimic algorithm: An approach to the team orienteering problem. Omega, 61, 155–166. Google Scholar
Kennedy, J., & Eberhart, R. (1995). Particle swarm optimization. IEEE International Conference on Neural Networks Proceedings, 4, 1942–1948. Google Scholar
Keshtkarana, M., Ziaratia, K., Bettinellib, A., & Vigob, D. (2016). Enhanced exact solution methods for the team orienteering problem. International Journal of Production Research, 54(2), 591–601. Google Scholar
Koyuncu, I., & Yavuz, M. (2019). Duplicating nodes or arcs in green vehicle routing: A computational comparison of two formulations. Transportation Research Part E: Logistics and Transportation Review, 122, 605–623. Google Scholar
Labadie, N., Mansini, R., Melechovský, J., & Calvo, R. W. (2012). The team orienteering problem with time windows: An lp-based granular variable neighborhood search. European Journal of Operational Research, 220, 15–27. Google Scholar
Michallet, J., Prins, C., Amodeo, L., Yalaoui, F., & Vitry, G. (2014). Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services. Computers & Operations Research, 41, 196–207. Google Scholar
Muthuswamy, S., & Lam, S. (2011). Discrete particle swarm optimization for the team orienteering problem. Memetic Computing, 3(4), 287–303. Google Scholar
Ngueveu, S. U., Prins, C., & Calvo, R. W. (2010a). A hybrid Tabu search for the m-peripatetic vehicle routing problem. In Matheuristics: Hybridizing metaheuristics and mathematical programming (Vol. 10, pp. 253–266). Boston, MA: Springer.
Ngueveu, S. U., Prins, C., & Wolfler Calvo, R. (2010b). Lower and upper bounds for the m-peripatetic vehicle routing problem. 4OR, 8(4), 387–406. Google Scholar
Orlis, C., Laganáb, D., Dullaert, W., & Vigo, D. (2019). Distribution with quality of service considerations: The capacitated routing problem with profits and service level requirements. Omega. https://doi.org/10.1016/j.omega.2019.02.003.
Poggi de Aragão, M., Viana, H., & Uchoa, E. (2010). The team orienteering problem: Formulations and branch-cut and price. In: 10th workshop on algorithmic approaches for transportation modelling, optimization, and systems (ATMOS 2010), pp. 142–155.
Qin, H., Ming, W., Zhang, Z., Xie, Y., & Lim, A. (2015). A tabu search algorithm for the multi-period inspector scheduling problem. Computers & Operations Research, 59, 78–93. Google Scholar
Sadykov, R., & Vanderbeck, F. (2013). Bin packing with conflicts: A generic branch-and-price algorithm. INFORMS Journal on Computing, 25(2), 244–255. Google Scholar
Shixin, L., Shujin, Q., & Ruiyou, Z. (2018). A branch-and-price algorithm for the multi-trip multi-repairman problem with time windows. Transportation Research Part E: Logistics and Transportation Review, 116, 25–41. Google Scholar
Solomon, M. M. (1987). Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research, 35(2), 254–265. Article Google Scholar
Souffriau, W., Vansteenwegen, P., Vanden Berghe, G., & Van Oudheusden, D. (2010). A path relinking approach for the team orienteering problem. Computers & Operations Research, 37(11), 1853–1859. Article Google Scholar
Talarico, L., Springael, J., Sorensen, K., & Talarico, F. (2017). A large neighbourhood metaheuristic for the risk-constrained cash-in-transit vehicle routing problem. Computers & Operations Research, 78, 547–556. Article Google Scholar
Vansteenwegen, P., Souffriau, W., & Oudheusden, D. V. (2011). The team orienteering problem: A survey. European Journal of Operational Reasearch, 209, 1–10. Article Google Scholar
Vidal, T., Maculan, N., Ochi, L. S., & Vaz Penna, P. H. (2015). Large neighborhoods with implicit customer selection for vehicle routing problems with profits. Transportation Science, 50(2), 720–734. Article Google Scholar
Zhang, Z., Che, O., Cheang, B., Lim, A., & Qin, H. (2013). A memetic algorithm for the multiperiod vehicle routing problem with profit. European Journal of Operational Research, 229(3), 573–584. Google Scholar