Vehicle routing in urban areas: an optimal approach with cost function calibration

References

• Alvarenga, G. B., G. R. Mateus, and G. de Tomi. 2007. “A Genetic and Set Partitioning Two-Phase Approach for the Vehicle Routing Problem with Time Windows.” Computers & Operations Research 34 (6): 1561–1584. doi: 10.1016/j.cor.2005.07.025
   Google Scholar
• Ando, N., and E. Taniguchi. 2006. “Travel Time Reliability in Vehicle Routing and Scheduling with Time Windows.” Networks and Spatial Economics 6 (3): 293–311. doi: 10.1007/s11067-006-9285-8
   Google Scholar
• Baker, B. M., and M. A. Ayechew. 2003. “A Genetic Algorithm for the Vehicle Routing Problem.” Computers & Operations Research 30 (5): 787–800. doi: 10.1016/S0305-0548(02)00051-5
   Google Scholar
• Beckman, M., C. B. McGuire, and C. B. Winsten. 1956. Studies in the Economics of Transportation. New Haven: Yale University Press.
   Google Scholar
• Bekhor, S., T. Toledo, and J. N. Prashker. 2008. “Effects of Choice Set Size and Route Choice Models on Path-Based Traffic Assignment.” Transportmetrica 4 (2): 117–133. doi: 10.1080/18128600808685682
   Google Scholar
• Ben-Akiva, M., M. Bierlaire, H. Koutsopoulos, and R. Mishalani. 1998. “DynaMIT: A Simulation-Based System for Traffic Prediction and Guidance Generation.” TRISTAN III, San Juan.
   Google Scholar
• Berger, J., and M. Barkaoui. 2004. “A Parallel Hybrid Genetic Algorithm for the Vehicle Routing Problem with Time Windows.” Computer & Operations Research 31 (12): 2037–2053. doi: 10.1016/S0305-0548(03)00163-1
   Google Scholar
• Bin, Y., Y. Zhong-Zhen, and Y. Baozhen. 2009. “An Improved Ant Colony Optimization for Vehicle Routing Problem.” European Journal of Operational Research 196 (1): 171–176. doi: 10.1016/j.ejor.2008.02.028
   Google Scholar
• Bovy, P. H. L., and S. Fiorenzo-Catalano. 2007. “Stochastic Route Choice Set Generation: Behavioral and Probabilistic Foundations.” Transportmetrica 3 (3): 173–189. doi: 10.1080/18128600708685672
   Google Scholar
• Bowyer, D., R. G. Thompson, and F. Spiridonos. 2008. “Melbourne Freight Movement Model.” In Innovation in City Logistics, edited by Taniguchi, E., R. G. Thompson, 115–138. New York: Nova Science.
   Google Scholar
• Cantarella, G. E., G. Pavone, and A. Vitetta. 2006. “Heuristics for Urban Road Network Design: Lane Layout and Signal Settings.” European Journal of Operational Research 175 (3): 1682–1695. doi: 10.1016/j.ejor.2005.02.034
   Google Scholar
• Cascetta, E. 2001, Transportation System Engineering: Theory and Methods. The Netherlands: Kluwer Academic.
   Google Scholar
• Chen, A., S. Pravinvongvuth, and P. Chootinan. 2010. “Scenario-Based Multi-Objective AVI Reader Location Models Under Different Travel Demand Patterns.” Transportmetrica 6 (1): 53–78. doi: 10.1080/18128600902929617
   Google Scholar
• Chen, C.-H., S. Yan, and C.-H. Tseng. 2010. “Inter-City Bus Scheduling for Allied Carriers.” Transportmetrica 6 (3): 161–185. doi: 10.1080/18128600902853197
   Google Scholar
• Côté, J. F., and J. Y. Potvin. 2009. “A Tabu Search Heuristic for the Vehicle Routing Problem with Private Fleet and Common Carrier.” European Journal of Operational Research 198 (2): 464–469. doi: 10.1016/j.ejor.2008.09.009
   Google Scholar
• Daganzo, C. F. 1991. Logistics Systems Analysis. New York: Springer-Verlag.
   Google Scholar
• Dantzig, G. B., and J. H. Ramser. 1959. “The Truck Dispatching Problem.” Management Science 6 (1): 80–91. doi: 10.1287/mnsc.6.1.80
   Google Scholar
• Donati, A. V., R. Montemanni, N. Casagrande, A. E. Rizzoli, and L. M. Gambardella. 2008. “Time Dependent Vehicle Routing Problem with a Multi Ant Colony System.” European Journal of Operational Research 185 (3): 1174–1191. doi: 10.1016/j.ejor.2006.06.047
   Google Scholar
• Dorigo, M., M. Birattari, and T. Stützle. 2006. “Ant Colony Optimization: Artificial Ants as a Computational Intelligence Technique.” IEEE Computational Intelligence Magazine 1 (4): 28–39.
   Google Scholar
• Erto, P. 2008. Probabilità e statistica per le science e l'ingegneria. Italy: McGraw-Hill.
   Google Scholar
• Figliozzi, M. A., L. Kingdon, and A. Wilkitzki. 2007. “Freight Distribution Tours in Congested Urban Areas: Characteristics and Implications for Carriers’ Operations and Data Collection Efforts.” Transportation Research Board, 86th Annual Meeting. Washington, DC.
   Google Scholar
• Fisher, M. L. 1994. “Optimal Solution of Vehicle Routing Problems Using Minimum k-Trees.” Operation Research 42 (4): 626–642. doi: 10.1287/opre.42.4.626
   Google Scholar
• Fisher, M. L., K. O. Jörnsten, and O. B. G. Madsen. 1997. “Vehicle Routing with Time Windows: Two Optimization Algorithms.” Operations Research 45 (3): 488–492. doi: 10.1287/opre.45.3.488
   Google Scholar
• Gendreau, M., J. Y. Potvin, O. Bräysy, G. Hasle, and A. Løkketamgen. 2008. “Metaheuristics for the Vehicle Routing Problem and its Extensions: A Categorized Bibliography.” In The Vehicle Routing Problem: Latest Advances and New Challenges, edited by Golden, B., S. Raghavan, and E. Wasil, 143–169. Springer, New York.
   Google Scholar
• Goldberg, D. E. 1989. Genetic Algorithms in Search, Optimization and Machine Learning. Addison: Wesley. Boston.
   Google Scholar
• Haghani A., and S. Jung. 2005. “A Dynamic Vehicle Routing Problem with Time-Dependent Travel Times.” Computers & Operations Research 32 (11): 2959–2986. doi: 10.1016/j.cor.2004.04.013
   Google Scholar
• Hanshar, F. T., and B. M. Ombuki-Berman. 2007. “Dynamic Vehicle Routing Using Genetic Algorithms.” Applied Intelligence 27 (1): 89–99. doi: 10.1007/s10489-006-0033-z
   Google Scholar
• Holguín-Veras, J. 2002. “Revealed Preference Analysis of the Commercial Vehicle Choice Process.” Journal of Transportation Engineering 128 (4): 336–346. doi: 10.1061/(ASCE)0733-947X(2002)128:4(336)
   Google Scholar
• Holguín-Veras, J., and E. Thorson. 2003. “Practical Implications of Modeling Commercial Vehicle Empty Trips in Transport Logistics.” Transportation Research Record 1833: 87–94. doi: 10.3141/1833-12
   Google Scholar
• Holguín-Veras, J., and G. R. Patil. 2005. “Observed Route Behavior of Commercial Vehicles.” Transportation Research Record 1906: 74–80. doi: 10.3141/1906-09
   Google Scholar
• Holguın-Veras, J., and G. R. Patil. 2007. “An Integrated Commodity Based/Empty Freight Origin-Destination Synthesis Model.” Transportation Research Record, 2008 (1) 60–67. doi: 10.3141/2008-08
   Google Scholar
• Hoose, N. 1991. Computer Image Processing in Traffic Engineering. New York: John Wiley & Sons.
   Google Scholar
• Hunt, J. D., and K. J. Stefan. 2007. “Tour-Based Microsimulation of Urban Commercial Movements.” Transportation Research Part B 41 (9): 981–1013. doi: 10.1016/j.trb.2007.04.009
   Google Scholar
• Kennedy, J., and R. C. Eberhart. 2001. Swarm Intelligence. San Francisco: Morgan Kaufmann.
   Google Scholar
• Laporte, G. 2007. “What you should know about the vehicle routing problem” [online]. Accessed May 23, 2013. www.gerad.ca/en/publications.
   Google Scholar
• Laporte, G. 2009. “Fifty Years of Vehicle Routing.” Transportation Science 43 (4): 408–416. doi: 10.1287/trsc.1090.0301
   Google Scholar
• Malandraki, C., and M. S. Daskin. 1992. “Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristics Algorithms.” Transportation Science 26 (3): 185–200. doi: 10.1287/trsc.26.3.185
   Google Scholar
• Marinakis, Y., and M. Marinaki. 2010. “A Hybrid – Particle Swarm Optimization Algorithm for the Vehicle Routing Problem.” Expert System with Applications 37 (2): 1446–1455. doi: 10.1016/j.eswa.2009.06.085
   Google Scholar
• Nagata, Y., and O. Bräysy. 2009. “A Powerful Route Minimization Heuristic for the Vehicle Routing Problem with Time Windows.” Operation Research Letters 37 (5): 333–338. doi: 10.1016/j.orl.2009.04.006
   Google Scholar
• van Nes, R., S. Hoogendoorn-Lanser, and F. S. Koppelman. 2008. “Using Choice Sets for Estimation and Prediction in Route Choice.” Transportmetrica 4 (2): 83–96. doi: 10.1080/18128600808685686
   Google Scholar
• Ogden, K. W. 1992. Urban Goods Movement: A Guide to Policy and Planning. Brookfield: Ashgate Publishing Company.
   Google Scholar
• Oppenheim, N. 1995. Urban Travel Demand Modeling. New York: John Wiley & Sons.
   Google Scholar
• Osman, I. H. 1993. “Metastrategy Simulated Annealing and Tabu Search Algorithms for the Vehicle Routing Problem.” Annals of Operations Research 41 (4): 421–451. doi: 10.1007/BF02023004
   Google Scholar
• Polimeni, A., and A. Vitetta. 2012a. “An Approach for Solving Vehicle Routing Problem with Link Cost Variability in the Time.” Procedia Social and Behavioral Sciences 39 (January 2012): 607–621. doi: 10.1016/j.sbspro.2012.03.134
   Google Scholar
• Polimeni, A., and A. Vitetta. 2012b. “A Procedure for an Integrated Network and Vehicle Routing Optimisation Problem.” Procedia Social and Behavioral Sciences 54 (October 2012): 65–74. doi: 10.1016/j.sbspro.2012.09.726
   Google Scholar
• Potvin, J. Y. 2009. “A Review of Bio-Inspired Algorithms for Vehicle Routing.” In Studies in Computational Intelligence: Bio-inspired Algorithms for Vehicle Routing Problem, edited by Pereira, F. B., and J. Tavares, 1–34. Springer, Berlin.
   Google Scholar
• Prins, C. 2004. “A Simple and Effective Evolutionary Algorithm for the Vehicle Routing Problem.” Computers & Operations Research 31 (12): 1985–2002. doi: 10.1016/S0305-0548(03)00158-8
   Google Scholar
• Ruesch, M., P. Hegi, U. Haefeli, D. Matti, B. Schultz, and P. Rütsche. 2008. “Sustainable Goods Supply and Transport in Conurbations: Freight Patterns and Developments in Switzerland.” In Innovation in City Logistics, edited by Taniguchi, E., and R. G. Thompson, 115–138. New York: Nova Science.
   Google Scholar
• Ruisanchez, F., L. dell'Olio, and A. Ibeas. 2012. “Design of a Tabu Search Algorithm for Assigning Optimal Bus Sizes and Frequencies in Urban Transport Services.” Journal of Advanced Transportation 46 (4): 366–377. doi: 10.1002/atr.1195
   Google Scholar
• Russo, F., and A. Comi. 2010. “A Modelling System to Simulate Goods Movements at an Urban Scale.” Transportation 37 (6): 987–1009. doi: 10.1007/s11116-010-9276-y
   Google Scholar
• Russo, F., and A. Vitetta. 2003. “An Assignment Model with Modified Logit, Which Obviates Enumeration and Overlapping Problems.” Transportation 33 (4): 347–370. doi: 10.1007/s11116-005-3507-7
   Google Scholar
• Russo, F., and A. Vitetta. 2006a. La ricerca Di Percorsi in Una Rete: Algoritmi Di Minimo Costo Ed Estensioni. Milano: FrancoAngeli.
   Google Scholar
• Russo, F., and A. Vitetta. 2006b. “A Topological Method to Choose Optimal Solutions After Solving the Multi-Criteria Urban Road Network Design Problem.” Transportation 33 (4): 347–370. doi: 10.1007/s11116-005-3507-7
   Google Scholar
• Russo, F., and A. Vitetta. 2011. “Reverse Assignment: Calibrating Link Cost Functions and updating demand from traffic counts and time measurements.” Inverse Problems in Science & Engineering 19 (7): 921–950. doi: 10.1080/17415977.2011.565339
   Google Scholar
• Sheffi, Y. 1985. Urban Transportation Network. Englewood Cliffs: Prentice-Hall.
   Google Scholar
• Tam, M. L., and W. H. K. Lam. 2008. “Using Automatic Vehicle Identification Data for Travel Time Estimation in Hong Kong.” Transportmetrica 4 (3): 179–194. doi: 10.1080/18128600808685688
   Google Scholar
• Tavakkoli-Moghaddam, R., N. Safaei, and Y. Gholipour. 2006. “A Hybrid Simulated Annealing for Capacitated Vehicle Routing Problems with the Independent Route Length. Applied Mathematics and Computation 176 (2): 445–454. doi: 10.1016/j.amc.2005.09.040
   Google Scholar
• Torday, A., and A. G. Dumont. 2004. “Probe Vehicle Based Travel time Estimation in Urban Networks.” TRISTAN V 2007, Guadaloupe.
   Google Scholar
• Vitetta, A., A. Quattrone, and A. Polimeni. 2007. “Safety of Users in Road Evacuation: Design of Path Choice Models for Emergency Vehicles.” WIT Transactions on the Built Environment 96: 803–812. doi: 10.2495/UT070761
   Google Scholar
• Wardrop, J. P. 1952. “Some Theoretical Aspects of Road Traffic Research.” Road Engineering Division Meeting 24 January 1952, Institution of Civil Engineers Part II (1), 325–378.
   Google Scholar
• Zachariadis, E. E., C. D. Tarantilis, and C. T. Kiranoudis. 2009. “A Guided Tabu Search for the Vehicle Routing Problem with Two-dimensional Loading Constraints.” European Journal of Operation Research 195 (3): 729–743. doi: 10.1016/j.ejor.2007.05.058
   Google Scholar
• Zak, J., A. Redmer, and P. Sawicki. 2011. “Multiple Objective Optimization of the Fleet Sizing Problem for Road Freight Transportation.” Journal of Advanced Transportation 45 (4): 321–347. doi: 10.1002/atr.111
   Google Scholar