Study on man power planning of hospital transportation department by using VRPSTW

References

• Bodin , L. , Golden , B. , Assad , A. and Bull , D. 1983 . Routing and scheduling of vehicles and crews: the state of the art . Computers & Operations Research , 10 : 63 – 211 .
   Web of Science ®Google Scholar
• 1997 . National Health Insurance Profile , Taiwan : Taipei . Bureau of National Health Insurance
   Google Scholar
• Clark , G. and Wright , J. 1964 . Scheduling of vehicles from a central depot to number of delivery points . Operation Research , 12 : 568 – 581 .
   Web of Science ®Google Scholar
• Cook , W. and Seiford , L. 1978 . Priority ranking and consensus formation . Management Sciences , 24 : 721 – 732 .
   Google Scholar
• Gen , M. and Cheng , R. A survey of penalty techniques in genetic algorithms . in Proceedings of IEEE International Conference on Evolutionary Computation , pp. 804 – 809 .
   Google Scholar
• Gen , M. and Cheng , R. 1997 . Foundations of genetic algorithms . Genetic Algorithms & Engineering Design , : 1 – 41 .
   Google Scholar
• Gillett , B. and Miller , L. 1974 . A heuristic algorithm for the vehicle dispatch problem . Operations Research , 22 : 340 – 349 .
   Web of Science ®Google Scholar
• Koskosidis , Y. A. , Powell , W. B. and Solomon , M. M. 1992 . An optimizationbased heuristics for vehicle routing and scheduling with soft time window constraints . Transportation Science , 26 : 65 – 85 .
   Google Scholar
• Lin , S. 1969 . Computer solutions of the travelling salesman problem . Bell System Tech. J , : 2245 – 2269 .
   Google Scholar
• Peace , G. S. 1993 . Taguchi Methods: A Hands-on Approach , Addison-Wesley Reading-Mass .
   Google Scholar
• Mole , R. and Jameson , S. 1976 . A sequential route-building algorithm employing a generalized savings criterion . Operation Research Quarterly , 27 : 503 – 511 .
   Google Scholar
• Potvin , J. Y. and Rousseau , J. M. 1993 . A parallel route building algorithm for the vehicle routing and scheduling problem with time windows . European Journal of Operational Research , 66 : 331 – 340 .
   Web of Science ®Google Scholar
• Potvin , Y. 1995 . Christian Robillard, clustering for vehicle routing with a competitive neural network . Nerocomputing , 8 : 125 – 139 .
   Google Scholar
• Potvin , J. Y. and Samy , Bengio . 1996 . The vehicle routing problem with time windows – Part II: Genetic search . INFORMS Journal on Computing , 8 : 165 – 172 .
   Google Scholar
• Potvin , J. Y. , Dube , D. and Robillard , C. 1996 . A hybrid approach to vehicle routing using neural networks and genetic algorithm . Applied Intelligence , 6 : 241 – 252 .
   Web of Science ®Google Scholar
• Renaud , J. , Laporte , G. and Boctor , F. 1996 . A Tabu search heuristic for the multi-depot vehicle routing problem . Computers Operations Research , 23 : 229 – 235 .
   Web of Science ®Google Scholar
• Taillard . 1997 . Tabu search heuristic for the vehicle routing problem with soft time windows . Transportation Science , 31 : 170 – 186 .
   Web of Science ®Google Scholar
• Vargas , L. G. 1990 . An overview of the analytical hierarchy process and its applications . European Journal of Operational Research , 48 : 2 – 8 .
   Web of Science ®Google Scholar