scispace - formally typeset
Search or ask a question

A Study on the Solution Approach for Dynamic Vehicle Routing Problems under Real-time Information

TL;DR: In this article, a stochastic vehicle routing problem (SVRP) is considered and extended to incorporate real-time information for dynamic vehicle routing problems (DVRP), and the SVRP model is formulated by a chance-constrained model, and is solved by CPLEX with branch-and-bound techniques.
Abstract: Recent advances in Commercial Vehicle Operations (CVO), especially in communication and information technologies, allow the study of dynamic vehicle routing problems under new and updated information, such as traffic conditions and new customers. Two major operational benefits of CVO include: (1) dynamically assign vehicles to time-sensitive demands, and (2) efficiently reroute vehicle according to current traffic conditions. In this research, stochastic vehicle routing problems (SVRP) are considered and extended to incorporate real-time information for dynamic vehicle routing problems (DVRP). The SVRP model is formulated by a chance-constrained model, and is solved by CPLEX with branch-and-bound techniques. Numerical experiments are conducted in a Taichung City Network to investigate dynamic vehicle routing strategies under real-time information supply strategies, and to assess the effectiveness of such strategies in a dynamic perspective.
Citations
More filters
Journal ArticleDOI
TL;DR: In this paper, a two-stage framework for solving dynamic vehicle routing problem is proposed, in the first stage, the sweep method is adopted in vehicle assignment, and in the second stage, a tabu search algorithm is implemented to improve routes under real-time information.
Abstract: The dynamic vehicle routing problems (DVRP) is an extension of vehicle routing problems (VRP) in order to consider possible variations of travel times in the network. In this research, a two-stage framework for solving dynamic vehicle routing problem is proposed. In the first stage, the sweep method is adopted in vehicle assignment. In the second stage, a tabu search algorithm is implemented to improve routes under real-time information. The framework is implemented in an object-oriented approach and possible benefit from real-time information is illustrated through numerical simulation. The simulation-assignment model, DynaTAIWAN is applied in numerical simulation to evaluate real-time routing strategies in a traffic network. Numerical experiments are conducted in a 50 Nodes Network and a Taichung City. The results show that positive benefits could be achieved through utilization of real-time information with careful design.

42 citations

Journal ArticleDOI
TL;DR: The on-line vehicle routing problems (VRP) is an extension of VRP in order to consider real-time requests as well as possible variations travel times in the network in to consider assigning and routing strategies in a traffic network.
Abstract: The on-line vehicle routing problems (VRP) is an extension of VRP in order to consider real-time requests as well as possible variations travel times in the network. In this research, a solution algorithm for solving on-line VRP is proposed. The solution algorithm is divided into two phases, off-line route planning and on-line route updating. In the off-line phase, a time-dependent VRP formulation is constructed to assign initial routes. In the on-line routing phase, a hybrid heuristic approach with tabu search and genetic algorithm is proposed to handle real-time requests and to improve routes under real-time information. The simulation-assignment model, DynaTAIWAN is applied to evaluate assigning and routing strategies in a traffic network. Numerical experiments are conducted in a Kaohsiung city network.

4 citations


Cites background or methods from "A Study on the Solution Approach fo..."

  • ...…in communication and information technologies, allow the study of on-line vehicle routing problems (VRP) under new and updated information, such as real-time traffic conditions, vehicle status, and new coming demands (Psaraftis, 1995; Gendreau et al., 1999; Hu et al., 2003; Ghiani et al., 2003)....

    [...]

  • ...The technology applications in Commercial Vehicle Operations (CVO), especially in communication and information technologies, allow the study of on-line vehicle routing problems (VRP) under new and updated information, such as real-time traffic conditions, vehicle status, and new coming demands (Psaraftis, 1995; Gendreau et al., 1999; Hu et al., 2003; Ghiani et al., 2003)....

    [...]

  • ...Hu et al. (2003) applied a SVRP approach in a chance-constrained formulation (Laporte et al., 1992) and the SVRP solution formulation is solved through branch-and-bound technique by CPLEX....

    [...]

01 Jan 2006
TL;DR: A two-stage framework for solving dynamic vehicle routing problem is proposed and a well known approach, the sweep method, is conducted in vehicle assignment and a Tabu search algorithm is implemented to improve routes under real-time information.
Abstract: Logistics management has been one of the most important parts in the supply chain management. More and more distribution centers (DC) have been established to provide the flexibility of sales and supply. Major daily operation issues in distribution centers are routes and schedules of trucks. The dynamic vehicle routing problems (DVRP) is an extension of vehicle routing problems (VRP) in order to consider possible variations of travel times in the network. In this research, a two-stage framework for solving dynamic vehicle routing problem is proposed. In the first stage, a well known approach, the sweep method, is conducted in vehicle assignment. In the second stage, a Tabu search algorithm is implemented to improve routes under real-time information. The heuristic approach is then applied in an evaluation framework is which assigning and routing operations could be simulated in a realistic traffic environment. The simulation-assignment model, DynaTAIWAN is applied to evaluate assigning and routing strategies in a traffic network. Numerical experiments are conducted in Taichung City. For the covering abstract see ITRD E134653.

1 citations

Book ChapterDOI
18 Nov 2016
TL;DR: The smooth and continuous time dependent function is introduced and the two-stage model including the “initial optimization stage” and real-time optimization stage is established and a hybrid algorithm based on genetic-tabu algorithm and simulated annealing algorithm is designed to solve the model.
Abstract: This paper is aimed to solve this kind of problem and cope with the actual requirements containing time window and dynamic demands. Therefore the smooth and continuous time dependent function is introduced and the two-stage model including the “initial optimization stage” and “real-time optimization stage” is established. At the same time, a hybrid algorithm based on genetic-tabu algorithm and simulated annealing algorithm is designed to solve the model. In the end the effectiveness of the hybrid algorithm and the model is verified by comparing the results of simulation and other algorithms.
References
More filters
Book
01 Jan 1993
TL;DR: This article presents bootstrap methods for estimation, using simple arguments, with Minitab macros for implementing these methods, as well as some examples of how these methods could be used for estimation purposes.
Abstract: This article presents bootstrap methods for estimation, using simple arguments. Minitab macros for implementing these methods are given.

37,183 citations

Book
01 Jan 1993
TL;DR: In-depth, self-contained treatments of shortest path, maximum flow, and minimum cost flow problems, including descriptions of polynomial-time algorithms for these core models are presented.
Abstract: A comprehensive introduction to network flows that brings together the classic and the contemporary aspects of the field, and provides an integrative view of theory, algorithms, and applications. presents in-depth, self-contained treatments of shortest path, maximum flow, and minimum cost flow problems, including descriptions of polynomial-time algorithms for these core models. emphasizes powerful algorithmic strategies and analysis tools such as data scaling, geometric improvement arguments, and potential function arguments. provides an easy-to-understand descriptions of several important data structures, including d-heaps, Fibonacci heaps, and dynamic trees. devotes a special chapter to conducting empirical testing of algorithms. features over 150 applications of network flows to a variety of engineering, management, and scientific domains. contains extensive reference notes and illustrations.

8,496 citations

Journal ArticleDOI
TL;DR: The main problems of stochastic vehicle routing are described within a broad classification scheme and the most important contributions are summarized in table form.

652 citations


"A Study on the Solution Approach fo..." refers background in this paper

  • ...SVRPs are often regarded, as computationally intractable and good heuristics are hard to design and assess (3,4)....

    [...]

  • ...A limited literature has evolved around stochastic formulations for a stochastic version of the classical vehicle routing problem (3,4)....

    [...]

Journal ArticleDOI
TL;DR: The assessment of possible impact of new technologies and the distinction of dynamic problems vis-à-vis their static counterparts are given emphasis and the main issues in this rapidly growing area are examined.
Abstract: Although most real-world vehicle routing problems are dynamic, the traditional methodological arsenal for this class of problems has been based on adaptations of static algorithms. Still, some important new methodological approaches have recently emerged. In addition, computer-based technologies such as electronic data interchange (EDI), geographic information systems (GIS), global positioning systems (GPS), and intelligent vehicle-highway systems (IVHS) have significantly enhanced the possibilities for efficient dynamic routing and have opened interesting directions for new research. This paper examines the main issues in this rapidly growing area, and surveys recent results and other advances. The assessment of possible impact of new technologies and the distinction of dynamic problems vis-a-vis their static counterparts are given emphasis.

512 citations


"A Study on the Solution Approach fo..." refers background in this paper

  • ...Dynamic vehicle routing problems need to consider real-time information as well as demands, and thus information attributes are important to the DVRP(2)....

    [...]

  • ...With the advancement of communication and information technologies, real-time traffic conditions as well as dynamic demands are possible to obtain during the vehicle’s TRB 2003 Annual Meeting CD-ROM Paper revised from original submittal. journey, thus a realistic vehicle routing problem is defined as dynamic vehicle routing problems (DVRPS)....

    [...]

  • ...In this research, stochastic vehicle routing problems (SVRP) are considered and extended to incorporate real-time information for dynamic vehicle routing problems (DVRP)....

    [...]

  • ...Two major operational benefits of CVO include: (1) dynamically assign vehicles to time-sensitive demands, and (2) efficiently reroute vehicle according to current traffic conditions....

    [...]

  • ...(2) Real-time information for updating routes could provide positive benefits, only with careful route generation....

    [...]

Journal ArticleDOI
TL;DR: A tabu search heuristic, initially designed for the static version of the problem, has been adapted to the dynamic case and implemented on a parallel platform to increase the computational effort.
Abstract: An abundant literature about vehicle routing and scheduling problems is available in the scientific community. However, a large fraction of this work deals with static problems where all data are known before the routes are constructed. Recent technological advances now create environments where decisions are taken quickly, using new or updated information about the current routing situation. This paper describes such a dynamic problem, motivated from courier service applications, where customer requests with soft time windows must be dispatched in real time to a fleet of vehicles in movement. A tabu search heuristic, initially designed for the static version of the problem, has been adapted to the dynamic case and implemented on a parallel platform to increase the computational effort. Numerical results are reported using different request arrival rates, and comparisons are established with other heuristic methods.

457 citations


"A Study on the Solution Approach fo..." refers background in this paper

  • ...Two major operational benefits of CVO include: (1) dynamically assign vehicles to time-sensitive demands, and (2) efficiently reroute vehicle according to current traffic conditions....

    [...]

  • ...From all these experiments, several comparisons and conclusions are summarized as follows: (1) In this framework, demand node sequence is much more important than paths between each pair neighboring nodes....

    [...]

  • ...(1) propose a tabu search heuristic approach to the dynamic VRP and implemented on a parallel computer platform to increase the computational effort....

    [...]

  • ...simulation-assignment, real-time information INTRODUCTION Recent advances in Commercial Vehicle Operations (CVO), especially in communication and information technologies, allow the study of dynamic vehicle routing problems under new and updated information, such as real-time traffic conditions, vehicle status, and new coming demands(1)....

    [...]