Vehicle routing problem considering reconnaissance and transportation

학위논문 (석사)-- 서울대학교 대학원 : 공과대학 산업공학과, 2019. 2. 문일경.Troop movement involves transporting military personnel from one location to another using available means. To minimize damage from enemies, the military simultaneously uses reconnaissance and transportation units during troop movements. This thesis proposes vehicle routing problem considering reconnaissance and transportation (VRPCRT) for troop movements in wartime. VRPCRT is formulated as a mixed-integer programming model for minimizing the completion time of wartime troop movements. For this thesis, an ant colony optimization (ACO) algorithm for the VRPCRT was also developed and computational experiments were conducted to compare the performance of the ACO algorithm and that of the mixed-integer programming model. Furthermore, a sensitivity analysis of the change in the number of reconnaissance and transportation vehicles was performed, and the effects of each type of vehicle on troop movement were analyzed.Abstract iii Contents iv List of Tables vi List of Figures vii Chapter 1 Introduction 1 1.1 Research Motivation and Contribution 4 1.2 Organization of the Thesis 5 Chapter 2 Literature Review 6 2.1 Review of pickup and delivery problem 6 2.2 Review of ant colony optimization algorithms 9 Chapter 3 Mathematical model 10 3.1 Problem description 10 3.2 The model formulation 14 3.3 Numerical example 17 Chapter 4 Ant colony optimization algorithm 20 4.1 Construction of a solution 21 4.2 Pheromone updating 23 Chapter 5 Computational experiment 26 5.1 Experiment 1 26 5.2 Experiment 2 29 Chapter 6 Conclusion 34 5.1 Findings 34 5.2 Future direction 35 Bibliography 36 국문초록 40 감사의 글 41Maste