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

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.

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.

A sweep-based heuristic using common area is developed for multi-vehicle VRPs under time various and unsymmetric forward and backward vehicle moving speed. One depot and 2 delivery vehicle are assumed in this research to make the problem solving strategy simple. A common area is held to make adjustment of possible unbalance of between two vehicle delivery completion times. The 4 time zone heuristic is used to solve for efficient delivery route for each vehicle. The current size of common area needs to be studied for better results, but the suggested problem solving procedures can be expanded for any number of vehicles.

도로 공사나 토지 공사에서 대규모 절성토 개발 시 설계되는 토량이동계획에서 호수나 습지와 같이 이동불가능한 제척지를 고려해 최적 토량이동 경로 계산 알고리즘을 제안한다. 대규모 절성토 내 토량의 이동계획 수립은 운반단가에 많은 영향을 미치므로 사전에 토량이동계획을 수립해야한다. 선형계획법을 이용한 토량이동 최적화에 대한 연구는 있었으나 이동불가능한 제척지에 대한 영역을 고려한 토량이동 최적화에 대한 연구와 시스템 구현은 없었다. 대부분의 경우는 설계자가 제척지를 고려해 수작업으로 토량이동경로를 조정하고 있다. 본 논문에서 제시한 모델은 먼저 제척지 영역을 평면다각형 위상정보로 변환한 후 A*알고리즘을 이용하여 여러 가시점 경로를 계산한다. 이 경로에 선형계획법을 이용하여 토량이동 최적화를 위한 최소비용 경로를 얻는다. 본 논문에서는 최적 토량이동 설계시스템을 실현함으로써 제시한 모델의 타당성을 입증한다.

This paper considers a problem of optimizing torch paths to cut stock plates nested with open contours. For each contour, one of the two ending points is to be selected as a starting point of cutting with the other being the exit point. A torch path is co

최근 컨테이너터미널 간의 경쟁이 심화되면서 생산성 측면뿐 만 아니라 비용경제성 측면에도 관심이 부각되고 있다. 특히, 에너지 소모량 및 장비투입 규모가 큰 트랜스퍼 크레인 부문에 대한 비효율적인 작업요소가 컨테이너터미널 경쟁력 제고에 있어서 걸림돌이 되고 있으며 이에 대한 개선은 인적, 물적 운영비용의 절감과 함께 생산성의 향상에도 긍정적인 영향을 미칠 것으로 기대된다. 따라서 본 연구에서는 현재 국토해양부 주관으로 진행 중인 'RFID를 활용한 RTLS 기반 항만물류효율화 사업'을 통하여 제공 가능한 컨테이너터미널 반 출입 대상 컨테이너의 시간적 가시성을 토대의 트랜스퍼 크레인의 배정 및 이동경로에 대한 클러스터링 기반 최적화모델을 제안하고 시뮬레이션 기법을 통하여 기대효과수준을 확인하였다.

In the transportation literature, many useful decision making models for ship routing and ship scheduling have been studied. But the majority of these studies are on industrial carriers, bulk carriers, or tankers. It is quite recent that a few optimization models have been developed for liner fleet routing and scheduling problems. However there have been few academic studies on decision making models for the routing or scheduling problems of passenger ships in spite of their economic importance in the entire shipping industry. The purpose of this study is to develop analytic decision making models for ship routing and scheduling for the passenger ship fleet. This study gives two optimization models, one is a linear programming model and the other a goal programming model. These two models are solved easy by commercial linear programming softwares and suggest optimal ship routing plans and many other useful implications for passenger ship fleet managers.