Planning approximations to the average length of vehicle routing problems with time window constraints

Transportation Research Part B: Methodological

Volumn 43, Issue 4, 2009, Pages 438-447

  Figliozzi, Miguel Andres ^a  

^a Portland State University   (United States)

Author keywords

Distance estimation; Time window constraints; Vehicle routing problem

Indexed keywords

PROBABILITY; SALES; VEHICLES;

ASYMPTOTIC PROPERTIES; CAPACITY CONSTRAINTS; DISTANCE ESTIMATION; LOGISTICS PROBLEMS; TIME WINDOW CONSTRAINT; VEHICLE ROUTING PROBLEM; VEHICLE ROUTING PROBLEMS; VEHICLE ROUTING PROBLEMS WITH TIME WINDOW CONSTRAINTS;

VEHICLE ROUTING;

ESTIMATION METHOD; LOGISTICS; PROBABILITY; REGRESSION ANALYSIS; SPATIAL DISTRIBUTION; TRANSPORTATION PLANNING;

EID: 63649154387     PISSN: 01912615     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trb.2008.08.004     Document Type: Article

References (26)

1. Bearwood J., Halton H., and Hammersley J. The shortest path through many points. Proceedings of the Cambridge Philosophical Society 55 (1959) 299-327
2. Bramel J., Coffman E.G., Shor P.W., and Simchi-levi D. Probabilistic analysis of the capacitated vehicle routing problem with unsplit demands. Operations Research 40 6 (1992) 1095-1106
3. Bramel J., and Simchi-levi D. Probabilistic analyses and practical algorithms for the vehicle routing problem with time windows. Operations Research 44 3 (1996) 501-509
4. Chien T.W. Operational estimators for the length of a traveling salesman tour. Computers and Operations Research 19 6 (1992) 469-478
5. Christofides N., and Eilon S. Expected distances in distribution problems. Operational Research Quarterly 20 4 (1969) 437-443
6. Daganzo C.F. The distance traveled to visit N-points with a maximum of C-stops per vehicle - an analytic model and an application. Transportation Science 18 4 (1984) 331-350
7. Daganzo C.F. Modeling distribution problems with time windows 1. Transportation Science 21 3 (1987) 171-179
8. Daganzo C.F. Modeling distribution problems with time windows 2. - 2 Customer types. Transportation Science 21 3 (1987) 180-187
9. Diana M., Dessouky M.M., and Xia N. A model for the fleet sizing of demand responsive transportation services with time windows. Transportation Research Part B 40 8 (2006) 651-666
10. Eilon S., Watson-gandy D., and Christofides N. Distribution Management: Mathematical Modelling and Practical Analysis (1971), Hafner, New York
11. Erera, A., 2000. Design of large-scale logistics systems for uncertain environments. Ph.D. Dissertation, University of California, Berkeley.
12. Federgruen A., and Vanryzin G. Probabilistic analysis of a generalized bin packing problem and applications. Operations Research 45 4 (1997) 596-609
13. Figliozzi M.A. Modeling the impact of technological changes on urban commercial trips by commercial activity routing type. Transportation Research Record 1964 (2006) 118-126
14. Figliozzi M.A. Analysis of the efficiency of urban commercial vehicle tours: Data collection, methodology, and policy implications. Transportation Research Part B 41 9 (2007) 1014-1032
15. Figliozzi, M., 2008a. An iterative route construction and improvement algorithm for the vehicle routing problem with soft and hard time windows. In: Applications of Advanced Technologies in Transportation (AATT) 2008 Conference Proceedings, Athens, Greece, May 2008.
16. Figliozzi, M.A., 2008b. Planning approximations to the average length of vehicle routing problems with varying customer demands and routing constraints. Transportation Research Record 2089, 1-8.
17. Figliozzi M.A., Kingdon L., and Wilkitzki A. Analysis of freight tours in a congested urban area using disaggregated data: characteristics and data collection challenges. Proceedings second Annual National Urban Freight Conference (2007), Long Beach, CA December
18. Holguin-veras J., and Patil G. Observed trip chain behavior of commercial vehicles. Transportation Research Record 1906 (2005) 74-80
19. Jaillet P. A priori solution of a traveling salesman problem in which a random subset of the customers are visited. Operations Research 36 6 (1988) 929-936
20. Kwon O., Golden B., and Wasil E. Estimating the length of the optimal tsp tour - an empirical-study using regression and neural networks. Computers and Operations Research 22 10 (1995) 1039-1046
21. Larson R.C., and Odoni A.R. Urban Operations Research (1981), Prentice-Hall, Inc
22. Ong H.L., and Huang H.C. Asymptotic expected performance of some tsp heuristics - an empirical-evaluation. European Journal of Operational Research 43 2 (1989) 231-238
23. Robuste F., Estrada M., and Lopez-pita A. Formulas for estimating average distance traveled in vehicle routing problems in elliptic zones. Transportation Research Record 1873 (2004) 64-69
24. Solomon M.M. Algorithms for the vehicle-routing and scheduling problems with time window constraints. Operations Research 35 2 (1987) 254-265
25. Stein D. An asymptotic probabilistic analysis of a routing problem. Mathematics of Operations Research 3 2 (1978) 89-101
26. Webb M. Cost functions in the location of depots for multiple-delivery journeys. Operational Research Quarterly 19 3 (1968) 311-320