Advanced search
Start date
Betweenand

Stochastic Programming and Robust Optimization to Variants of Vehicle Routing Problem: Formulations and Exact Methods

Grant number: 15/14582-7
Support type:Scholarships in Brazil - Doctorate
Effective date (Start): November 01, 2015
Effective date (End): March 31, 2019
Field of knowledge:Engineering - Production Engineering - Operational Research
Principal Investigator:Reinaldo Morabito Neto
Grantee:Jonathan Justen de La Vega Martínez
Home Institution: Centro de Ciências Exatas e de Tecnologia (CCET). Universidade Federal de São Carlos (UFSCAR). São Carlos , SP, Brazil
Associated scholarship(s):18/01523-0 - Benders-branch-and-cut for the vehicle routing problem with multiple deliverymen and stochastic demand, BE.EP.DR   17/06434-3 - Two-stage robust optimization with recourse for the vehicle routing problem with time windows and multiple deliverymen, BE.EP.DR

Abstract

In this doctoral research, we intend to approach two variants of vehicle routing problem with time windows. In the first of them, the customers can request the pickup and delivery of goods simultaneously and, thus, they model relevant urban situations such as beverage distribution, public transport system, reverse logistic, among others. The second variant considers the use of multiple deliverymen in each route and, therefore, besides involving the classical routingdecisions, the crew size in each vehicle must also be decided. In practical environments, a very important aspect to consider is the uncertainty. Neglecting uncertainty may lead to solutions that are not implementable in practice or are inefficient. For example, if at some point, a significant difference is found between the estimated demands and that which actually happened, or traveling and service time is found to be different from that determined, an additional visit to the customer may be required or visits to other subsequent customers on the route may not be possible, incurring additional costs that may considerably increase the total operating cost. For this reason, approaches to deal with the inherent uncertainty of the problem must be addressed and the stochastic programming with resources and robust optimization are the most currently used in mathematical programming. Hence, these approaches will be used to formulate more realistically the problems to be addressed in this doctoral research. Using these approaches may significantly increase the number of decision variables and constraints, which may indicate that a greater computational effort to solve problem is required. However, these resulting formulations present particular structures that can be used by the methods of decomposition and cutting planes. Therefore, this research also aims to use these methods to solve the two variants of the problem. Some studies have used these methods recently to solve the variants of stochastic vehicle routing problem, obtaining promising results. For this reason, we believe that these methods have potential to provide good results here. The proposed methods will be implemented and evaluated using instances of literature test as well as it is intended to use real data collected from companies.

Scientific publications
(References retrieved automatically from Web of Science and SciELO through information on FAPESP grants and their corresponding numbers as mentioned in the publications by the authors)
DE LA VEGA, JONATHAN; MUNARI, PEDRO; MORABITO, REINALDO. Robust optimization for the vehicle routing problem with multiple deliverymen. CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH, v. 27, n. 4, p. 905-936, DEC 2019. Web of Science Citations: 2.
MUNARI, PEDRO; MORENO, ALFREDO; DE LA VEGA, JONATHAN; ALEM, DOUGLAS; GONDZIO, JACEK; MORABITO, REINALDO. The Robust Vehicle Routing Problem with Time Windows: Compact Formulation and Branch-Price-and-Cut Method. TRANSPORTATION SCIENCE, v. 53, n. 4, p. 1043-1066, JUL-AUG 2019. Web of Science Citations: 0.

Please report errors in scientific publications list by writing to: cdi@fapesp.br.