This paper presents a path planning optimization model for the engineering units to install obstacles in the shortest time during wartime. In a rapidly changing battlefield environment, engineering units operate various engineering obstacles to fix, bypass, and delay enemy maneuvers, and the success of the operation lies in efficiently planning the obstacle installation path in the shortest time. Existing studies have not reflected the existence of obstacle material storage that should be visited precedence before installing obstacles, and there is a problem that does not fit the reality of the operation in which the installation is continuously carried out on a regional basis. By presenting a Mixed Integrer Programming optimization model reflecting various constraints suitable for the battlefield environment, this study attempted to promote the efficient mission performance of the engineering unit during wartime.

도서관은 문화 공간으로서 누구나 이용할 수 있고 다양한 분야의 지식과 정보를 제공하여 삶의 질을 높이는 중요한 사회기반 시설 중 하나이다. 현재 한국의 도서관 수는 수요에 비해 공급이 부족한 상황이며, 이를 해결하기 위해 일부 지자체는 차량을 수단으로 이동형 도서 서비스를 제공하는 분관 형태의 이동 도서관을 운영하고 있다. 주로 도서관을 이용하기 어려운 사람들을 대상으로 순회하며 도서관 서비스를 제공하지만, 비효율적인 운행 노선과 균일하지 않은 서비스로 실질적인 효과를 발휘하지 못하고 있다. 따라서 본 연구에서는 성남시 새마을 이동 도서관을 대상으로 순회 경로 현황을 파악하고, 최소 이동 거리로 개선된 이동 도서관 노선을 제시하고자 한다. 더욱 효율적인 운영을 위해 서비스 권역을 나누고, 시간 제약을 결합한 차량경로설정 문제를 사용하여 도서 서비스의 이용 격차를 줄인 새로운 운행 노선을 구축하였다. 본 연구는 이동 도서관의 효과적인 노선 운영에 대한 기초적인 자료로 활용될 수 있다는 점에서 의의가 있다. 향후 이동 도서관 뿐만 아니라 이동형 공공 서비스를 위한 유용하고 현실적인 가이드라인으로 활용될 수 있을 것이다.

Transportation in urban area has been getting hard to fulfill the demand on time. There are various uncertainties and obstacles related with road conditions, traffic congestions, and accidents to interrupt the on-time deliveries. With this situation, the last mile logistics has been a keen issue for researchers and practitioners to find the best strategy of the problem. A way to resolve the problem is to use parcel lockers. Parcel locker is a storage that customers can pick up their products. Transportation vehicles deliver the products to parcel lockers instead of all customer sites. Using the parcel lockers, the total delivery costs can be reduced. However, the inconvenience of customer has to increase. Thus, we have to optimal solution to balance between the total delivery costs and customers' inconvenience. This paper formulates a mathematical model to find the optimal solution for the vehicle routing problem and the location problem of parcel lockers. Experimental results provide the viability to find optimal strategy for the routing problem as well as the location problem.

Additive manufacturing is a new approach to design and production. This applies in particular to processes such as repair and rework of selected components. Additive manufacturing can produce almost any shape, and from an MRO part perspective, additive manufacturing offers tremendous advantages. The special feature of additive manufacturing is that it is particularly economical for small-volume production as the number of units is irrelevant compared to the existing manufacturing process. The purpose of this study was started from the MRO point of view, and it Identify changes and respond to the Blisk It is a study on the effect of changing the conditions on the path of the toolpath and the CAM during additive manufacturing using CAM after finding suitable conditions. metal powder.The metal powder withstands various corrosive environments and age hardening occurs very slowly. Inconel 718, which can be used in various applications such as nuclear facility-related parts, aerospace, oil facilities, turbines, and valves, was used. This is SUS 316L with good high temperature strength. The variable of the laser used in the study is the laser power, and the variables on the CAM are Operation, Stepover, Pattern, etc. In the relation between laser power and feed, when feed is specified as 500mm/min, laser power of 700W was most suitable. As for the conditions on NX CAM, ADDITIVE PROFILE Stepover was 0.8mm for Operation, and Infills and Finish for Pattern. When stacking, each layer should be overlapped with the result. Therefore, the stepover should be smaller than the laser spot size and reprocessing should be done in terms of repair, so infills and finish were applied to work larger than the actual product shape.

This paper deals with a vehicle routing problem with resource repositioning (VRPRR) which is a variation of well-known vehicle routing problem with pickup and delivery (VRPPD). VRPRR in which static repositioning of public bikes is a representative case, can be defined as a multi-objective optimization problem aiming at minimizing both transportation cost and the amount of unmet demand. To obtain Pareto sets for the problem, famous multi-objective optimization algorithms such as Strength Pareto Evolutionary Algorithm 2 (SPEA2) can be applied. In addition, a linear combination of two objective functions with weights can be exploited to generate Pareto sets. By varying weight values in the combined single objective function, a set of solutions is created. Experiments accomplished with a standard benchmark problem sets show that Variable Neighborhood Search (VNS) applied to solve a number of single objective function outperforms SPEA2. All generated solutions from SPEA2 are completely dominated by a set of VNS solutions. It seems that local optimization technique inherent in VNS makes it possible to generate near optimal solutions for the single objective function. Also, it shows that trade-off between the number of solutions in Pareto set and the computation time should be considered to obtain good solutions effectively in case of linearly combined single objective function.

This paper proposes a methodology for gantry route optimization in order to maximize the productivity of a odd-type surface mount device (SMD). A odd-type SMD is a machine that uses a gantry to mount electronic components on the placement point of a printed circuit board (PCB). The gantry needs a nozzle to move its electronic components. There is a suitability between the nozzle and the electronic component, and the mounting speed varies depending on the suitability. When it is difficult for the nozzle to adsorb electronic components, nozzle exchange is performed, and nozzle exchange takes a certain amount of time. The gantry route optimization problem is divided into the mounting order on PCB and the allocation of nozzles and electronic components to the gantry. Nozzle and electronic component allocation minimized the time incurred by nozzle exchange and nozzle-to-electronic component compatibility by using an mixed integer programming method. Sequence of mounting points on PCB minimizes travel time by using the branch-and-price method. Experimental data was made by randomly picking the location of the mounting point on a PCB of 800mm in width and 800mm in length. The number of mounting points is divided into 25, 50, 75, and 100, and experiments are conducted according to the number of types of electronic components, number of nozzle types, and suitability between nozzles and electronic components, respectively. Because the experimental data are random, the calculation time is not constant, but it is confirmed that the gantry route is found within a reasonable time.

선박은 해양사고 발생 시 최악의 경우 퇴선을 해야 하나 특성상 협소하고 복잡하며 해상에서 운항하므로 퇴선이 쉽지 않다. 특히, 여객선의 경우 해상에서의 안전훈련을 이수하지 않은 불특정 다수의 승객들로 인해 더욱 퇴선이 어려운 상황이 된다. 이런 경우 승무원들의 피난 유도가 상당히 중요한 역할을 하게 된다. 그리고 구조자가 사고 선박에 진입하여 구조 활동을 하는 경우 어느 구역으로 진입해야 가장 효과적인지에 대한 검토가 필요하다. 일반적으로 승무원 및 구조자는 최단경로를 택하여 이동하는 것이 일반적이나 최단 경로에 사고 상황 등이 발생했을 경우 제2의 최적 경로 선택이 필요하다. 이러한 상황을 해결하기 위해 이 연구에서는 머신러닝(Machine learning)의 기법 중에 하나인 강화학습(Reinforcement Learning)의 Q-Learning 이용하여 퇴선 경로를 산출하고자 한다. 강화학습은 인공지능(Artificial Intelligence)의 가장 핵심적인 기능으로 현재 여러 분야에 사용되고 있다. 현재까지 개발된 대부분의 피난분석 프로그램은 최단경로를 탐색하는 기법을 사용하고 있다. 이 연구에서는 최단경로가 아닌 최적경로를 분석하기 위해 머신러닝의 강화학습 기법을 이용하였다. 향후 AI기법인 머신러닝은 자율운항선박의 최적항로 선정 및 위험요소 회피 등 다양한 해양관련 산업에 적용 가능할 것이다.

With the increased interest in the quality of life of modern people, the implementation of the five-day working week, the increase in traffic convenience, and the economic and social development, domestic and international travel is becoming commonplace. Furthermore, in the past, there were many cases of purchasing packaged goods of specialized travel agencies. However, as the development of the Internet improved the accessibility of information about the travel area, the tourist is changing the trend to plan the trip such as the choice of the destination. Web services have been introduced to recommend travel destinations and travel routes according to these needs of the customers. Therefore, after reviewing some of the most popular web services today, such as Stubby planner (http://www.stubbyplanner.com) and Earthtory (http://www.earthtory.com), they were supposed to be based on traditional Traveling Salesman Problems (TSPs), and the travel routes recommended by them included some practical limitations. That is, they were not considered important issues in the actual journey, such as the use of various transportation, travel expenses, the number of days, and lodging. Moreover, although to recommend travel destinations, there have been various studies such as using IoT (Internet of Things) technology and the analysis of cyberspatial Big Data on the web and SNS (Social Networking Service), there is little research to support travel routes considering the practical constraints. Therefore, this study proposes a new mathematical model for applying to travel route recommendation service, and it is verified by numerical experiments on travel to Jeju Island and trip to Europe including Germany, France and Czech Republic. It also expects to be able to provide more useful information to tourists in their travel plans through linkage with the services for recommending tourist attractions built in the Internet environment.