Multi-capacity, Multi-depot, Multi-product VRP with Heterogeneous Fleets and Demand Exceeding Depot Capacity
This paper presents a four-step metaheuristic for addressing a rich and real-life vehicle routing problem. A set of customers request several products that must be delivered using a heterogeneous fleet of trucks with different compartments (one per product). These vehicles depart from a set of depots, which do not have enough capacity for meeting the aggregated customers’ demand of products. Therefore, some vehicles must visit an external facility at the beginning of their routes in order to obtain the necessary products to deliver. A real-world case has been solved, providing savings in reduced computing times.
KeywordsLogistics and transportation Combinatorial optimization Randomized algorithms Metaheuristics
This work has been partially supported by the Spanish Ministry of Economy and Competitiveness (TRA2013-48180-C3-P, TRA2015-71883-REDT), FEDER, and the Erasmus+ Program (2016-1-ES01-KA108-023465).
- 1.Caceres-Cruz, J., Arias, P., Guimarans, D., Riera, D., Juan, A.A.: Rich vehicle routing problem: survey. ACM Comput. Surv. (CSUR) 47(2), 32 (2015)Google Scholar
- 8.Juan, A.A., Faulin, J., Ruiz, R., Barrios, B., Gilibert, M., Vilajosana, X.: Using oriented random search to provide a set of alternative solutions to the capacitated vehicle routing problem. In: Operations Research and Cyber-Infrastructure, pp. 331–345. Springer, Boston (2009)Google Scholar
- 16.Wang, Q., Ji, Q., Chiu, C.H.: Optimal routing for heterogeneous fixed fleets of multicompartment vehicles. Math. Prob. Eng. 2013, 13 (2014)Google Scholar