References
- Ait Mamoun, K., Hammadi, L., Novaes, A. G. N., El Ballouti, A., Souza De Cursi, E. (2022a) Optimisation models for Transportation Network Design under uncertainty: a literature review. International Journal of Recent Advances in Mechanical Engineering (IJMECH), 11(1), February 2022.
- Ait Mamoun, K., Hammadi, L., Novaes, A. G. N., El Ballouti, A., Souza De Cursi, E. (2022b) An optimisation solution of Capacitated Vehicle Routing Problem (CVRP). In: 11th International Symposium on Signal, Image, Video and Communications (ISIVC), El Jadida, Morocco, 2022, 1-5, doi: 10.1109/ISIVC54825.2022.9800726.
- Asih, A.M.S., Sopha, B.M., Kriptaniadewa, G. (2017) Comparison study of metaheuristics: Empirical application of delivery problems. International Journal of Engineering Business Management. 2017, 9. doi:10.1177/1847979017743603.
- Aydınalp, Z., Özgen, D. (2023) Solving vehicle routing problem with time windows using metaheuristic approaches. International Journal of Intelligent Computing and Cybernetics, 16(1), 121-138(18). Emerald Group Publishing Limited. https://doi.org/10.1108/IJICC-01-2022-0021.
- Baldacci, R. and Mingozzi, A. (2004) A Unified Exact Algorithm for The CVRP Base on A Two-Commodity Network Flow Formulation. OR, 52, 723-738.
- Baldacci, R., Bartolini, E., Laporte G. (2010) Some application of the generalized vehicle routing problem. Journal of the operational research society, 61,1072-1077.
- Beasley, J. (1983) Route first-cluster second methods for VRP. Omega, 1, 403-408.
- Braekers, K., Ramaekers, K., Van Nieuwenhuyse, I. (2016) The vehicle routing problem: State of the art classification and review. Computers & Industrial Engineering, 99, 300–313.
- Campelo, P., Neves-Moreira, F., Amorim, P., Almada-Lobo, B. (2019) Consistent vehicle routing problem with service level agreements: A case study in the pharmaceutical distribution sector. Eur. J. Oper. Res., 273(1), 131–45, Feb. 2019, doi: 10.1016/j.ejor.2018.07.030.
- Ceselli, A., Righini, G., Tresoldi, E. (2014) Combined location and routing problems for drug distribution. Discrete Appl. Math. 165, 130–145.
- Clarke, G. and Wright, J. (1964) Scheduling of Vehicles from a Central Depot a Number of Delivery Points. Operations Research, 12, 568-581.
- Cordeau, J. (2006) A Branch-And-Cut Algorithm For The Dial-a ride problem. OR, 54(3), 573-586.
- Cordeau, J.-F., Laporte, G., Savelsbergh, M. W., Vigo, D. (2007) Vehicle routing. Transportation, Handbooks in Oerations Research and Management Science, 14, 195-224.
- Dantzig, G. B., Ramser, J.H. (1959) The truck dispatching problem. Management science, 6(1), 8091.
- Escuín, D., Millán, C., Larrodé, E. (2012) Modelization of time-dependent urban freight problems by using a multiple number of distribution centers. Netw. Spatial Econ. 12, 321–336.
- Fischetti, M., Toth P. and Vigo, D. (1994) A branch and bound algorithm for the capacitated vehicle routing problem on direct graphs. Operations Research, 42, 846-859.
- Gendreau, M., Potvin, J. Y. (2010) Handbook of Metaheuristics, Second Edition, Springer, New York.
- Hofmann, S., Knell, T. (2019) Distribution logistics - definition, basics, examples. International machine markt.
- Kallehauge, B., Larsen, J., Madsen, O.B., Solomon, M.M. (2005). Vehicle Routing Problem with Time Windows. In: Desaulniers, G., Desrosiers, J., Solomon, M.M. (eds) Column Generation. Springer, Boston, MA. https://doi.org/10.1007/0-387-25486-2_3;
- Lahyani, R., Khemakhem, M., Semet, F. (2015) Rich vehicle routing problems: From a taxonomy to a definition. European Journal of Operational Research 241 (1), 1–14.
- Laporte, G. and Nobert, Y. (1987) Exact algorithms for the Vehicle Routing Problem. Discrete Mathematics, 31, 147-184.
- Laporte, G., Gendreau, M., Potvin, J. and Semet, F. (2002) Classical and modern heuristics for the vehicle routing problem. International Transactions in OR, 7, 285-300.
- Laporte, G. (2009) Fifty Years of Vehicle Routing. Transportation Science, 43(4), 408416.
- Laporte, G.,Ropke, S., Vidal, T. (2014) Heuristics for the vehicle routing problem. Vehicle routing: Problems, Methods and Applications, Second Edition. Philadelphia: SIAM, 18–87.
- Liu, R., Xie, X., Garaix, T. (2014). Hybridization of tabu search with feasible and infeasible local searches for periodic home health care logistics. Omega, 47, 17–32.
- Magalhães, J., de Sousa, J.P. (2006) Dynamic VRP in pharmaceutical distribution – a case study. Central Eur. J. Oper. Res. 14, 177–192.
- Marinakis, Y., Migdalas, A. (2007) Annotated bibliography in vehicle routing. Oper Res Int J, 7, 27–46. https://doi.org/10.1007/BF02941184.
- Martinelli, R., Poggi, M. and Subramanian, A. (2011) Improved bounds for large scale capacitated arc routing problem. Dep. de Informática, (PUC-Rio), Brazil. Technical report MCC14/11.
- Martins, S., Amorim, P., Figueira, G., Almada-Lobo, B. (2017) An optimization-simulation approach to the network redesign problem of pharmaceutical wholesalers. Comput. Ind. Eng., 106, 315–328.
- Mole, R., S. Jameson, S. (1976) A sequential route-building algorithm employingageneralized saving criterion. Operation Research Quarterly, 11, 503-511.
- Nakiboglu, G., Gunes, P. E. (2018) Vehicle Routing Problem in Pharmaceuticals Distribution and Genetic Algorithm Application. In: International Conference on Artificial Intelligence and Data Processing (IDAP), Sep. 2018, 1–6, doi: 10.1109/IDAP.2018.8620875.
- Pessoa, A., Uchoa, E., De Aragão, P. (2008) Robust Branch-Cut-Price Algorithms for VRP. The VRP: Latest advances and New Challenges.
- Toth, P., Vigo, D. (2014) Vehicle routing: Problems, Methods and Applications, second Edition. Philadelphia: SIAM.