• 산업경영시스템학회지
• /
• 제27권2호
• /
• pp.102-113
• /
• 2004

This paper addresses the transportation planning that is based on genetic algorithm for determining transportation time and transportation amount of minimizing cost of distribution system. The vehicle routing of minimizing the transportation distance of vehicle is determined. A distribution system is consisted of a distribution center and many retailers. The model is assumed that the time horizon is discrete and finite, and the demand of retailers is dynamic and deterministic. Products are transported from distribution center to retailers according to transportation planning. Cost factors are the transportation cost and the inventory cost, which transportation cost is proportional to transportation distance of vehicle when products are transported from distribution center to retailers, and inventory cost is proportional to inventory amounts of retailers. Transportation time to retailers is represented as a genetic string. The encoding of the solutions into binary strings is presented, as well as the genetic operators used by the algorithm. A mathematical model is developed. Genetic algorithm procedure is suggested, and a illustrative example is shown to explain the procedure.

• 한국인터넷방송통신학회논문지
• /
• 제13권5호
• /
• pp.173-181
• /
• 2013

본 논문은 복합상품 운송 문제의 최적해를 구하는 단순한 발견적 방법을 제안한다. 제안 알고리즘은 첫 번째로, 복합상품 중개운송 문제인 경우 일반적인 운송 문제로 변환시킨다. 이 과정에서 중개지를 공급지로, 중개지의 수용량 제약조건을 공급량으로 치환한다. 다음으로 단일 상품으로 분해한다. 두 번째로, 복합상품 운송문제인 경우 상품별로, 복합상품 중개운송 문제인 경우는 직접 열 (수요지) 기준으로 최소 비용을 선택한다. 행 (공급지) 기준으로 선택된 비용 오름차순으로 공급량, 수용량과 요구량 제약조건을 만족하도록 수송량을 배정한다. 주어진 요구량을 모두 만족할 때까지 이 과정을 반복한다. 이렇게 얻은 초기해에 대해 세 번째로, 수송비용을 감소시킬 수 있는 조건을 만족하면 배정량을 조정한다. 이와 같이 단순한 알고리즘을 2개의 복합상품 운송 문제와 3개의 복합상품 중개운송 문제에 적용한 결과, 선형계획법으로 최적해를 제시한 3개 문제 중 2개 문제에서 최적해를 개선하는 효과를 얻었다. 결국, 제안된 알고리즘은 선형계획법을 적용하는 방법보다 좋은 알고리즘으로 판명되었다.

• 전력전자학회:학술대회논문집
• /
• 전력전자학회 2012년도 추계학술대회 논문집
• /
• pp.21-22
• /
• 2012

This paper propose initial rotor position detecting algorithm of incremental encoder. The proposed algorithm estimates d-axis initial position of PMSM using 6 step operation. The proposed algorithm is verified by experimentally.

• 한국철도학회:학술대회논문집
• /
• 한국철도학회 2011년도 정기총회 및 추계학술대회 논문집
• /
• pp.607-613
• /
• 2011

This paper reviews search methods of multiple reasonable paths to implement multimodal public transportation network of Seoul. Such a large scale multimodal public transportation network as Seoul, the computation time of path finding algorithm is a key and the result of path should reflect route choice behavior of public transportation passengers. Search method of alternative path is divided by removing path method and deviation path method. It analyzes previous researches based on the complexity of algorithm for large-scale network. Applying path finding algorithm in public transportation network, transfer and loop constraints must be included to be able to reflect real behavior. It constructs the generalized cost function based on the smart card data to reflect travel behavior of public transportation. To validate the availability of algorithm, experiments conducted with Seoul metropolitan public multimodal transportation network consisted with 22,109 nodes and 215,859 links by using the deviation path method, suitable for large-scale network.

• 산업공학
• /
• 제21권1호
• /
• pp.120-130
• /
• 2008

In this paper, we develop a transportation planning system for the mail transportation network, which consists of 25 mail centers and one mail exchange center. The main functions of the system are adjustment of transportation plan, creation of new transportation plan, and calculation of expected exchange mail volume which are transported through mail exchange center. We develop an adjusting algorithm which gives a new transportation plan by deleting, adding or changing the current routes. The algorithm based on the transportation results of current transportation plan and mail volume data. We design and implement a planning system by installing the algorithm as the planning engine. For the practical use, the system is connected to the information system of Korea Post, PostNet.

• Journal of Information Processing Systems
• /
• 제19권1호
• /
• pp.46-54
• /
• 2023

To improve the railway transportation capacity and maximize the benefits of railway transportation, a method for layout optimization of railway transportation route based on deep convolution neural network is proposed in this study. Considering the transportation cost of railway transportation and other factors, the layout model of railway transportation route is constructed. Based on improved ant colony algorithm, the layout model of railway transportation route was optimized, and multiple candidate railway transportation routes were output. Taking into account external information such as regional information, weather conditions and actual information of railway transportation routes, optimization of the candidate railway transportation routes obtained by the improved ant colony algorithm was performed based on deep convolution neural network, and the optimal railway transportation routes were output, and finally layout optimization of railway transportation routes was realized. The experimental results show that the proposed method can obtain the optimal railway transportation route, the shortest transportation length, and the least transportation time, maximizing the interests of railway transportation enterprises.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2001년도 추계학술대회 논문집
• /
• pp.191-194
• /
• 2001

We consider a postal transportation planning in the transportation network of the form of hub and spoke. Given mail sorting centers and an exchange center, available vehicles and amount of mails to be transported between mail sorting centers, postal transportation planning is to make a transportation plan without violating various restrictions. The objective is to minimize the total transportation cost. To solve the problem, a tabu search algorithm is Proposed. The algorithm is composed of a route construction procedure and a route improvement procedure to improve a solution obtained by the route construction procedure using a tabu search. Computational results show that the proposed algorithm can solve practically sized problems within a reasonable time and the quality of the solution is acceptable.

• 제어로봇시스템학회논문지
• /
• 제22권2호
• /
• pp.83-88
• /
• 2016

In this paper, a design method for a logistics transportation robot based on a modular conveyor rack and path planning considering the environment of a logistics center is proposed. The driving part of the logistics transportation robot is designed and the working method of lifter for the transportation function is explained. The design of the modular conveyor rack is also described and an algorithm for a logistics transportation robot using a modular conveyor rack is suggested. The $A^*$ algorithm is improved by using the concept of rotation cost and the initial state of the transportation robot's characteristics. We experimented with a four-step transportation algorithm for a logistics transportation robot using a modular conveyor rack and showed that the proposed method can be used successfully in a logistics center. In addition, we verified the effectiveness of the improved $A^*$ algorithm considering the rotation cost and the initial state of the robot.

• Journal of Information Technology Applications and Management
• /
• 제9권4호
• /
• pp.13-34
• /
• 2002

This paper considers a postal transportation planning problem in the transportation network of the form of hub and spoke Given mail sorting centers and an exchange center, available vehicles and amount of mails to be transported between mail sorting centers, postal transportation planning is to make a transportation plan without violating various restrictions. The objective is to minimize the total transportation cost. To solve the problem, a tabu search algorithm is proposed. The algorithm is composed of a route construction procedure and a route improvement procedure to improve a solution obtained by the route construction procedure using a tabu search. The tabu search uses the best-admissible strategy, BA, and the first-best-admissible strategy, FBA. The algorithm was tested on problems consisting of 11, 16 and 21 mail sorting centers including one exchange center. Solutions of the problems consisting of 11 mail sorting centers including one exchange center were compared with optimal solutions On average, solutions using BA strategy were within 0.287% of the optimum and solutions using FBA strategy were within 0.508% of the optimum. Computational results show that the proposed algorithm can solve practically sized problems within a reasonable time and the quality of the solution is very good.

• 대한산업공학회지
• /
• 제27권2호
• /
• pp.140-149
• /
• 2001

The paper discusses the problem of finding the Origin-Destination(O-D) shortest paths in internodal transportation networks with time-schedule constraints. The shortest path problem on the internodal transportation network is concerned with finding a path with minimum distance, time, or cost from an origin to a destination using all possible transportation modalities. The time-schedule constraint requires that the departure time to travel from a transfer station to another node takes place only at one of pre-specified departure times. The scheduled departure times at the transfer station are the times when the passengers are allowed to leave the station to another node using the relative transportation modality. Therefore, the total time of a path in an internodal transportation network subject to time-schedule constraints includes traveling time and transfer waiting time. In this paper, a genetic algorithm (GA) approach is developed to deal with this problem. The effectiveness of the GA approach is evaluated using several test problems.