A simulated annealing technique approach to the vehicle routing problem in the case of stochastic demand
暂无分享,去创建一个
[1] Lawrence Bodin,et al. Classification in vehicle routing and scheduling , 1981, Networks.
[2] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[3] Marshall L. Fisher,et al. A generalized assignment heuristic for vehicle routing , 1981, Networks.
[4] B. Golden,et al. Using simulated annealing to solve routing and location problems , 1986 .
[5] Rob A. Rutenbar,et al. Simulated annealing algorithms: an overview , 1989, IEEE Circuits and Devices Magazine.
[6] G. Clarke,et al. Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .
[7] V. Cerný. Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .
[8] Moshe Dror,et al. Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks , 1989, Transp. Sci..
[9] L. Bodin. ROUTING AND SCHEDULING OF VEHICLES AND CREWS–THE STATE OF THE ART , 1983 .
[10] Moshe Dror,et al. Stochastic vehicle routing with modified savings algorithm , 1986 .
[11] N. Metropolis,et al. Equation of State Calculations by Fast Computing Machines , 1953, Resonance.
[12] Craig A. Tovey,et al. Simulated, simulated annealing , 1988 .
[13] Billy E. Gillett,et al. A Heuristic Algorithm for the Vehicle-Dispatch Problem , 1974, Oper. Res..
[14] Richard C. Larson,et al. Urban Operations Research , 1981 .