• 산업공학
• /
• 제17권spc호
• /
• pp.141-151
• /
• 2004

As today's business environment has become more and more competitive, forward as well as backward flows of products among members belonging to a supply chain have been increased. The backward flows of products, which are common in most industries, result from increasing amount of products that are returned, recalled, or need to be repaired. Effective management for the backward flows of products has become an important issue for businesses because of opportunities for simultaneously enhancing profitability and customer satisfaction from returned products. Since third party logistics service providers (3PLs) are playing an important role in reverse logistics operations, they should perform two simultaneous logistics operations for a number of different clients who want to improve their logistics operations for both forward and reverse flows. In this case, distribution networks have been independently designed with respect to either forward or backward flows so far. This paper proposes a mixed integer programming model for the design of network integrating both forward and reverse logistics. Since the network design problem belongs to a class of NP-hard problems, we present an efficient heuristic algorithm based on genetic algorithm (GA), of which the performance is compared to the lower bound by Lagrangian relaxation. Finally, the validity of proposed algorithm is tested using numerical examples.

• 전기학회논문지
• /
• 제56권7호
• /
• pp.1309-1314
• /
• 2007

The assignment of cells to reporting or non-reporting cells is an NP-hard problem having an exponential complexity in the Reporting Cell Location Management (RCLM) system. Frequent location update may result in degradation of quality of service due to interference. Miss on the location of a mobile terminal will necessitate a search operation on the network when a call comes in. The number of reporting cells and which cell must be reporting cell should be determined to balance the registration (location update) and search (paging) operations to minimize the cost of RCLM system. T1is paper compares Max-Min ant system (MMAS), rank-based ant system (RAS) and hybrid method of MMAS and RAS that generally used to solve combinatorial optimization problems. Experimental results demonstrate that hybrid method of MMAS and RAS is an effective and competitive approach in fairly satisfactory results with respect to solution quality and execution time for the optimal design of location management system.

• Industrial Engineering and Management Systems
• /
• 제13권4호
• /
• pp.383-397
• /
• 2014

Reverse logistics network design issues have been popularly discussed in recent years. However, few papers in the past literature have been dedicated to incentive effect on return quantity of used products. The purpose of this study is to formulate a dynamic nonlinear programming model of reverse logistics network design with the aim of managing the used products allocation by coordinating the collection centers and recovery facilities to warrant economic efficiency. In the optimization model, a fuzzy approach is applied to interpret the relationship between the rate of return and the suggested incentives. Due to funding constraints in setting up the collection centers, this work considers these centers as multi-capacity levels, which can be opened or closed at different periods. In view of the fact that the problem is known as NP-hard, we propose a heuristic method based on tabu search procedure to solve the presented model. Finally, several dominance properties of optimal solutions are demonstrated in comparison with the results of a state-of-the-art commercial solver.

• 대한산업공학회지
• /
• 제37권4호
• /
• pp.390-399
• /
• 2011

Generally the life-cycle cost of complex systems composed of several sub systems or equipments such as train, aircraft weapon systems is spent much more during operation and maintenance phase than development phase. The maintenance cost for maintaining the availability and extending the life span of systems comprise a large proportion of systems operation cost. The cycle of preventive maintenance affects operation and maintenance cost a lot. In this study we introduce a way minimizing life-cycle cost of systems by calculating more reliable preventive maintenance period than the results of previous study using systems reliability data considered the reliability and failure effect ratio of sub-systems or components. We can solve the preventive maintenance period problem known as NP-Hard as quick as possible by using modified genetic algorithm than using other models introduced in previous study.

• 한국멀티미디어학회논문지
• /
• 제9권1호
• /
• pp.119-126
• /
• 2006

멀티 프로세서 시스템에서 스케쥴링은 매우 중요한 부분이지만, 최적의 해를 구하는 것이 복잡하여 최근 다양한 휴리스틱 방법들에 의한 스케쥴링 알고리즘들이 제안되고 있다. 본 논문에서는 유전 알고리즘을 이용한 새로운 스케쥴링 알고리즘을 제시한다. 또한, 해를 구하는 과정에서 시뮬레이티드 어닐링 (simulated annealing)의 확률을 이용하여 유전 알고리즘의 성능을 개선시킨다. 제시된 알고리즘은 태스크들의 최종 수행 완료 시간 (makespan)을 최소화하는 것을 목표로 한다. 모의 실험을 통하여 제시된 알고리즘이 다른 알고리즘보다 최종 수행 완료 시간이 작음을 확인할 수 있었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권9호
• /
• pp.4301-4319
• /
• 2017

Adopting mobile chargers (MC) in rechargeable wireless sensors network (R-WSN) to recharge sensors can increase network efficiency (e.g., reduce MC travel distance per tour, reduce MC effort, and prolong WSN lifetime). In this study, we propose a mechanism to split the sensing field into partitions that may be equally spaced but differ in distance to the base station. Moreover, we focus on minimizing the MC effort by providing a new charging mechanism called the sector-based charging schedule (SBCS), which works to dispatch the MC in charging trips to the sector that sends many charging requests and suggesting an efficient sensor-charging algorithm. Specifically, we first utilize the high ability of the BS to divide the R-WSN field into sectors then it select the cluster head for each sector to reduce the intra-node communication. Second, we formulate the charging productivity as NP-hard problem and then conduct experimental simulations to evaluate the performance of the proposed mechanism. An extensive comparison is performed with other mechanisms. Experimental results demonstrate that the SBCS mechanism can prolong the lifetime of R-WSNs by increasing the charging productivity about 20% and reducing the MC effort by about 30%.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2004년도 추계학술대회 및 정기총회
• /
• pp.375-388
• /
• 2004

As today's business environment has become more and more competitive, forward as well as backward flows of products among members belonging to a supply chain have been increased. The backward flows of products, which are common in most industries, result from increasing amount of products that are returned, recalled, or need to be repaired. Effective management for these backward flows of products has become an important issue for businesses because of opportunities for simultaneously enhancing profitability and customer satisfaction from returned products. Since third party logistics service providers (3PLs) are playing an important role in reverse logistics operations, the 3PLs should perform two simultaneous logistics operations for a number of different clients who want to improve their logistics operations for both forward and reverse flows. In this case, distribution networks have been independently designed with respect to either forward or backward flows so far. This paper proposes a mixed integer programming model for the design of network integrating both forward and reverse logistics. Since this network design problem belongs to a class of NP-hard problems, we present an efficient heuristic based on Lagrangean relaxation and apply it to numerical examples to test the validity of proposed heuristic.

• 한국경영과학회지
• /
• 제40권4호
• /
• pp.145-156
• /
• 2015

Incorporation of individual learning and forgetting behaviors within worker-task assignment models produces a mixed integer nonlinear program (MINLP) problem, which is difficult to solve as a NP hard due to its nonlinearity in the objective function. Previous studies commonly assume homogeneity among workers in workforce scheduling that takes account of learning and forgetting characteristics. This paper expands previous researches by considering heterogeneous individual learning/forgetting, and investigates the impact of worker heterogeneity in initial expertise, steady-state productivity, learning and forgetting on system performance to assist manager's decision-making in worker-task assignments without tackling complex MINLP models. In order to understand the performance implications of workforce heterogeneity, this paper examines analytically how heterogeneity in each of the four parameters of the exponential learning and forgetting (L/F) model affects system performance in three cases : consecutive assignments with no break, n breaks of s-length each, and total b break-periods occurred over T periods. The study presents the direction of change in worker performance under different assignment schedules as the variance in initial expertise, steady-state productivity, learning or forgetting increases. Thus, it implies whether having more heterogenous workforce in terms of each of four parameters in the L/F model is desired or not in different schedules from the perspective of system productivity measurement.

• Journal of Communications and Networks
• /
• 제18권3호
• /
• pp.493-501
• /
• 2016

In-network storage is an effective technique for avoiding network congestion and reducing power consumption in continuous data collection in wireless sensor networks. In recent years, network coding based storage design has been proposed as a means to achieving ubiquitous access that permits any query to be satisfied by a few random (nearby) storage nodes. To maintain data consistency in continuous data collection applications, the readings of a sensor over time must be sent to the same set of storage nodes. In this paper, we present an efficient approach to updating data at storage nodes to maintain data consistency at the storage nodes without decoding out the old data and re-encoding with new data. We studied a transmission strategy that identifies a set of storage nodes for each source sensor that minimizes the transmission cost and achieves ubiquitous access by transmitting sparsely using the sparse matrix theory. We demonstrate that the problem of minimizing the cost of transmission with coding is NP-hard. We present an approximation algorithm based on regarding every storage node with memory size B as B tiny nodes that can store only one packet. We analyzed the approximation ratio of the proposed approximation solution, and compared the performance of the proposed coding approach with other coding schemes presented in the literature. The simulation results confirm that significant performance improvement can be achieved with the proposed transmission strategy.

• Journal of Information Processing Systems
• /
• 제13권4호
• /
• pp.1000-1013
• /
• 2017

Clustering is a NP-hard problem that is used to find the relationship between patterns in a given set of patterns. It is an unsupervised technique that is applied to obtain the optimal cluster centers, especially in partitioned based clustering algorithms. On the other hand, cat swarm optimization (CSO) is a new meta-heuristic algorithm that has been applied to solve various optimization problems and it provides better results in comparison to other similar types of algorithms. However, this algorithm suffers from diversity and local optima problems. To overcome these problems, we are proposing an improved version of the CSO algorithm by using opposition-based learning and the Cauchy mutation operator. We applied the opposition-based learning method to enhance the diversity of the CSO algorithm and we used the Cauchy mutation operator to prevent the CSO algorithm from trapping in local optima. The performance of our proposed algorithm was tested with several artificial and real datasets and compared with existing methods like K-means, particle swarm optimization, and CSO. The experimental results show the applicability of our proposed method.