• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.4
• /
• pp.45-60
• /
• 2005

We consider a vehicle routing problem with time window and dock capacity constraints (VRPTD). In most traditional models of vehicle routing problems with time window (VRPTW), each customer must be assigned to only one vehicle route. However demand of a customer may exceed the capacity of one vehicle, hence at least two vehicles may need to visit the customer We assume that each customer has Its own dock capacity. Hence, the customer can be served by only a limited number of vehicles simultaneously. Given a depot, customers, their demands, their time windows and dock capacities, VRPTD is to get a set of feasible routes which pass the depot and some customers such that all demands of each customer are satisfied Since VRPTD is NP-hard, a meta-heuristic algorithm is developed. The algorithm consists of two Procedures : the route construction procedure and the route scheduling procedure. We tested the algorithm on a number of instances and computational results are reported.

• Journal of Communications and Networks
• /
• v.16 no.2
• /
• pp.130-139
• /
• 2014

Due to the unpredictable nature of channel availability, carrying delay-sensitive traffic in cognitive radio networks (CRNs) is very challenging. Spectrum leasing of radio resources has been proposed in the so called coordinated CRNs to improve the quality of service (QoS) experienced by secondary users (SUs). In this paper, the performance of coordinated CRNs under fixed-rate with hard-delay-constraints traffic is analyzed. For the adequate and fair performance comparison, call admission control strategies with fractional channel reservation to prioritize ongoing secondary calls over new ones are considered. Maximum Erlang capacity is obtained by optimizing the number of reserved channels. Numerical results reveal that system performance strongly depends on the value of the mean secondary service time relative to the mean primary service time. Additionally, numerical results show that, in CRNs without spectrum leasing, there exists a critical utilization factor of the primary resources from which it is not longer possible to guarantee the required QoS of SUs and, therefore, services with hard delay constraints cannot be even supported in CRNs. Thus, spectrum leasing can be essential for CRN operators to provide the QoS demanded by fixed-rate applications with hard delay constraints. Finally, the cost per capacity Erlang as function of both the utilization factor of the primary resources and the maximum allowed number of simultaneously rented channels is evaluated.

• Management Science and Financial Engineering
• /
• v.12 no.1
• /
• pp.95-112
• /
• 2006

Disassembly scheduling is the problem of determining the quantity and timing of disassembling used or end-of-life products while satisfying the demand of their parts and/or components over a planning horizon. The case of assembly product structure is considered while the resource capacity constraints are explicitly considered. A cost-based objective is considered that minimizes the sum of disassembly operation and inventory holding costs. The problem is formulated as an integer programming model, and a two-stage heuristic with construction and improvement algorithms is suggested in this paper. To test the performance of the heuristic, computational experiments are done on randomly generated problems, and the results show that the heuristic gives near optimal solutions within a very short amount of computation time.

• Journal of Information Processing Systems
• /
• v.2 no.2
• /
• pp.88-94
• /
• 2006

In wireless cellular networks, previous researches on admission control policies and resource allocation algorithm considered the QoS (Quality of Service) in terms of CDP (Call Dropping Probability) and CBP (Call Blocking Probability). However, since the QoS was considered only within a predetermined cell capacity, the results indicated a serious overload problem of systems not guaranteeing both CDP and CBP constraints, especially in the hotspot cell. That is why a close interrelationship between CDP, CBP and cell capacity exists. Thus, it is indispensable to consider optimal cell capacity guaranteeing multiple QoS (CDP and CBP) at the time of initial cell planning for networks deployment. In this paper, we will suggest a distributed determination scheme of optimal cell capacity guaranteeing both CDP and CBP from a long-term perspective for initial cell planning. The cell-provisioning scheme is performed by using both the two-dimensional continuous-time Markov chain and an iterative method called the Gauss-Seidel method. Finally, numerical and simulation results will demonstrate that our scheme successfully determines an optimal cell capacity guaranteeing both CDP and CBP constraints for initial cell planning.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.8
• /
• pp.70-76
• /
• 2012

In this paper, we propose a power allocation scheme of the unlicensed user based on orthogonal frequency division multiplexing (OFDM) in the TV white space (TVWS). Power constraints in TVWS should be satisfied in the time domain. However, because OFDM has high PAPR (peak-to-average power ratio), it is difficult to satisfy power constraints of TVWS in the time domain. Furthermore, the conventional power allocation schemes cannot be generally applied to unlicensed user in TVWS. Therefore, we propose a power allocation scheme to satisfy power constraints of TVWS by reducing PAPR in the time domain. In addition, we analyze the capacity of the unlicensed user based on OFDM in a closed form. Based on the capacity analysis, as the number of subcarriers decreases, the capacity can be enhanced. In simulation results, we show that the capacity of the unlicensed user increases, as the number of subcarriers decreases and the mean of the channel between the transmitter and the receiver of the unlicensed user increases.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1983.10a
• /
• pp.108-111
• /
• 1983

This paper presents a new method for the optimum capacity assignment in store-and-forward communication networks under a total fixed-capacity constraints. Any two link capacities needed in this method can have the desirable quantites and then other capacities can be obtained from the fixed two link capacities. When the minimum and the maximum capacities that are the quantites of the conventional method are fixed, the total average time delay from the new method is almost the same as that from the conventional method. And when the minimum capacity is fixed, the new method gives smaller average time delay.

• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.3
• /
• pp.303-311
• /
• 2007

This study deals with a type of vehicle routing problem faced by manager of some department stores during peak sales periods. The problem is to find a set of traveling paths of vehicles that leave a department store and arrive at a destination specified for each vehicle after visiting customers without violating time and capacity constraints. The mathematical model is formulated with the objective of maximizing the sum of the rewards collected by each vehicle. Since the problem is known to be NP-hard, a heuristic algorithm is developed to find the solution. The performance of the algorithm is compared with the optimum solutions obtained from CPLEX for small size problems and a priority-based Genetic Algorithm for large size problems.

• Journal of Communications and Networks
• /
• v.13 no.5
• /
• pp.472-480
• /
• 2011

In this paper, we investigate two new candidate transmission schemes, non-orthogonal frequency reuse (NOFR) and beam-hopping (BH). They operate in different domains (frequency and time/space, respectively), and we want to know which domain shows overall best performance. We propose a novel formulation of the signal-to-interference plus noise ratio (SINR) which allows us to prove the frequency/time duality of these schemes. Further, we propose two novel capacity optimization approaches assuming per-beam SINR constraints in order to use the satellite resources (e.g., power and bandwidth) more efficiently. Moreover, we develop a general methodology to include technological constraints due to realistic implementations, and obtain the main factors that prevent the two technologies dual of each other in practice, and formulate the technological gap between them. The Shannon capacity (upper bound) and current state-of-the-art coding and modulations are analyzed in order to quantify the gap and to evaluate the performance of the two candidate schemes. Simulation results show significant improvements in terms of power gain, spectral efficiency and traffic matching ratio when comparing with conventional systems, which are designed based on uniform bandwidth and power allocation. The results also show that BH system turns out to show a less complex design and performs better than NOFR system specially for non-real time services.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2000.11a
• /
• pp.165-173
• /
• 2000

Analytic models have been developed to solve integrated production-distribution problems in supply chain management (SCM). As one of major constraints in analytic models, capacity, which is the total operation time in this paper has mostly been known or disregarded assuming infinite capacity. Also, as major factors, machine processing time to fabricate or assemble a part or product at a certain machine center in production system and vehicle processing time to deliver a product to a customer by a certain vehicle in distribution system have been fixed and regarded as a static factor, But in the real systems significant differences exit between capacity and the required time to achieve the production-distribution plan and between processing time and consumed time to process a part or product. In this paper, capacity and processing times in the analytic model are considered as dynamic factors and adjusted by the results from independently developed simulation model, which includes general production-distribution characteristics. Through experiments, we obtain the more realistic solutions reflecting stochastic natures by performing the iterative analytic-simulation procedure.

• Industrial Engineering and Management Systems
• /
• v.7 no.1
• /
• pp.57-65
• /
• 2008

Available-to-promise (ATP) exhibiting availability of manufacturing resources can be used to support customer order promising. Recently, one advanced function called Capable-to-promise (CTP) is provided by several modern APS (advanced planning system) that checks available capacity for placing new production orders or increasing already scheduled production orders. At the customer enquiry stage while considering the order delivery date and quantity to quote, both ATP and CTP are allocated to support order promising. In particular, current trends of mass customization and multi-side production chain derive several new constraints that should be considered when ATP/CTP allocation planning for order promising - such as customer's preference plants or material vendors, material compatibility, etc. Moreover, ATP/CTP allocation planning would be executed over a rolling time horizon. To utilize capacity and material manufacturing resource flexibly and fulfill more customer orders, ATP/CTP rolling planning should possess resource reallocation mechanism under the constraints of order quantities and delivery dates for all previous order promising. Therefore, to enhance order promising with reliability and flexibility to reallocate manufacturing resource, the ATP/CTP reallocation planning mechanism is needed in order to reallocate material and capacity resource for fulfilling all previous promised and new customer orders beneficially with considering new derived material and capacity constraints.