참고문헌
- Barreto, S., Ferreira, C., Paixao, J., and Santos, B.S., Using clustering analysis in a capacitated locationrouting problem. European Journal of Operational Research, 2007, Vol. 179, No. 3, p 968-977. https://doi.org/10.1016/j.ejor.2005.06.074
- Donati, A.V., Montemanni, R., Casagrande, N., Rizzoli, A.E., and Gambardella, L.M., Time dependent vehicle routing problem with a multi ant colony system. European Journal of Operational Research, 2008, Vol. 185, No. 3, p 1174-1191. https://doi.org/10.1016/j.ejor.2006.06.047
- Gillett, B. and Miller, L., A heuristic algorithm for the vehicle-dispatch problem. Operations Research, 1974, Vol. 22, No. 2, p 340-349. https://doi.org/10.1287/opre.22.2.340
- Haghani, A. and Jung, S., A dynamic vehicle routing problem with time-dependent travel times. Computers and operations research, 2005, Vol. 32, No. 11, p 2959- 2986. https://doi.org/10.1016/j.cor.2004.04.013
- Imran, A., Salhi, S., and Wassan, N.A., A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem. European Journal of Operational Research, 2009, Vol. 197, No. 2, p 509-518. https://doi.org/10.1016/j.ejor.2008.07.022
- Kuo, Y., Using simulated annealing to minimize fuel consumption for the time-dependent vehicle routing problem. Computers and Industrial Engineering, 2010, Vol. 59, No. 1, p 157-165. https://doi.org/10.1016/j.cie.2010.03.012
- Malandraki, C. and Daskin, M.S., Time dependent vehicle routing problems: Formulations, properties and heuristic algorithms. Transportation Science, 1992, Vol. 26, No. 3, p 185-200. https://doi.org/10.1287/trsc.26.3.185
- Mingyao, Q., Guoziang, D., You, Z., and Lixin, M., Vehicle routing problem with time windows based on spatiotemporal distance. Journal of Transportation Systems Engineering and Information Technology, 2011, Vol. 11, No. 1, p 85-89.
- Moon, G. and Park, S., Analysis and Reconstruction of Vehicle Speeds to Design an Efficient Time Dependent VRP Heuristic. Journal of the Society of Korea Industrial and Systems Engineering, 2012, Vol. 35, No. 1, p 140-147.
- Moon, G. and Park, S., A Possible Heuristic for Variable Speed Vehicle Routing Problem with 4 Time Zone. Journal of the Society of Korea Industrial and Systems Engineering, 2012, Vol. 35. No. 4, p 171-178.
- Park, S. and Moon, G., An efficient delivery assignment for multi-vehicle under unsymmetry-time-various vehicle moving speeds. Autumn Conference of the Korean Operations Research and Management Science Society, 2013, p 795-799.
- Ren, C. and Xiaobo, W., Research on VRP Optimizing Based on Hierarchy clustering and IGA under Common Distribution. Computational Intelligence and Security, 2006 International Conference on., 2006, Vol. 1, p. 143-146.
- Suthikarnnarunai, N., A Sweep Algorithm for the Mix Fleet Vehicle Routing Problem. Proceedings of the International Multi-Conference of Engineers and Computer Scientists 2008(IMECS 2008) Hong Kong, 2008, Vol. 2, p 19-21.
- Venkatesan, S.R., Logendran, D., and Chandrmohan, D., Optimization of Capacitated Vehicle Routing Problem Using PSO. International Journal of Engineering Science and Technoloty(IJEST), 2011, Vol. 3, No. 10, p 7469-7477
- Zhishuo, L. and Yueting, C., Sweep based Multiple Ant Colonies Algorithm for Capacitated Vehicle Routing Problem, e-Business Engineering, 2005. (ICEBE'05) IEEE International Conference on, 2005, p 387-394.
피인용 문헌
- Sweep해법 및 공동구역 2차 재할당에 의한 복수차량 배송 최적화 연구 vol.37, pp.1, 2013, https://doi.org/10.11627/jkise.2014.37.1.133