• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.185-192
• /
• 2002

최근의 새로운 정보기술이 발전됨에 따라 대다수 수거 및 배송관련업체들은 효과적인 차량운송계획에 대한 새로운 방법을 모색하고 있다. 본 연구는 주문배달 및 수거를 수행하는 택배시스템 내에서 효과적인 차량운송계획을 수행하기 위한 GIS시스템을 응용한 연구로서, 고객의 요구시간제약과 화물의수거 및 배달을 동시에 고려한 최적운송경로시스템을 개발하였다. 이를 위해 GeoDatabase를 기반으로 항 차량운송계획 프로그램을 개발하고, 이를 GIS시스템(ArcLogistics Route)에 적용하여 물류센터와 고객간의 차량운송계획 및 운송정보시스템을 구현하였으며, 부산지역의 수산물류운송계획에 적용하였다.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.31 no.3
• /
• pp.90-100
• /
• 2008

기간차량경로 문제는 차량용량제약을 고려한 차량경로문제를 다 기간으로 확장한 형태의 문제로 역방향 로지스틱스의 폐기물 혹은 재활용품 수거에 관련된 주요한 운영 문제들 중의 하나로 각 고객에 대해서는 계획기간 중에 방문해야 하는 횟수가 정해져 있어 방문날짜 조합을 결정해야 하며 주어진 방문날짜 조합 하에 각 기간의 차량경로도 결정해야 한다. 주요한 제약조건으로는 차량의 용량제약과 각 기간의 가용 시간제약이 있으며 소요차량의 대수를 최소화하는 것을 목적으로 한다. 본 연구에서는 대상 문제의 복잡도로 인하여 초기해를 구하고 그 해를 개선하는 2 단계 발견적 알고리듬을 제안하였으며 다양한 문제들에 대한 계산실험 결과 본 연구에서 제안하고 있는 발견적 알고리듬이 기존 알고리듬보다 우수함을 보였다.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.18 no.2
• /
• pp.45-58
• /
• 2015

The aim of this study is to find out major accumulation zones through field survey and moving route tracking trials on floating debris of Nakdong River. It also identified composition and accumulated amount of the floating debris by sample survey for accumulation zones. As a result, total 5 accumulation zones were selected from the midstream and downstream of the Nakdong River. There was a large amount of floating debris, including vegetation debris, in the accumulation zones. And two accumulation zones located in the downstream region, it is much more likely to flow into the ocean along river. From the sample survey on the major accumulation zones, more than $40{\ell}$ of floating debris were collected including vegetation and artificial debris. As a result of composition analysis for artificial debris, plastic(49%) and styrofoam(36%) were the majority in number. The present study is expected to help to plan an efficient pre-collecting activity and to reduce floating debris flowing into the ocean from the Nakdong River.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.1170-1177
• /
• 2006

We apply VRP(Vehicle Routing Problem) to sludge collection system in this study. Sewage stores of villages are located in each village around a multipurpose dam. Sludge which is produced in sewage store of village is transported from the sewage store of village to the sewage treatment plants by the special purpose vehicle such as the tank lorry. In this paper, we propose sludge collection strategies which allocate each sewage store of village to sewage treatment plants and decide the schedule of sludge collection in order to collect sludge efficiently. The strategies aim to decrease transportation cost with deciding proposed vehicle routing and scheduling the sludge collection. When we decide route of vehicles, we consider the collection time in sewage store of village, distance between sewage store of villages and vehicle information as average velocity of vehicle, operation time of vehicle driver. We also develop the SCMS(Sludge Collection Management System) based on windows system with real data which is used in certain circumstance. And we experiment to figure out vehicle route and transportation cost throughout changing input data.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.30 no.1
• /
• pp.105-114
• /
• 2007

In this paper, we propose sludge collection strategies which allocate each sewage store of village to sewage treatment plants and decide the schedule of sludge collection in order to collect sludge efficiently. The strategies aim to decrease transportation cost with deciding proposed vehicle routing and scheduling the sludge collection. When we decide route of vehicles, we consider the collection time in sewage store of village, distance between sewage store of villages and vehicle information as average velocity of vehicle, operation time of vehicle driver. We also develop the SCMS (Sludge Collection Management System) based on windows system with real data which is used in certain circumstance. And we experiment to figure out vehicle route and transportation cost throughout changing input data.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.21 no.4
• /
• pp.15-27
• /
• 1994

주거환경에서 거주자의 '시각만족(residents' satisfaction with visual appearance)은 더 큰 추상적 개념인 '주거만족'(residents' housing satisfaction)과의 밀접한 인과적 관련(Francescato et. al., 1979) 때문뿐만 아니라 인간 기본 욕구 중의 하나인 미적 욕구의 충족과 관련되어 있다는 점(Chin, 1991)에서도 중요시 되어야 할 이론적 개념이다. 본 연구에서는 거주자의 시각만족을 종속지표로 보고, 다양한 영향 가설변수들과의 인과 적 관련도를 경로분석(path analysis)을 통해 검증하고 있으며, 어떤 변수 가 어떤 이유(경로)로 또는 얼마만한 크기로 거주자의 시각만족에 영향을 주는 가가 중점적으로 토의된다. 한국의 6개 대단위 주거단지로부터 다단 계표집 방법과 설문면담 방법을 통해 646명의 응답이 수거되었다. 분석의 첫 단계로써, 다수의 설문문항을 본 연구의 가설 변수로 집약하기 위한 요 인분석(factor analysis)이 사용되었고, 요인 분석으로부터 추출된 변수들간 의 인과적 관련도를 검증하기 위해 최종적으로 경로분석이 사용되었다. 본 연구의 결과를 요약해 볼 때, 본 연구의 가설 변수 대부분이 최종 종속변 수인 거주자의 '시각만족'에 유의한 인과 영향을 보이는 것으로 나타났으 며, 구체적으로 '시각적 무질서'(visual disorder), '시각적 단조로움'(visual monotony), '단지 과밀감'(development crowding) 등이 부정적 영향을, '시 각적 매력'(visual attractiveness)과 '인근 자연녹지의 존재'(presence of nearby natural environment)등이 긍정적 영향을 미치는 것으로 파악되었 다. 그 외에도 '옥외공간이용 편리'(outdoor or recreation convenience)와 ' 이웃만족'(satisfaction with neighbors), 그리고 '주거환경 유형'(building type, building arrangement type)등도 유의한 인과적 관련을 보이므로써, 기존 문헌들이 제시하고 있는 것보다 훨씬 다양한 변수들이 다양한 경로를 통해 거주자 시각만족의 영향인자가 될 수 있는 가능성을 제시하고 있다. 가설 변수의 하나인 '길찾기의 난이 정도'(difficulty of way-finding)와 종 속변수간에 유의한 관련도가 나타나지 않은 이유로 길찾기 변수가 '시각만 족'보다는 거주자의 '안전만족'(safety)과 관련된 변수일 가능성도 아울러 지적되었다. 본 연구의 결과로부터, 주거 계획 및 설계분야 그리고 추후 관 련 연구 분야를 위한 여러 제안들이 제시되었다.

• Journal of Korean Institute of Industrial Engineers
• /
• v.30 no.4
• /
• pp.346-354
• /
• 2004

Most industrial logistic systems have focused on carrying products from manufacturers or distribution centers to customers. In recent years, they are faced with the problem of integrating reverse flows into their transportation systems. In this paper, we address the vehicle routing problems with mixed delivery and pick-up(VRPMDP). Mixed operation of delivery and pick-up during a vehicle tour requires rearrangement of the goods on board. The VRPMDP considers the reshuffling time of goods at customers, hard time windows, and split operation of delivery and pick-up. We construct a mixed integer mathematical model and propose a new genetic algorithm named GAMP for VRPMDP. Computational experiments on various types of test problems are performed to evaluate GAMP against the modified Dethloff's algorithm. The results show that GAMP reduces the total vehicle operation time by 5.9% on average, but takes about six times longer computation time.

• Journal of Korean Institute of Industrial Engineers
• /
• v.35 no.2
• /
• pp.160-170
• /
• 2009

This paper studies a vehicle routing problem variant which considers customers to require simultaneous delivery and pick-up under time windows(VRPSDP-TW). The objective of this paper is to minimize the total travel distance of routes that satisfy both the delivery and pick-up demand. We propose a heuristic algorithm for solving the VRPSDP-TW, based on the ant colony system(ACS). In route construction, an insertion algorithm based ACS is applied and the interim solution is improved by local search. Through iterative processes, the heuristic algorithm drives the best solution. Experiments are implemented to evaluate a performance of the algorithm on some test instances from literature.

• Journal of the Korea Organic Resources Recycling Association
• /
• v.1 no.2
• /
• pp.287-298
• /
• 1993

In this study, generation characteristics and distribution situation of the animal fat residue were investigated to identify it's management problems and to propose alternatives for the recycling and final disposal. Generation sources were the meat distribution net-work including about 170 slaughterhouses, 280 meat-packing plants, thousands of meat shops and restaurants etc. The daily total amount of the animal fat residue is about 700 ton/day. More than 60% of the generation sources were concentrated in Seoul metropolitan area. The residue was collected by about 300 men using old-fashioned devices like handcarts, bike and auto bike, transported to the recycling plants by about 60 collection agencies. The residue was processed to produce by-products such as grease, tallow, animal feed ingredient in the recycling plants. At present, however, a great number of unlicensed, and mostly small rendering processors without having pollution control facilities do the unlawful business. These small, old fashioned and unorganized businesses are creating environmental problems by disposing the waste in improper ways such as open burning and dump. Improvement of the distribution network, the large-scale plants, and the estabilishing proper infrastructures were suggested to overcome the problems for the sound fat residues reprocessing industry.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.42 no.4
• /
• pp.16-22
• /
• 2019

After Dantzig and Rasmer introduced Vehicle Routing Problem in 1959, this field has been studied with numerous approaches so far. Classical Vehicle Routing Problem can be described as a problem of multiple number of homogeneous vehicles sharing a same starting node and having their own routes to meet the needs of demand nodes. After satisfying all the needs, they go back to the starting node. In order to apply the real world problem, this problem had been developed with additional constraints and pick up & delivery model is one of them. To enhance the effectiveness of pick up & delivery, hub became a popular concept, which often helps reducing the overall cost and improving the quality of service. Lots of studies have suggested heuristic methods to realize this problem because it often becomes a NP-hard problem. However, because of this characteristic, there are not many studies solving this problem optimally. If the problem can be solved in polynomial time, optimal solution is the best option. Therefore, this study proposes a new mathematical model to solve this problem optimally, verified by a real world problem. The main improvements of this study compared to real world case are firstly, make drivers visit every nodes once except hub, secondly, make drivers visit every nodes at the right time, and thirdly, make drivers start and end their journey at their own homes.