Skip to main content
Article thumbnail
Location of Repository

The effect of time-window constraints and fleet size on the cost of a distribution operation

By P. A. J. Barham


Adopting a Continuous Space Modelling-type scenario of no detailed data being available at a customer-specific level, and on the basis, therefore, of basic information on delivery-area size, total number of locations to be visited and average road-speeds etc., quantitative expressions are derived for, the relationship between the number of vehicles operating from a central depot and the total fleet mileage that is required to visit a set of locations, and, 2. the effect of time-window constraints on the total cost of a similar operation. These expressions are derived using a simulation-based methodology, involving the setting-up of a computer program which both generates Travelling-Salesman tours and provides information on these tours at a detailed, disaggregated level. In the time-constrained context, it was necessary to develop a heuristic route-building procedure for solving Travelling-Salesman Problems due to the algorithmi

Publisher: Cranfield University
Year: 1991
OAI identifier:
Provided by: Cranfield CERES

Suggested articles


  1. (1982). A dual heuristic for vehicle scheduling. " doi
  2. (1982). A heuristic algorithm for routing and scheduling dial-a-ride vehicles.
  3. (1974). An analytic model of Manv-to-Many Dial-a-Ride transportation systems.
  4. (1977). An approximate analytic model of many-to-one demand responsive tranportation systems. "
  5. (1980). An easy lower bound on the number of trucks needed to service a set of destinations. " doi
  6. (1981). Classification in vehicle Routing and Scheduling. " Networks, doi
  7. (1971). Combinatorial programming. svatial analysis and planning.
  8. (1971). Distribution Manap, ement: Mathematical Modelling and Practical Analysis. doi
  9. (1962). Graphic Programming using odd or even points. "
  10. (1981). Heuristic Vehicle Scheduling. " OMEGA, doi
  11. (1977). Implementing vehicle routing algorithms. " Networks, doi
  12. (1984). Introducton to and recent advances in vehicle routing methods. "
  13. (1959). Is your fleet the right size? " doi
  14. (1984). Local search in-routinR problems with Time-Windows.,
  15. (1974). Methodological choices in Depot Location studies. " doi
  16. (1942). On the translocation of masses. " Comt)tes Rendus (Dokladv) de I'
  17. (1961). Optimal fleet size. " doi
  18. (1985). Optimising Single Vehicle Many-to-Many Operations with Desired Delivery times: 1. Scheduling. " Transvortation Science, doi
  19. (1985). Physical distribution from a warehouse: vehicle coverage and inventory levels. " in Transportation Research. Special Issue: Transportation Systems and Lopistics, doi
  20. (1983). Planning for truck fleet-size in the presence of a common-carrier option. " Decision Sciences., doi
  21. (1979). Routing and scheduling of school buses by computer. " doi
  22. (1978). Scheduling Dial-a-Ride Transportation Systems. " Transportation Science, doi
  23. (1963). Scheduling of vehicles from a central depot to a number of delivery points. doi
  24. (1982). Scheduling School Buses, (Yale School of Organisation and doi
  25. (1972). School bus routing by computer. " doi
  26. (1983). Special issue - Routing & Scheduling of vehicles and crews -
  27. (1979). The Chinese Postman Problem for mixed networks. " Mannement Science, doi
  28. (1982). The distance travelled to visit N points with a maximum of C stops per vehicle: A manual tour-building strategy and Case Study. " Research Report Institute of Transr)ortation Studies.
  29. (1986). The effect of changes in driving hours legislation upon road haulage economics.
  30. (1982). The length of tours in zones of different shaves. (Institute of Transportation Studies, doi
  31. (1969). The size and composition of a road transport fleet. " doi
  32. (1971). The Travelling-Salesman Problem and Minimum Spanning Trees, Part H. " Mathematical Programming, doi
  33. (1985). Use of Continuous Space Modelling to estimate freight distribution costs. " doi
  34. (1986). Vehicle Routing and Scheduling - problems with time-window constraints: efficient imnlementations of solution imt)rovement procedures. (Unpublished paper,
  35. (1982). Vehicle routing with time-window constraints. " The Logistics and Transt)ortation Review.

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.