Design of multiple-vehicle delivery tours satisfying time constraints

We studied the following organization for the letter and parcel pick-up and delivery problem in an urban environment: the working day is divided in time periods during which each vehicle starts from a sorting center, travels to a precise area of the region, picks up and delivers letters and parcels, and then returns to the depot to have the collected material sorted out for delivery during the following period. The intent of this approach is to have each zone serviced by one vehicle only to facilitate the work of the dispatcher and the routing of each vehicle. We have developed a method of partitioning an urban region into zones so as to minimize the total number of vehicles used or the total distance traveled by all the vehicles. The first part of the method determines the zones and the average number of points to visit. Then, a first refinement of the method takes into account the daily variability of the demand in each zone, and a second refinement examines the advantage of allowing some overlapping of zones for the purpose of having an overloaded vehicle relieved by one from an adjacent zone.

[1]  David M. Stein,et al.  Scheduling Dial-a-Ride Transportation Systems , 1978 .

[2]  G. F. Newell,et al.  Configuration of physical distribution networks , 1986, Networks.

[3]  Richard C. Larson,et al.  Urban Operations Research , 1981 .

[4]  C. Daganzo.  Checkpoint dial-a-ride systems , 1984 .

[5]  Carlos F. Daganzo,et al.  The length of tours in zones of different shapes , 1984 .

[6]  Carlos F. Daganzo,et al.  The Distance Traveled to Visit N Points with a Maximum of C Stops per Vehicle: An Analytic Model and an Application , 1984, Transp. Sci..

[7]  Carlos F. Daganzo,et al.  An approximate analytic model of many-to-many demand responsive transportation systems , 1978 .

[8]  Randolph W. Hall,et al.  Distribution Strategies that Minimize Transportation and Inventory Costs , 1985, Oper. Res..

[9]  Gordon F. Newell.  Design of multiple-vehicle delivery tours—III valuable goods , 1986 .

[10]  Carlos F. Daganzo.  Modeling Distribution Problems with Time Windows. Part II: Two Customer Types , 1987, Transp. Sci..

[11]  Carlos F. Daganzo,et al.  Design of multiple-vehicle delivery tours--I a ring-radial network , 1986 .

[12]  Carlos F. Daganzo.  MODELING DISTRIBUTION PROBLEMS WITH TIME WINDOWS , 1985 .

[13]  Carlos F. Daganzo,et al.  DESIGN OF MULTIPLE-VEHICLE DELIVERY TOURS II. OTHER METRICS , 1986 .

[14]  G. Laporte,et al.  Exact Algorithms for the Vehicle Routing Problem , 1987 .

[15]  L. Bodin.  ROUTING AND SCHEDULING OF VEHICLES AND CREWS–THE STATE OF THE ART , 1983 .

[16]  C. Daganzo.  Supplying a single location from heterogeneous sources , 1985 .