Skip to main content
Research Proposal 1,304 words

Time windows in vehicle routing and lot-sizing problems

~7 min read
✍️ How to write this paper — writing tools ▾
Essay 1,304 words

Classification of Time Windows in the Vehicle Routing Problem

The work of Bramel and Simchi-Levi (1992) entitled: "Probabilistic Analyses and Practical Algorithms for the Vehicle Routing Problem with Time Windows" reports that the Vehicle Routing Problem with Time Windows (VRPTW) can be stated as follows: "... A set of customers dispersed in a geographical regions has to be served by a fleet of vehicles initially located at a given depot. Each customer has a load that must be picked up, and the customer specifies a period of time, called a time window, in which this pick up must occur. The customers are served by vehicles of limited capacity, that is, total load carried by each vehicle can be no more than the vehicle capacity. The objective of to find a set of routes for the vehicles, where each route begins and ends at the depot, serves a subset of the customers without violating the capacity and time window constraints, while minimizing the total length of the routes." (Bramel and Simchi-Levi, 1992)

The work of Wolsey (2006) entitled: "Lot-Sizing with Production and Delivery Time Windows" reports a study of two lot-sizing problems with time windows." p.471 in each of these cases it is stated by Wolsey (2006) that the demand data "...consists of a set of orders" and those are stated as follows: "...k = 1, . . ., K consisting of a quantity Dk and a time interval [bk, ek] lying within the time horizon [1, n]." (p.471) Wolsey reports that the production time window "is the interval during which the order must be produced, while delivery of the order takes place in a period 'ek'. P.471 Wolsey goes on to state that this problem involves consideration of two variant: (1) in the first each order is distinct (client-specific) whereas in the second; (2) orders are indistinguishable (non-specific). " (Brahimi, Dauzere-Peres, et al. in: Wolsey, 2006) p.471

It is however held by Lee et al. that the deliver time window for an order "is the time interval in which the order must be delivered to the client." (in Wolsey, 2006) p.471 Wolsey states for the problem that is client-specific with production time windows that the approach taken is one in which polynomial time optimization algorithms and also tight mixed integer programming formulations possibly with additional variables are sought and in some cases "this means that we have a description of the convex hull of feasible solutions." (2006) p.472

759 Words Hidden
Multi-item problems are stated to require the use of: (1) column generation; or (2) Lagrangian relaxation approaches in which one requires the optimization algorithms to…
Key Concepts in This Paper
Vehicle Routing Problem with Time Windows lot-sizing problems mixed integer programming edge-exchange improvement methods production and delivery time windows optimization algorithms distribution management
Cite This Paper
PaperDue. (2009). Time windows in vehicle routing and lot-sizing problems. PaperDue. https://www.paperdue.com/essay/classification-of-time-windows-in-19048

Always verify citation format against your institution’s current style guide requirements.