References
- Choi, E-J., Lee, T-H., Park, S-S. (2002), Integer Programming Approach to the Heterogeneous Fleet Vehicle Routing Problem, Korean Institute of Industrial Engineers and The Korean OR/MS Society 2002 Spring Union Scientific Seminar
- Dantzig, G. B. and Ramser, J. H. (1959), TheTruck Dispatching Problem, Management Science, 6, 80-91 https://doi.org/10.1287/mnsc.6.1.80
- Dullaert, W., Janssens, G. K., Sorensen, K. and Vemimmen, B. (2002), New Heuristics for the Fleet Size and Mix Vehicle Routing Problem with Time Windows, Journal of the Operational Research Society, 53, 1232-1238 https://doi.org/10.1057/palgrave.jors.2601422
- Fagerholt, K. (1999), Optimal Fleet Design in a Ship Routing Problem', International Transactions in Operational Research, 6, 453-464 https://doi.org/10.1111/j.1475-3995.1999.tb00167.x
- Gendreau, M., Laporte, G., Musaraganyi, C. and Taillard, E. D. (1999), A Tabu Search Heuristic for the Heterogeneous Fleet Vehicle Routing Problem, Computer & Operations Research, 26, 1153-1173 https://doi.org/10.1016/S0305-0548(98)00100-2
- Gillet, B. and Miller, L. (1974), A Heuristic Algorithm for the Vehicle Dispatch Problem,Operations Research, 22, 340-349 https://doi.org/10.1287/opre.22.2.340
- Golden, B., Assad, A., Levy, L. and Gheysens, F. G. (1984), The Fleet Size and Mix Vehicle Routing Problem, Computer & Operations Research, 11, 49-66 https://doi.org/10.1016/0305-0548(84)90007-8
- Ha, H-G., Lee, K-M., Lee, J-M.(2003), Strategies to Decrease National Logistics Costs for Improving National Competitiveness, The Korea TransportInstitute
- Hong, G-S. (2003), Improvement Plan of Goods Transport Institution, The Korea Transport Institute
- Kang, M-G. (1991), Network and Algorithm, Park -youngsa
- Kim, J.U. and Kim, Y. D.(1999), A Decomposition Approach to a MultiPeriod Vehicle Scheduling Problem, TheInternational Journal of Management Science, 27, 421-430
- Liu, F. H. and Shen, S. Y. (1999), The Fleet Size and Mix Vehicle Routing Problem with Time Windows, Journal of the Operational Research Society, 50, 721-732 https://doi.org/10.1057/palgrave.jors.2600763
- Malandraki, C., and Dial, R. B.(1996), A Restricted Dynamic Programming Heuristic Algorithm for the Time Dependent Traveling Salesman Problem, European Journal of Operational Research, 90, 45-55 https://doi.org/10.1016/0377-2217(94)00299-1
- Ministry of Labor(2004), Report of Labor Statistical Investigation
- Mosheiov, G. (1998), Vehicle Routingwith Pick-up and Delivery: Tour-Partitioning Heuristics, Computers industrial Engineering, 34, 669-684 https://doi.org/10.1016/S0360-8352(97)00275-1
- Robert, T. Sumichrast and Markham, I. S. (1995), A Heuristicand Lower bound for a Multi-Depot Routing Problem, Computer & Operations Research, 22, 1047-1056 https://doi.org/10.1016/0305-0548(94)00083-K
- Tailard, E. D. (1996), 'A Heuristic Column Generation Method for the Heterogeneous Fleet VRP, RAIRO, 33, 1-34 https://doi.org/10.1051/ro:1999101
- Wassan, N. A. and Osman, I. H. (2002), Tabu Search Variants for the Mix Fleet Vehicle Routing Problem, Journal of the Operational Research Society, 53, 768-782 https://doi.org/10.1057/palgrave.jors.2601344