http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
문기주(Geeju Moon),박성미(Sungmee Park) 한국산업경영시스템학회 2012 한국산업경영시스템학회지 Vol.35 No.4
A possible heuristic to solve metropolitan area vehicle routing problems with variable vehicle speeds is suggested in this research. Delivery hours are classified into 4 different time zones to make variable vehicle speeds no change within the same time zone to make TDVRP simple to solve. The suggested heuristic consists of 2 stages such as initial solution development step and initial solution improvement step. A computer program using C++ is constructed to evaluate the suggested heuristic. Randomly generated vehicle routing problems are used for the experiments. This heuristic could be helpful to logistics companies by increasing delivery efficiencies since the 4 zone classification is taken from the observed traffic information offered by a local government.
시간종속VRP의 효율적 해법 설계를 위한 차량통행속도의 분석과 재구성
문기주(Geeju Moon),박성미(Sungmee Park) 한국산업경영시스템학회 2012 한국산업경영시스템학회지 Vol.35 No.1
Vehicle routing problem is one of the traveling salesman problems with various conditions such as vehicle capacity limits, delivery time windows, as well as time dependent speeds in metropolitan area. In this research hourly vehicle moving speeds information in a typical metropolitan area are analyzed to use the results in the design procedure of VRP heuristic. Quality initial vehicle routing solutions can be obtained with adaption of the analysed results of the time periods with no vehicle speed changes. This strategy makes complicated time dependent vehicle speed simple to solve. Time dependent vehicle speeds are too important to ignore to obtain optimum vehicle routing search for real life logistics systems.
문윌리엄(William J Moon),문기주(Geeju Moon) 동아대학교 경영문제연구소 2008 經營論叢 Vol.29 No.-
The telecommunication industry is entering the maturity stage, resulting in vast shifts in its competitive landscape. Cingular, the top telecommunication company in the United States, for example, has suffered from decreasing net income, increasing consumer dissatisfaction, and a threat in its market leader position. Many of the symptoms that Cingular suffers are ubiquitous concerns throughout the wireless communication industry, and will only become worse as the industry is set for intensified competition. This paper conducts a case study of Cingular that may be used as a model through which other telecommunication companies can better address the challenges that are expected in the increasingly saturated market.
시간단위 차량통행 속도정보의 활용을 위한 구역분할 방법의 연구
박성미(Sung Mee Park),문기주(Geeju Moon) 한국산업경영시스템학회 2010 한국산업경영시스템학회지 Vol.33 No.4
This research is about developing an efficient solution procedure for the vehicle routing problem under varying vehicle moving speeds for hour-based time interval. Different moving speeds for every hour is too difficult condition to solve for this type of combinatorial optimization problem. A methodology to divide the 12 hour based time interval offered by government into 5 different time intervals and then divide delivery area into 12 small divisions first and then re-organizing them into 5 groups. Then vehicle moving speeds are no longer varying in each of the 5 divisions. Therefore, a typical TSP solution procedure may be applied to find the shortest path for all 5 divisions and then connect the local shortest paths to form a delivery path for whole area. Developed solution procedures are explained in detail with 60 points example.
왕복비대칭 차량이동속도 하에서의 복수차량 배송경로 최적화
박성미(Sungmee Park),문기주(Geeju Moon) 한국산업경영시스템학회 2013 한국산업경영시스템학회지 Vol.36 No.4
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.
택배배송 VRP 해법 설계를 위한 도보전달소요시간에 대한 연구
박성미(Sungmee Park),문기주(Geeju Moon) 한국산업경영시스템학회 2012 한국산업경영시스템학회지 Vol.35 No.2
Parcel delivery services are a bit different from general vehicle routing problems since the services require a deliver's walking time to give the parcel to the customer. This time takes more than 1/4 of total delivery time, but it is ignored for the convenience of algorithm design in general. The walking time is too big to be ignored if we need to estimate necessary delivery time precisely as much as possible, or to design a heuristic with varying vehicle moving speeds in metropolitan area. For these reasons, the walking times are surveyed and analyzed to use on the design of VRP heuristic for parcel delivery services in this research.
문윌리엄(William J Moon),문기주(Geeju Moon) 동아대학교 경영문제연구소 2007 經營論叢 Vol.28 No.-
The purpose of this paper is to survey firm behaviors in the rising field of internet recruiting. Our research identifies the theoretical and empirical underpinning behind the discrepancy in the intensity of internet recruiting use across different firms. We find that manufacturing firms are less likely to use internet as a recruiting tool than any other firms in the industry. This stays consistent with previous literatures" findings that the internet is used primarily for the skilled labor market. In addition, we find that size and the purpose of company websites to have no significant role in explaining recruiting patterns. Rather, we believe that individual firms corporate strategy to have a larger role in explicating the difference in recruiting behavior across firms.
Sweep해법 및 공동구역 2차 재할당에 의한 복수차량 배송 최적화 연구
박성미(Sungmee Park),문기주(Geeju Moon) 한국산업경영시스템학회 2014 한국산업경영시스템학회지 Vol.37 No.1
An efficient heuristic for two-vehicle-one-depot problems is developed in this research. Vehicle moving speeds are various along hour based time intervals due to traffic jams of rush hours. Two different heuristics are examined. One is that the delivery area assignment is made using Sweep algorithm for two vehicles by splitting the whole area in half to equally divide all delivery points. The other is using common area by leaving unassigned area between the assigned for two vehicles. The common area is reassigned by two stages to balance the completion time of two vehicle's delivery. The heuristic with common area performed better than the other due to various vehicle moving speeds and traffic jams.
도보 전달소요시간이 택배 배송 VRP해법의 설계에 미치는 영향 분석과 배송시간 예측
박성미(Sungmee Park),문기주(Geeju Moon) 한국산업경영시스템학회 2012 한국산업경영시스템학회 학술대회 Vol.2012 No.-
The restrictions and conditions of parcel delivery services are different from other delivery services. There is WTD in the parcel delivery service. WTDs are various along the types of buildings and delivery points. To make the problem solving method simple and efficient using the WTD, the values are observed and grouped based on the type of buildings in this research. Efficient VRP heuristic design could be possible with introduction of WTD concept as well as the delivery time forecasting.
개선형 탐색법에 의한 기계공장 배치안 작성시 고려요소별 가중치의 크기에 관한 연구
文基柱 한국경영과학회 1995 한국경영과학회지 Vol.20 No.2
Weight of the factors to be considered in layout development with improvement-type heuristics is discussed in this paper. Determination of weight is especially important if it is designed to be used with an improvement-type heuristic. It is same as the value of variable coefficients in a multi-objective function as well as indices for departmental switching orders in the heuristic. Various weights are examined through computer simulation to verify whether the numerical values collected from machinery industries can be used as weights. And then a method to be used for searching an optimum or optimum-tending layout for machinery industries is presented using the weight.