Algorithms for vehicle routing problems with time window constraints
✍️ How to write this paper — writing tools ▾
¶ … Simulation Systems for the Vehicle Routing Problem
The work of Solomon (1987) entitled: "Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints" reports the consideration of the design and analysis of algorithms for vehicle routing and scheduling problems with time windows constraints. Solomon (1987) reports having presented the development of heuristics and test problem sets and computational experiments with results indicating that the "insertion heuristic I1 can be explained with the realization that "while routing problems seems to be driven by the assignment-of-customers-to-vehicles component -- as indicated by the success of the Fisher and Jaikumar generalized assignment heuristic -- the sequencing aspect of the problem seems to drive routing problems dominated by time windows. It is this aspect of the problem that the insertion heuristic II captures so well." (Solomon, 1987)
It is stated that based upon Solomon's study that the use of the insertion heuristic 11 is recommended "to obtain excellent initial VRSPTW solutions in a reasonable amount of computing time." (1985) p.264 Because of the stable behavior of this heuristic it is held by Solomon that it will "perform well on practical problems." (1987) p.264
The work of Desrochers, Desrosiers, and Solomon (1992) entitled: "A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows" presents the development of a new optimization algorithm which uses a column generation approach for a set partitioning formulation for the VRPTW." p.353 Results are stated to indicate that this algorithm was successful and "on a variety of practical sized benchmark VRPTW test problems." (Desrochers, Desrosiers, and Solomon, 1992) p.353
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."
Create your account
Always verify citation format against your institution’s current style guide requirements.