Vehicle routing problem with delivery and pickup

• Autor(a) principal: Obafemi, Omoniyi Raymondjoy
• Data de Publicação: 2023
• Tipo de documento: Dissertação
• Idioma: eng
• Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
• Texto Completo: http://hdl.handle.net/10773/41058
• topic: Optimization; Routing; Logistics planning; Transportation optimization; Supply chain management; Delivery scheduling; Pickup scheduling; Mixed-integer programming (MIP)

This project, on Vehicle Routing Problem with Delivery and Pickup (VRPDP) aimed at determining the factors that contribute to the quality of a solution and checking the effect of varying the relative sizes of delivery demands to the size of pickup demands. This work was done with a dataset generated by a random uniform distribution of complete graphs with 15, 20, and 25 nodes, with varying relative sizes of the demands at each node to create four scenarios, Indifferent relative sizes of delivery to pickup, Large delivery demand relative to pickup demand, small delivery relative to pickup demand and delivery demand relatively equal to pick up demand at each customer. Three distinct problems were created using these scenarios. A model was created using flow formulation on the GurobiPy solver. The three problems were solved using the model and the result was tabulated. Observations on the table were thoroughly examined and relevant inferences were made on the factors that influence the quality of the VRPDP solution and the effect of varying the relative sizes of the demands.