Use of Simulation Systems for the Vehicle Routing Problem Analytical Essay by Nicky

Review of literature relating to simulation systems and vehicle routing systems.
# 150550 | 1,100 words | 6 sources | APA | 2012 | US
Published on Mar 05, 2012 in Engineering (Operations Research) , Engineering (Mechanical)

$19.95 Buy and instantly download this paper now


This paper reviews and analyzes various research papers about the use of simulation systems that attempt to resolve vehicle routing problems. First, the paper addresses Solomon's study which recommends the use of the insertion heuristic 11. Then, it considers an article about the development of a new optimization algorithm which uses a column generation approach for a set partitioning formulation for the VRPTW. Next, it explores additional research which proposes a two-stage hybrid algorithm for the VRP with the minimization of the vehicle number. Finally, the paper discusses a study which points out that simulations can be carried out according to two structural paradigms.

From the Paper:

"The algorithm was stated to have the capacity to problem-solve on a scale that was six times greater than any other reported algorithm. (Desrochers, Desrosiers, and Solomon, 1992) p.353 Stated as a key element of distributions systems is the "routing and scheduling of vehicles through a set of customers requiring service." (Solomon, 1992) p.254 Solomon goes on to relate that the vehicle routing problem (VRP) involves "the design of a set of minimum-cost vehicle routes, originating and terminating at a central depot, for a fleet of vehicles that services a set of customers with known demands. Each customer is serviced exactly once and, furthermore, all the customers must be assigned to vehicles without exceeding vehicle capacities." (Solomon, 1992) p.256
"It is necessary to address these issues along with the additional complexity of "...allowable delivery times, or time windows, stemming from the fact that some customers impose delivery deadlines and earliest-delivery-time constraints. In the presence of time windows, the total routing and scheduling costs include not only the total travel distance and time costs considered for routing problems, but also the cost of waiting time incurred when a vehicle arrives too early at a customer location..."

Sample of Sources Used:

  • Desrichers, Martin, Desrosiers, Jacques, and Solomon, Marius (1992) A New Optimization Algorithm for ht Vehicle Routing Problem with Time Windows. Operations Research. Vol. 40. No.2 March-April 1992.
  • Solomon, Marius M. (1985) Algorithms for The Vehicle Routing and Scheduling Problems with Time Window Constraints. Operations Research Vol. 35 No. 2 1987 Mar-Apr.
  • Bent, Russell and Hentenryck (2004) A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows. Transportation Science. Vol. 38 No. 4 Nov 2004.
  • Bramel, Julien and Simchi-Levi, David (1993) Probabilistic Analyses and Practical Algorithms for the Vehicle Routing Problem with Time Windows. Operations Research Vol. 44, No. 3 May-June 1996.
  • Wolsey, Laurence A. (2006) Lot-Sizing with Production and Delivery Time Windows. Math Program Ser A 107 2006.

Cite this Analytical Essay:

APA Format

Use of Simulation Systems for the Vehicle Routing Problem (2012, March 05) Retrieved March 02, 2021, from

MLA Format

"Use of Simulation Systems for the Vehicle Routing Problem" 05 March 2012. Web. 02 March. 2021. <>