Using the Callback to eliminate sub-routing in a vehicle routing problem with simultaneous pick-up and delivery of multiple products

• Autor(a) principal: Lopes, Roza Maria Zoellner
• Data de Publicação: 2020
• Outros Autores: Doehnert, Ruany Batista Leite, Loch, Gustavo Valentim, Pécora Junior, José Eduardo, Scarpin, Cassius Tadeu
• Tipo de documento: Artigo
• Idioma: eng
• Título da fonte: GEPROS. Gestão da Produção. Operações e Sistemas
• Texto Completo: https://revista.feb.unesp.br/gepros/article/view/2726
• topic: Vehicle Routing Problem; Simultaneous Delivery and Pick-Up; Multiple products; Callback; Lazy Constraints

The Vehicle Routing Problem with simultaneous pick-up and delivery of multiple products (VRPSPD) is addressed in practice when just collecting the product is not sufficient to meet the client’s requirements. This article aims to apply Callback available in Gurobi software to the elimination of sub-routes in a VRPSPD using lazy constraints. In order to test the efficiency of the proposed method, we first solved the relaxed problem of Mixed Integer Programming (MIP), and then the same problem was solved using the Callback. The performed tests show that the use of Callback is efficient leading to time reductions in runtime to prove the optimality.