Marques, A; Soares, R; Santos, MJ; Amorim, P;
Santos, MJ; Curcio, E; Mulati, MH; Amorim, P; Miyazawa, FK;
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW
The Vehicle Routing Problem with Selective Backhauls (VRPSB) aims to minimize the total routing costs minus the total revenue collected at backhaul customers. We explore a VRPSB under uncertain revenues. A deterministic VRPSB is formulated as a mixed-integer programming problem and two robust counterparts are derived. A novel method to estimate the probabilistic bounds of constraint violation is designed. A robust metaheuristic is developed, requiring little time to obtain feasible solutions with average gap of 1.40%. The robust approach studied demonstrates high potential to tackle the problem, requiring similar computing effort and maintaining the same tractability as the deterministic modeling.
The access to the final selection minute is only available to applicants.
Please check the confirmation e-mail of your application to obtain the access code.