• 제목/요약/키워드: integer programming

검색결과 810건 처리시간 0.022초

An energy-efficiency approach for bidirectional amplified-and-forward relaying with asymmetric traffic in OFDM systems

  • Jia, Nianlong;Feng, Wenjiang;Zhong, Yuanchang;Kang, Hong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권11호
    • /
    • pp.4087-4102
    • /
    • 2014
  • Two-way relaying is an effective way of improving system spectral efficiency by making use of physical layer network coding. However, energy efficiency in OFDM-based bidirectional relaying with asymmetric traffic requirement has not been investigated. In this study, we focused on subcarrier transmission mode selection, bit loading, and power allocation in a multicarrier single amplified-and-forward relay system. In this scheme, each subcarrier can operate in two transmission modes: one-way relaying and two-way relaying. The problem is formulated as a mixed integer programming problem. We adopt a structural approximation optimization method that first decouples the original problem into two suboptimal problems with fixed subcarrier subsets and then finds the optimal subcarrier assignment subsets. Although the suboptimal problems are nonconvex, the results obtained for a single-tone system are used to transform them to convex problems. To find the optimal subcarrier assignment subsets, an iterative algorithm based on subcarrier ranking and matching is developed. Simulation results show that the proposed method can improve system performance compared with conventional methods. Some interesting insights are also obtained via simulation.

역물류를 고려한 통합 물류망 구축에 대한 모델 및 해법에 관한 연구 (Model and Algorithm for Logistics Network Integrating Forward and Reverse Flows)

  • 고현정;고창성;정기호
    • 한국경영과학회:학술대회논문집
    • /
    • 한국경영과학회 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.

  • PDF

Common Due-Date Assignment and Scheduling on Parallel Machines with Sequence-Dependent Setup Times

  • Kim, Jun-Gyu;Yu, Jae-Min;Lee, Dong-Ho
    • Management Science and Financial Engineering
    • /
    • 제19권1호
    • /
    • pp.29-36
    • /
    • 2013
  • This paper considers common due-date assignment and scheduling on parallel machines. The main decisions are: (a) deter-mining the common due-date; (b) allocating jobs to machines; and (c) sequencing the jobs assigned to each machine. The objective is to minimize the sum of the penalties associated with common due-date assignment, earliness and tardiness. As an extension of the existing studies on the problem, we consider sequence-dependent setup times that depend on the type of job just completed and on the job to be processed. The sequence-dependent setups, commonly found in various manufacturing systems, make the problem much more complicated. To represent the problem more clearly, a mixed integer programming model is suggested, and due to the complexity of the problem, two heuristics, one with individual sequence-dependent setup times and the other with aggregated sequence-dependent setup times, are suggested after analyzing the characteristics of the problem. Computational experiments were done on a number of test instances and the results are reported.

지형공간정보와 제원 특성을 적용한 대포병레이더 최적배치모형 (Optimal Allocation Model of Anti-Artillery Radar by Using ArcGIS and its Specifications)

  • 이문걸
    • 산업경영시스템학회지
    • /
    • 제41권2호
    • /
    • pp.74-83
    • /
    • 2018
  • It is very crucial activities that Korean army have to detect and recognize enemy's locations and types of weapon of their artillery firstly for effective operation of friendly force's artillery weapons during wartime. For these activities, one of the most critical artillery weapon systems is the anti-artillery radar (hereafter; radars) for immediate counter-fire operations against the target. So, in early wartime these radar's roles are very important for minimizing friendly force's damage because arbiters have to recognize a several enemy's artillery positions quickly and then to take an action right away. Up to date, Republic of Korea Army for tactical artillery operations only depends on individual commander's intuition and capability. Therefore, we propose these radars allocation model based on integer programming that combines ArcGIS (Geographic Information System) analysis data and each radar's performances which include allowable specific ranges of altitude, azimuth (FOV; field of view) and distances for target detection, and weapons types i.e., rocket, mortars and cannon ammo etc. And we demonstrate the effectiveness of their allocation's solution of available various types of radar asset through several experimental scenarios. The proposed model can be ensured the optimal detection coverage, the enhancement of artillery radar's operations and assisting a quick decision for commander finally.

소프트 제약을 포함하는 조립라인 밸런싱 문제 최적화 (Optimizing Assembly Line Balancing Problems with Soft Constraints)

  • 최성훈;이근철
    • 산업경영시스템학회지
    • /
    • 제41권2호
    • /
    • pp.105-116
    • /
    • 2018
  • In this study, we consider the assembly line balancing (ALB) problem which is known as an very important decision dealing with the optimal design of assembly lines. We consider ALB problems with soft constraints which are expected to be fulfilled, however they are not necessarily to be satisfied always and they are difficult to be presented in exact quantitative forms. In previous studies, most researches have dealt with hard constraints which should be satisfied at all time in ALB problems. In this study, we modify the mixed integer programming model of the problem introduced in the existing study where the problem was first considered. Based on the modified model, we propose a new algorithm using the genetic algorithm (GA). In the algorithm, new features like, a mixed initial population selection method composed of the random selection method and the elite solutions of the simple ALB problem, a fitness evaluation method based on achievement ratio are applied. In addition, we select the genetic operators and parameters which are appropriate for the soft assignment constraints through the preliminary tests. From the results of the computational experiments, it is shown that the proposed algorithm generated the solutions with the high achievement ratio of the soft constraints.

장주기 대용량 전력저장장치의 부하이전에 대한 실계통 적용 경제성 평가 연구 (An Economic Assessment of Large-scale Battery Energy Storage Systems in the Energy-Shift Application to Korea Power System)

  • 박종배;박용기;노재형;장병훈;윤용범
    • 전기학회논문지
    • /
    • 제64권3호
    • /
    • pp.384-392
    • /
    • 2015
  • This paper presents an economic assessment of large-scale Li-ion battery energy storage systems applied to Korean power system. There are many applications of the battery energy storage systems (BESSs) and they can provide various benefits to power systems. We consider BESSs to the energy time-shift application to Korean power system and evaluate the benefits from the application of BESS in the social perspective. The mixed integer programming (MIP) algorithm is used to resolve the optimal operation schedule of the BESS. The social benefits can include the savings of the fuel cost from generating units, deferral effects of the generation capacity, delay of transmission and distribution infra construction, and incremental CO2 emission cost impacts, etc. The economic evaluation of the BESS is separately applied into Korean power systems of the Main-land and Jeju island to reflect the differences of the load and generation patterns.

네트워크 기반 객체 지향형 영상 처리를 위한 MPEG 디코더 코어 설계 (Design of Core of MPEG Decoder for Object-Oriented Video on Network)

  • 박주현;김영민
    • 한국통신학회논문지
    • /
    • 제23권8호
    • /
    • pp.2120-2130
    • /
    • 1998
  • 본 논문은 네트워크를 기반으로 한 객제 지향형 영상 처리를 하는 프로그램이 가능한 MPEG 디코더 설계를 다룬다. 설계된 MPEG 디코더는 객체 지향형 프로그램을 지원할 수 있도록 스택 버퍼를 이용한 콘트롤러를 내장하고 있어서 객체에 기반한 영상 처리에 효과적이며, 소프트웨어 지향적인 영상 표준에 적용되도록 다양한 포맷의 입력 데이터 처리가 가능하다. 또한 벡터 연산부에서는 MPEG-4의 반화소 단위 처리와 고급 모드 보상(Compensation), 예측(Prediction)이 가능하며, SA(Shape Adaptive)-IDCT 가 가능하다. 또한 벡터 처리기 내에 절대값기, 반감기를 두어 인코더로 확장할 수 있도록 하였다. 설계 및 검증은 $0.6{\mu}{\textrm{m}}$ 5-Volt CMOS TLM(Three Layer Metal) COMPASS 라이브러리를 이용하였다.

  • PDF

비선형 분산안전법을 이용한 최적장기송전계률 알고리 (Optimal Long-term Transmission Planning Algorithm using Non-linear Branch-and-bound Method)

  • 박영문;신중린
    • 대한전기학회논문지
    • /
    • 제37권5호
    • /
    • pp.272-281
    • /
    • 1988
  • The problem of optimal transmission system planning is to find the most economical locations and time of transmission line construction under the various constraints such as available rights-of-way, finances, the technical characteristics of power system, and the reliability criterion of power supply, and so on. In this paper the constraint of right-of-way is represented as a finite set of available rights-of-way. And the constructed for a unit period. The electrical constraints are represented in terms of line overload and steady state stability margin. And the reliability criterion is dealt with the suppression of failure cost and with single-contingency analysis. In general, the transmission planning problem requires integer solutions and its objective function is nonlinear. In this paper the objective function is defined as a sum of the present values of construction cost and the minimum operating cost of power system. The latter is represented as a sum of generation cost and failure cost considering the change of yearly load, economic dispatch, and the line contingency. For the calculation of operating cost linear programming is adopted on the base of DC load flow calculation, and for the optimization of main objective function nonlinear Branch-and-Bound algorithm is used. Finally, for improving the efficiency of B & B algorithm a new sensitivity analysis algorithm is proposed.

로봇 산업의 다중 공급망 환경을 고려한 생산 및 분배 관리를 위한 유전 알고리듬 개발 (Development of Genetic Algorithm for Production and Distribution Management in Multiple Supplier Network Environment of Robot Engineering Industry)

  • 조성민;김태영;황승준
    • Journal of Information Technology Applications and Management
    • /
    • 제20권2호
    • /
    • pp.147-160
    • /
    • 2013
  • Today, the management environments of intelligence firm are changing the way of production planning and logistics management, and are changing the process of supply chain management system. This paper shows the development of information system software for intelligence enterprises is used in supply chain management for robot engineering industry. Specifically, supply chain management system in this paper has been developed to analyze the impact of multi plant and multi distribution environment, showing the process analysis and system development of hierarchical assembly manufacturing industry. In this paper we consider a production planning and distribution management system of intelligence firm in the supply chain. We focus on a capacitated production resource and distribution volume allocation problem, develop a mixed integer programming model, and propose an efficient heuristic procedure using a genetic algorithm to solve it efficiently. This method makes it possible for the population to reach the feasible approximate solution easily. The proposed regeneration procedures, which evaluate each infeasible chromosome, makes the solution converge to the feasible approximate solution quickly.

Software Pipeline-Based Partitioning Method with Trade-Off between Workload Balance and Communication Optimization

  • Huang, Kai;Xiu, Siwen;Yu, Min;Zhang, Xiaomeng;Yan, Rongjie;Yan, Xiaolang;Liu, Zhili
    • ETRI Journal
    • /
    • 제37권3호
    • /
    • pp.562-572
    • /
    • 2015
  • For a multiprocessor System-on-Chip (MPSoC) to achieve high performance via parallelism, we must consider how to partition a given application into different components and map the components onto multiple processors. In this paper, we propose a software pipeline-based partitioning method with cyclic dependent task management and communication optimization. During task partitioning, simultaneously considering computation load balance and communication optimization can cause interference, which leads to performance loss. To address this issue, we formulate their constraints and apply an integer linear programming approach to find an optimal partitioning result - one that requires a trade-off between these two factors. Experimental results on a reconfigurable MPSoC platform demonstrate the effectiveness of the proposed method, with 20% to 40% performance improvements compared to a traditional software pipeline-based partitioning method.