• Management Science and Financial Engineering
• /
• v.19 no.2
• /
• pp.19-29
• /
• 2013

Refuse collection network design, one of major decision problems in reverse logistics, is the problem of locating collection points and allocating refuses at demand points to the opened collection points. As an extension of the previous models, we consider capacity and maximum allowable distance constraints at each collection point. In particular, the maximum allowable distance constraint is additionally considered to avoid the impractical solutions in which collection points are located too closely. Also, the additional distance constraint represents the physical distance limit between collection and demand points. The objective is to minimize the sum of fixed costs to open collection points and variable costs to transport refuses from demand to collection points. After formulating the problem as an integer programming model, we suggest an optimal branch and bound algorithm that generates all feasible solutions by a simultaneous location and allocation method and curtails the dominated ones using the lower bounds developed using the relaxation technique. Also, due to the limited applications of the optimal algorithm, we suggest two heuristics. To test the performances of the algorithms, computational experiments were done on a number of test instances, and the results are reported.

• Management Science and Financial Engineering
• /
• v.14 no.2
• /
• pp.45-66
• /
• 2008

Refuse collection, one of important elements in reverse logistics, is an activity rendering recyclables or wastes and moving them to some points where further treatment is required. Among various decisions in the collection activity, we focus on network design, which is the problem of locating collection points as well as allocating refuses at demand points to collection points while satisfying the capacity restriction at each collection point. Here, the collection point is the place where recyclables or wastes near the point are gathered, and locating the collection points is done by selecting them from a given set of potential sites. The objective is to minimize the sum of fixed costs to open collection points and transportation costs to move refuses from demand points to collection points. An integer programming model is developed to represent the problem mathematically and due to the complexity of the problem, two types of heuristics, one with simultaneous and the others with separate location and allocation, are suggested. Computational experiments were done on test problems up to 500 potential sites, and the results are reported. In particular, some heuristics gave near optimal solutions for small-size test problems, i.e., 2% gaps in average from the optimal solution values.

• The Journal of Fisheries Business Administration
• /
• v.50 no.4
• /
• pp.1-9
• /
• 2019

Seaweed by-products have been dumped into the sea and induced marine pollution. However, they can be recycled as a valuable natural resources. Approximately 240,000 tons of sea mustard and kelp by-products were estimated to be producted during the last three years. The estimate corresponds 6.7% of the total production of marine aquaculture and 14.9% of the total production of seaweeds. When adding up the by-products from fish and mollusks, approximately 1,000,000 tons of fisheries by-products were thrown out into the sea every year. A three-step strategy is required for the industralization of fisheries by-products. The first step is the construction of the processing foundation of by-products, the second is its food industralization, and the third is its recycling as raw biomaterials. The stable supply of raw materials is the prerequisite for the industralization. Thus, it is necessary to construct the refuse logistics around chief production districts and to build the processing facility and frozen storage of by-products. Cooperation among private enterprises and government investment for research and development is required the second and third steps.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.33 no.1
• /
• pp.41-50
• /
• 2010

본 논문에서는 수명이 다한 제품이나 소비자가 더 이상 사용하지 않는 폐기품을 다시 재사용하거나 폐기하는데 필요한 일련의 활동을 위한 역방향 로지스틱스에서의 수거망 설계 문제를 다루고 있다. 수거망 설계 문제는 수거지점의 위치와 수요지의 폐기품을 수거 지점에 할당하는 것을 결정하는 문제로 정의할 수 있으며 수거지점은 재활용품이나 폐기품이 위치한 지점 근처에 위치하고 주어진 잠재적인 위치를 중에서 결정하게 된다. 여기서, 각 수거지점은 용량제약이 있어 수거 지점에 할당되는 폐기품의 양에는 제한이 있다. 본 논문에서 다루는 수거망 설계문제에서는 수거지점을 설치하는데 필요한 고정비용과 수요지와 수거지점간의 수송비용의 합을 최소화하는 것을 목적으로 한다. 또한 대상문제를 보다 명확히 설명하기 위하여 징수계획법을 이용한 수리적 모형을 제안하였으며 문제의 복잡도 인하여 타부 서치와 시뮬레이티드 어닐링 두 가지 형태의 탐색기법을 제안하였다. 이들 탐색기법에 대하여 최대 500개의 잠재적 위치를 가지는 문제에 대하여 실험을 수행하였고 실험결과를 제시하였다.

• Journal of Korean Society of Environmental Engineers
• /
• v.38 no.5
• /
• pp.219-227
• /
• 2016

As the largest source of food waste is housing, and the food waste properties are good enough to recycle, the proactive approach to conventional food waste disposal is highly regarded. This research is to examine food waste management in the Seoul Metropolitan Area (SMA) and non-SMA and to analyze the public inclination to disseminate zero-food waste system (ZFWS) with fermentation and extinction technology in multifamily housing estates. The self-administered questionnaire survey was conducted and the collected data were statistically analyzed. The main findings are summarized as follows: food waste in multifamily housing estates were retrieved by refuse truck and largely recycled for compost and forage. Also, many local governments were in favor of ZFWS, and unwilling to invest in it due to financial constraint. It's found that logistics of ZFWS is likely to be influenced by important features such as a considerable amount of cost saving, effective energy recovery, and efficient operation/management.