Browse > Article
http://dx.doi.org/10.7232/JKIIE.2011.37.3.171

Study on Vehicle Routing Problem of Artillery Position Construction for Survivability Support  

Moon, Jung-Hyun (Department of Operations Research, Korea National Defense University)
Lee, Sang-Heon (Department of Operations Research, Korea National Defense University)
Publication Information
Journal of Korean Institute of Industrial Engineers / v.37, no.3, 2011 , pp. 171-179 More about this Journal
Abstract
In this paper, we deal with the vehicle routing problem that could establish operational plan of military engineer for survivability support of artillery position construction. We propose VRPTW(vehicle routing problem with time-window) model of special form that considered service level to reflect the characteristics of military operations rather than the logic of economic efficiencies in the objective function. Furthermore we suggest modified particle swarm optimization algorithm for service based vehicle routing problem solution that can be possible to search in complicated and uncertain area and control relation softly between global and local search.
Keywords
Artillery Position Construction; Vehicle Routing Problem; Particle Swarm Optimization;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Kennedy, J. and Eberhart, R. (2001), Swarm Intelligence, Morgan Kaufman Publishers, San Francisco.
2 Miller, C. E., Tucker, A. W., and Zemlin, R. A. (1960), Integer Programming Formulation of Traveling Salesman Problems, Journal of Association for Computing Machinery, 7, 326-329.   DOI
3 Lee, S. H. and Hwang, S. H. (2009), Heterogeneous Fleet Vehicle Routing Problem with Customer Restriction using Particle Swarm Optimization, Journal of the Korean Institute of Industrial Engineers, 35, 1-10.
4 Pang, W., Wang, K., Zhou, C., and Dong, L. (2004), Fuzzy Discrete Particle Swarm Optimization for Solving Traveling Salesman Problem, Proceedings of the Fourth International Conference on Computer and Information Technology(CIT'04), 796-800.
5 Shelokar, P. S. (2007), Particle Swarm and Ant Colony Algorithms Hybridized for Improved Continuous Optimization, Applied Mathematics and Computation, 188, 129-142.   DOI   ScienceOn
6 Simon French (1982), Sequencing and Scheduling : an Introduction to the Mathematics of the Job-Shop, Ellis Horwood Limited, 34-47.
7 Eberhart, R. and Kennedy, J. (1995), A New Optimizer using Particle Swarm Theory, Proceedings of Sixth International Symposium on Micromachine and Human Science, 39-43.
8 Field Manual (2002), Field Artillery Operation, ROK Army Headquarters, 2-2.
9 Field Manual (2008), Field Engineer Operation, ROK Army Headquarters, 34-1.
10 Ai, T., Kachitvichyanukul, V. (2008), Particle Swarm Optimization and Two Solution Representations for Solving the Capacitaed Vehicle Routing Problem, Computers and Industrial Engineering, 56, 380-387.
11 Kennedy, J. and Eberhart, R. (1995), Particle Swarm Optimization, Proceeding of IEEE International Conference on Neural Networks, 1942-1948.
12 Chen, A., Yang, G., and Wu, Z. (2006), Hybrid Discrete Particle Swarm Optimization Algorithm for Capacitated Vehicle Routing Problem, Journal of Zhejiang University Science A, 7, 607-614.   DOI
13 Daniel, N. Wilke (2005), Analysis of the Particle Swarm Optimization Algorithm, University of Pretoria, Electronic Theses and Dissertations(ETD).
14 Yan Jiang et al. (2007), An Improved Particle Swarm Optimization Algorithm, Applied Mathematics and Computation, 193, 231-239.   DOI   ScienceOn