Revisión del estado del arte del problema de ruteo de vehículos con recogida y entrega (VRPPD)

This paper presents a literature review of the state of the art vehicle routing problem with deliveries and collections (VRPPD: Vehicle Routing Problem with pickups and deliveries). Is performed a classification of the different variants of the problem, and the work and conducted research on the subject according to its authors, according to the models and the solution methods used. Also are analyzed future trends in modeling and solution techniques. The VRPPD is a problem of type MILP (Mixed Integer Linear Programming) involving whole and continuous quantities, and that turns out to be NP-Hard problems with a medium or large number of customers. The research does emphasis on variants of the problem involving variables associated with the environment, and in particular reducing the impact of greenhouse gases. The review notes that published until 2016.En este trabajo se realiza una revisión bibliográfica del estado del arte del problema de ruteo de vehículos con entregas y recogidas (VRPPD: Vehicle routing problem with pickups and deliveries). Se presenta una clasificación de las diferentes variantes del problema, y de los trabajos e investigaciones realizados sobre el tema según sus autores, los modelos utilizados y los métodos de solución usados. También se analizan las tendencias futuras en modelamiento y técnicas de solución. El VRPPD es un problema del tipo MILP (programación lineal entera mixta) que involucra cantidades enteras y continuas, y que resulta ser NP-Hard en problemas con un número mediano o grande de clientes. En la búsqueda se hace énfasis en las variantes del problema que involucran variables asociadas al medio ambiente, y en particular con la reducción del impacto de gases de efecto invernadero. La revisión observa lo publicado hasta el año 2016

Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care

International audienceThis paper addresses a vehicle scheduling problem encountered in home health care logistics. It concerns the delivery of drugs and medical devices from the home care company's pharmacy to patients' homes, delivery of special drugs from a hospital to patients, pickup of bio samples and unused drugs and medical devices from patients. The problem can be considered as a special vehicle routing problem with simultaneous delivery and pickup and time windows, with four types of demands: delivery from depot to patient, delivery from a hospital to patient, pickup from a patient to depot and pickup from a patient to a medical lab. Each patient is visited by one vehicle and each vehicle visits each node at most once. Patients are associated with time windows and vehicles with capacity. Two mixed-integer programming models are proposed. We then propose a Genetic Algorithm (GA) and a Tabu Search (TS) method. The GA is based on a permutation chromosome, a split procedure and local search. The TS is based on route assignment attributes of patients, an augmented cost function, route re-optimization, and attribute-based aspiration levels. These approaches are tested on test instances derived from existing VRPTW benchmarks

Shared Mobility Optimization in Large Scale Transportation Networks: Methodology and Applications

abstract: Optimization of on-demand transportation systems and ride-sharing services involves solving a class of complex vehicle routing problems with pickup and delivery with time windows (VRPPDTW). Previous research has made a number of important contributions to the challenging pickup and delivery problem along different formulation or solution approaches. However, there are a number of modeling and algorithmic challenges for a large-scale deployment of a vehicle routing and scheduling algorithm, especially for regional networks with various road capacity and traffic delay constraints on freeway bottlenecks and signal timing on urban streets. The main thrust of this research is constructing hyper-networks to implicitly impose complicated constraints of a vehicle routing problem (VRP) into the model within the network construction. This research introduces a new methodology based on hyper-networks to solve the very important vehicle routing problem for the case of generic ride-sharing problem. Then, the idea of hyper-networks is applied for (1) solving the pickup and delivery problem with synchronized transfers, (2) computing resource hyper-prisms for sustainable transportation planning in the field of time-geography, and (3) providing an integrated framework that fully captures the interactions between supply and demand dimensions of travel to model the implications of advanced technologies and mobility services on traveler behavior.Dissertation/ThesisDoctoral Dissertation Civil, Environmental and Sustainable Engineering 201