https://www.cirrelt.ca/DocumentsTravail/CIRRELT-2011-62.pdf

A review of dynamic vehicle routing problems

Dynamic Traffic Assignment (DTA) has evolved substantially since the pioneering work of Merchant and Nemhauser. Numerous formulations and solutions approaches have been introduced ranging from mathematical programming, to variational inequality, optimal control, and simulation-based. The aim of this special issue is to document the main existing DTA approaches for future reference. This opening paper will summarize the current understanding of DTA, review the existing literature, make the connection to the approaches presented in this special issue, and attempt to hypothesize about the future.

Foundations of dynamic traffic assignment : the past, the present and the future

The vehicle routing problem

Green Logistics has emerged as the new agenda item in supply chain management. The traditional objective of distribution management has been upgraded to minimizing system-wide costs related to economic and environmental issues. Reflecting the environmental sensitivity of vehicle routing problems (VRP), an extensive literature review of Green Vehicle Routing Problems (GVRP) is presented. We provide a classification of GVRP that categorizes GVRP into Green-VRP, Pollution Routing Problem, VRP in Reverse Logistics, and suggest research gaps between its state and richer models describing the complexity in real-world cases. The purpose is to review the most up-to-date state-of-the-art of GVRP, discuss how the traditional VRP variants can interact with GVRP and offer an insight into the next wave of research into GVRP. It is hoped that OR/MS researchers together with logistics practitioners can be inspired and cooperate to contribute to a sustainable industry.

Survey of Green Vehicle Routing Problem: Past and future trends

Since the late 70s, much research activity has taken place on the class of dynamic vehicle routing problems DVRP, with the time period after year 2000 witnessing a real explosion in related papers. Our paper sheds more light into work in this area over more than 3 decades by developing a taxonomy of DVRP papers according to 11 criteria. These are 1 type of problem, 2 logistical context, 3 transportation mode, 4 objective function, 5 fleet size, 6 time constraints, 7 vehicle capacity constraints, 8 the ability to reject customers, 9 the nature of the dynamic element, 10 the nature of the stochasticity if any, and 11 the solution method. We comment on technological vis-i-vis methodological advances for this class of problems and suggest directions for further research. The latter include alternative objective functions, vehicle speed as decision variable, more explicit linkages of methodology to technological advances and analysis of worst case or average case performance of heuristics. © 2015 Wiley Periodicals, Inc. NETWORKS, Vol. 671, 3-31 2016

/pdf/dynamic-vehicle-routing-problems-three-decades-and-counting-3phqfejokj.pdf

Dynamic vehicle routing problems: Three decades and counting

Production scheduling and vehicle routing with time windows for perishable food products

In this article, the real-time time-dependent vehicle routing problem with time windows is formulated as a series of mixed integer programming models that account for real-time and time-dependent travel times, as well as for real-time demands in a unified framework. In addition to vehicles routes, departure times are treated as decision variables, with delayed departure permitted at each node serviced. A heuristic comprising route construction and route improvement is proposed within which critical nodes are defined to delineate the scope of the remaining problem along the time rolling horizon and an efficient technique for choosing optimal departure times is developed. Fifty-six numerical problems and a real application are provided for demonstration.

The real-time time-dependent vehicle routing problem

This paper formulates a discrete-time, link-based dynamic user-optimal route choice problem using the variational inequality approach. The proposed model complies with the dynamic user-optimal equilibrium condition in which for each origin-destination pair, the actual travel time experienced by travelers departing during the same interval is equal and minimal. A nested diagonalization procedure is then proposed and demonstrated with a numerical example.

A model and an algorithm for the dynamic user-optimal route choice problem

From the contents: Analysis of Dynamic Transportation Systems Mathematical Background Network Flow Constraints and Link Travel Time Function Analysis Dynamic User-Optimal Route Choice Model Algorithms for the Dynamic Route Choice Model Dynamic User-Optimal Departure Time/Route Choice Model Dynamic User-Optimal Models with Variable Demand Dynamic User-Optimal Mode Choice Models Dynamic User-Optimal Singly Constrained O-D Choice Models Dynamic System-Optimal Route Choice Model Dynamic Signal Control Systems Stochastic/Dynamic User-Optimal Route Choice Model etc.

Huey-Kuo Chen

Papers

Production scheduling and vehicle routing with time windows for perishable food products

The real-time time-dependent vehicle routing problem

A model and an algorithm for the dynamic user-optimal route choice problem

Dynamic Travel Choice Models: A Variational Inequality Approach

Solving multiobjective linear programming problems—a generic approach