메뉴 건너뛰기




Volumn 2, Issue 1, 2014, Pages 1-19

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

Author keywords

City logistics; Freight; Genetic algorithm; Optimisation; Vehicle routing problem

Indexed keywords


EID: 84900464372     PISSN: 21680566     EISSN: 21680582     Source Type: Journal    
DOI: 10.1080/23249935.2013.826747     Document Type: Article
Times cited : (26)

References (62)
  • 1
    • 33749651515 scopus 로고    scopus 로고
    • A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows
    • 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.
    • (2007) Computers & Operations Research , vol.34 , Issue.6 , pp. 1561-1584
    • Alvarenga, G.B.1    Mateus, G.R.2    De Tomi, G.3
  • 2
    • 33748176011 scopus 로고    scopus 로고
    • Travel time reliability in vehicle routing and scheduling with time windows
    • 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.
    • (2006) Networks and Spatial Economics , vol.6 , Issue.3 , pp. 293-311
    • Ando, N.1    Taniguchi, E.2
  • 3
    • 0037395316 scopus 로고    scopus 로고
    • A genetic algorithm for thevehicle routing problem
    • Baker, B. M., and M.A.Ayechew. 2003. "A Genetic Algorithm for theVehicle Routing Problem." Computers & Operations Research 30 (5): 787-800.
    • (2003) Computers & Operations Research , vol.30 , Issue.5 , pp. 787-800
    • Baker, B.M.1    Ayechew, M.A.2
  • 5
    • 49049114133 scopus 로고    scopus 로고
    • Effects of choice set size and route choice models on path-based traffic assignment
    • 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.
    • (2008) Transportmetrica , vol.4 , Issue.2 , pp. 117-133
    • Bekhor, S.1    Toledo, T.2    Prashker, J.N.3
  • 6
    • 1542382615 scopus 로고    scopus 로고
    • DynaMIT: A simulation-based system for traffic prediction and guidance generation
    • San Juan
    • 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.
    • (1998) TRISTAN , vol.3
    • Ben-Akiva, M.1    Bierlaire, M.2    Koutsopoulos, H.3    Mishalani, R.4
  • 7
    • 2642548894 scopus 로고    scopus 로고
    • A parallel hybrid genetic algorithm for the vehicle routing problem with time windows
    • Berger, J., and M. Barkaoui. 2004. "A Parallel Hybrid Genetic Algorithm for the Vehicle Routing Problem with TimeWindows." Computer & Operations Research 31 (12): 2037-2053.
    • (2004) Computer & Operations Research , vol.31 , Issue.12 , pp. 2037-2053
    • Berger, J.1    Barkaoui, M.2
  • 8
  • 9
    • 49049121046 scopus 로고    scopus 로고
    • Stochastic route choice set generation: Behavioral and probabilistic foundations
    • Bovy, P. H. L., and S. Fiorenzo-Catalano. 2007. "Stochastic Route Choice Set Generation: Behavioral and Probabilistic Foundations." Transportmetrica 3 (3): 173-189.
    • (2007) Transportmetrica , vol.3 , Issue.3 , pp. 173-189
    • Bovy, P.H.L.1    Fiorenzo-Catalano, S.2
  • 10
    • 77958465709 scopus 로고    scopus 로고
    • Melbourne freight movement model
    • edited by Taniguchi, E., R. G. Thompson,. New York: Nova Science
    • 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.
    • (2008) Innovation in City Logistics , pp. 115-138
    • Bowyer, D.1    Thompson, R.G.2    Spiridonos, F.3
  • 11
    • 33748936103 scopus 로고    scopus 로고
    • Heuristics for urban road network design: Lane layout and signal settings
    • 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.
    • (2006) European Journal of Operational Research , vol.175 , Issue.3 , pp. 1682-1695
    • Cantarella, G.E.1    Pavone, G.2    Vitetta, A.3
  • 13
    • 77956397576 scopus 로고    scopus 로고
    • Scenario-based multi-objective AVI reader location models under different travel demand patterns
    • Chen, A., S. Pravinvongvuth, and P. Chootinan. 2010. "Scenario-Based Multi-ObjectiveAVI Reader Location Models Under Different Travel Demand Patterns." Transportmetrica 6 (1): 53-78.
    • (2010) Transportmetrica , vol.6 , Issue.1 , pp. 53-78
    • Chen, A.1    Pravinvongvuth, S.2    Chootinan, P.3
  • 14
    • 77956412289 scopus 로고    scopus 로고
    • Inter-city bus scheduling for allied carriers
    • Chen, C.-H., S.Yan, and C.-H. Tseng. 2010. "Inter-City Bus Scheduling for Allied Carriers." Transportmetrica 6 (3): 161-185.
    • (2010) Transportmetrica , vol.6 , Issue.3 , pp. 161-185
    • Chen, C.-H.1    Yan, S.2    Tseng, C.-H.3
  • 15
    • 63349100413 scopus 로고    scopus 로고
    • A tabu search heuristic for the vehicle routing problem with private fleet and common carrier
    • 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.
    • (2009) European Journal of Operational Research , vol.198 , Issue.2 , pp. 464-469
    • Côté, J.F.1    Potvin, J.Y.2
  • 17
    • 0001953950 scopus 로고
    • The truck dispatching problem
    • Dantzig, G. B., and J. H. Ramser. 1959. "The Truck Dispatching Problem." Management Science 6 (1): 80-91.
    • (1959) Management Science , vol.6 , Issue.1 , pp. 80-91
    • Dantzig, G.B.1    Ramser, J.H.2
  • 19
    • 33846280533 scopus 로고    scopus 로고
    • Ant colony optimization: Artificial ants as a computational intelligence technique
    • 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.
    • (2006) IEEE Computational Intelligence Magazine , vol.1 , Issue.4 , pp. 28-39
    • Dorigo, M.1    Birattari, M.2    Stützle, T.3
  • 21
    • 84900395989 scopus 로고    scopus 로고
    • Freight distribution tours in congested urban areas: Characteristics and implications for carriers' operations and data collection efforts
    • Transportation Research Board,.Washington, DC
    • 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.
    • (2007) 86th Annual Meeting
    • Figliozzi, M.A.1    Kingdon, L.2    Wilkitzki, A.3
  • 22
    • 0028461566 scopus 로고
    • Optimal solution of vehicle routing problems using minimum k-trees
    • Fisher, M. L. 1994. "Optimal Solution of Vehicle Routing Problems Using Minimum k-Trees." Operation Research 42 (4): 626-642.
    • (1994) Operation Research , vol.42 , Issue.4 , pp. 626-642
    • Fisher, M.L.1
  • 23
    • 0031141558 scopus 로고    scopus 로고
    • Vehicle routing with time windows: Two optimization algorithms
    • 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.
    • (1997) Operations Research , vol.45 , Issue.3 , pp. 488-492
    • Fisher, M.L.1    Jörnsten, K.O.2    Madsen, O.B.G.3
  • 24
    • 84888605647 scopus 로고    scopus 로고
    • Metaheuristics for the vehicle routing problem and its extensions: A categorized bibliography
    • edited by Golden, B., S. Raghavan, and E. Wasil, Springer, NewYork
    • Gendreau, M., J.Y. Potvin, O. Bräysy, G. Hasle, and A. Løkketamgen. 2008. "Metaheuristics for theVehicle 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, NewYork.
    • (2008) The Vehicle Routing Problem: Latest Advances and New Challenges , pp. 143-169
    • Gendreau, M.1    Potvin, J.Y.2    Bräysy, O.3    Hasle, G.4    Løkketamgen, A.5
  • 26
    • 13844276135 scopus 로고    scopus 로고
    • A dynamicvehicle routing problem with time-dependent travel times
    • Haghani A., and S. Jung. 2005. "A DynamicVehicle Routing Problem with Time-Dependent Travel Times." Computers & Operations Research 32 (11): 2959-2986.
    • (2005) Computers & Operations Research , vol.32 , Issue.11 , pp. 2959-2986
    • Haghani, A.1    Jung, S.2
  • 27
    • 34250695892 scopus 로고    scopus 로고
    • Dynamic vehicle routing using genetic algorithms
    • Hanshar, F. T., and B. M. Ombuki-Berman. 2007. "Dynamic Vehicle Routing Using Genetic Algorithms." Applied Intelligence 27 (1): 89-99.
    • (2007) Applied Intelligence , vol.27 , Issue.1 , pp. 89-99
    • Hanshar, F.T.1    Ombuki-Berman, B.M.2
  • 28
    • 0036646491 scopus 로고    scopus 로고
    • Revealed preference analysis of the commercialvehicle choice process
    • Holguín-Veras, J. 2002. "Revealed Preference Analysis of the CommercialVehicle Choice Process." Journal of Transportation Engineering 128 (4): 336-346.
    • (2002) Journal of Transportation Engineering , vol.128 , Issue.4 , pp. 336-346
    • Holguín-Veras, J.1
  • 29
    • 1542286082 scopus 로고    scopus 로고
    • Practical implications of modeling commercial vehicle empty trips in transport logistics
    • 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.
    • (2003) Transportation Research Record , vol.1833 , pp. 87-94
    • Holguín-Veras, J.1    Thorson, E.2
  • 31
    • 38849189323 scopus 로고    scopus 로고
    • An integrated commodity based/empty freight origin-destination synthesis model
    • 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.
    • (2007) Transportation Research Record , vol.2008 , Issue.1 , pp. 60-67
    • Holguìn-Veras, J.1    Patil, G.R.2
  • 33
    • 34548821269 scopus 로고    scopus 로고
    • Tour-based microsimulation of urban commercial movements
    • Hunt, J. D., and K. J. Stefan. 2007. "Tour-Based Microsimulation of Urban Commercial Movements." Transportation Research Part B 41 (9): 981-1013.
    • (2007) Transportation Research Part B , vol.41 , Issue.9 , pp. 981-1013
    • Hunt, J.D.1    Stefan, K.J.2
  • 36
    • 73349128424 scopus 로고    scopus 로고
    • Fifty years of vehicle routing
    • Laporte, G. 2009. "FiftyYears of Vehicle Routing." Transportation Science 43 (4): 408-416.
    • (2009) Transportation Science , vol.43 , Issue.4 , pp. 408-416
    • Laporte, G.1
  • 37
    • 0026904591 scopus 로고
    • Time dependent vehicle routing problems: Formulations, properties and heuristics algorithms
    • Malandraki, C., and M. S. Daskin. 1992. "Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristics Algorithms." Transportation Science 26 (3): 185-200.
    • (1992) Transportation Science , vol.26 , Issue.3 , pp. 185-200
    • Malandraki, C.1    Daskin, M.S.2
  • 38
    • 71749086093 scopus 로고    scopus 로고
    • A hybrid - Particle swarm optimization algorithm for the vehicle routing problem
    • 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.
    • (2010) Expert System with Applications , vol.37 , Issue.2 , pp. 1446-1455
    • Marinakis, Y.1    Marinaki, M.2
  • 39
    • 69549111047 scopus 로고    scopus 로고
    • A powerful route minimization heuristic for the vehicle routing problem with time windows
    • Nagata, Y., and O. Bräysy. 2009. "A Powerful Route Minimization Heuristic for theVehicle Routing Problem with TimeWindows." Operation Research Letters 37 (5): 333-338.
    • (2009) Operation Research Letters , vol.37 , Issue.5 , pp. 333-338
    • Nagata, Y.1    Bräysy, O.2
  • 40
    • 49049117008 scopus 로고    scopus 로고
    • Using choice sets for estimation and prediction in route choice
    • 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.
    • (2008) Transportmetrica , vol.4 , Issue.2 , pp. 83-96
    • Van Nes, R.1    Hoogendoorn-Lanser, S.2    Koppelman, F.S.3
  • 43
    • 21144460138 scopus 로고
    • Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
    • Osman, I. H. 1993. "Metastrategy Simulated Annealing and Tabu Search Algorithms for theVehicle Routing Problem." Annals of Operations Research 41 (4): 421-451.
    • (1993) Annals of Operations Research , vol.41 , Issue.4 , pp. 421-451
    • Osman, I.H.1
  • 44
    • 84878178136 scopus 로고    scopus 로고
    • An approach for solving vehicle routing problem with link cost variability in the time
    • January 2012
    • 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.
    • (2012) Procedia Social and Behavioral Sciences , vol.39 , pp. 607-621
    • Polimeni, A.1    Vitetta, A.2
  • 45
    • 84878168064 scopus 로고    scopus 로고
    • A procedure for an integrated network and vehicle routing optimisation problem
    • October 2012
    • 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.
    • (2012) Procedia Social and Behavioral Sciences , vol.54 , pp. 65-74
    • Polimeni, A.1    Vitetta., A.2
  • 47
    • 2642522782 scopus 로고    scopus 로고
    • A simple and effective evolutionary algorithm for the vehicle routing problem
    • Prins, C. 2004. "A Simple and Effective Evolutionary Algorithm for the Vehicle Routing Problem." Computers & Operations Research 31 (12): 1985-2002.
    • (2004) Computers & Operations Research , vol.31 , Issue.12 , pp. 1985-2002
    • Prins, C.1
  • 48
    • 84896240557 scopus 로고    scopus 로고
    • Sustainable goods supply and transport in conurbations: Freight patterns and developments in Switzerland
    • edited by Taniguchi, E., and R. G. Thompson,. NewYork: Nova Science
    • 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. NewYork: Nova Science.
    • (2008) Innovation in City Logistics , pp. 115-138
    • Ruesch, M.1    Hegi, P.2    Haefeli, U.3    Matti, D.4    Schultz, B.5    Rütsche, P.6
  • 49
    • 84867096779 scopus 로고    scopus 로고
    • Design of a tabu search algorithm for assigning optimal bus sizes and frequencies in urban transport services
    • 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.
    • (2012) Journal of Advanced Transportation , vol.46 , Issue.4 , pp. 366-377
    • Ruisanchez, F.1    Dell'olio, L.2    Ibeas, A.3
  • 50
    • 77958469864 scopus 로고    scopus 로고
    • A modelling system to simulate goods movements at an urban scale
    • Russo, F., and A. Comi. 2010. "A Modelling System to Simulate Goods Movements at an Urban Scale." Transportation 37 (6): 987-1009.
    • (2010) Transportation , vol.37 , Issue.6 , pp. 987-1009
    • Russo, F.1    Comi, A.2
  • 51
    • 33744829528 scopus 로고    scopus 로고
    • An assignment model with modified logit, which obviates enumeration and overlapping problems
    • Russo, F., and A. Vitetta. 2003. "An Assignment Model with Modified Logit, Which Obviates Enumeration and Overlapping Problems." Transportation 33 (4): 347-370.
    • (2003) Transportation , vol.33 , Issue.4 , pp. 347-370
    • Russo, F.1    Vitetta, A.2
  • 53
    • 33744829528 scopus 로고    scopus 로고
    • A topological method to choose optimal solutions after solving the multi-criteria urban road network design problem
    • 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.
    • (2006) Transportation , vol.33 , Issue.4 , pp. 347-370
    • Russo, F.1    Vitetta, A.2
  • 54
    • 80052824426 scopus 로고    scopus 로고
    • Reverse assignment: Calibrating link cost functions and updating demand from traffic counts and time measurements
    • 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.
    • (2011) Inverse Problems in Science & Engineering , vol.19 , Issue.7 , pp. 921-950
    • Russo, F.1    Vitetta, A.2
  • 56
    • 55849099624 scopus 로고    scopus 로고
    • Using automaticvehicle identification data for traveltime estimation in Hong Kong
    • Tam, M.L., andW. H. K. Lam. 2008. "UsingAutomaticVehicle Identification Data forTravelTime Estimation in Hong Kong." Transportmetrica 4 (3): 179-194.
    • (2008) Transportmetrica , vol.4 , Issue.3 , pp. 179-194
    • Tam, M.L.1    Lam, W.H.K.2
  • 57
    • 33646363030 scopus 로고    scopus 로고
    • A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length
    • Tavakkoli-Moghaddam, R., N. Safaei, andY. Gholipour. 2006. "A Hybrid Simulated Annealing for Capacitated Vehicle Routing Problems with the Independent Route Length. Applied Mathematics and Computation 176 (2): 445-454.
    • (2006) Applied Mathematics and Computation , vol.176 , Issue.2 , pp. 445-454
    • Tavakkoli-Moghaddam, R.1    Safaei, N.2    Gholipour, Y.3
  • 58
    • 77956628499 scopus 로고    scopus 로고
    • Probe vehicle based travel time estimation in urban networks
    • Guadaloupe
    • Torday, A., and A. G. Dumont. 2004. "Probe Vehicle Based Travel time Estimation in Urban Networks." TRISTAN V 2007, Guadaloupe.
    • (2004) TRISTAN v 2007
    • Torday, A.1    Dumont, A.G.2
  • 59
    • 38849132822 scopus 로고    scopus 로고
    • Safety of users in road evacuation: Design of path choice models for emergency vehicles
    • Vitetta, A., A. Quattrone, andA. 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.
    • (2007) WIT Transactions on the Built Environment , vol.96 , pp. 803-812
    • Vitetta, A.1    Quattrone, A.2    Polimeni, A.3
  • 61
    • 56349108222 scopus 로고    scopus 로고
    • A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
    • Zachariadis, E. E., C. D.Tarantilis, and C.T. Kiranoudis. 2009. "AGuidedTabu Search for theVehicle Routing Problem with Two-dimensional Loading Constraints." European Journal of Operation Research 195 (3): 729-743.
    • (2009) European Journal of Operation Research , vol.195 , Issue.3 , pp. 729-743
    • Zachariadis, E.E.1    Tarantilis, C.D.2    Kiranoudis, C.T.3
  • 62
    • 83455201162 scopus 로고    scopus 로고
    • Multiple objective optimization of the fleet sizing problem for road freight transportation
    • 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.
    • (2011) Journal of Advanced Transportation , vol.45 , Issue.4 , pp. 321-347
    • Zak, J.1    Redmer, A.2    Sawicki, P.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.