• 제목/요약/키워드: Order Allocation

검색결과 870건 처리시간 0.032초

Auction based Task Reallocation in Multiagent Systems

  • Lee, Sang G.;Kim, In C.
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2001년도 ICCAS
    • /
    • pp.149.3-149
    • /
    • 2001
  • Task allocation is a key problem in multiagent systems. The importance of automated negotiation protocols for solving the task allocation problem is increasing as a consequence of increased multi-agent applications. In this paper, we introduce the multiagent Traveling Salesman Problem(TSP) as an example of task reallocation problem, and suggest Vickery auction as an inter-agent coordination mechanism for solving this problem. In order to apply this market-based coordination mechanism into multiagent TSPs, we define the profit of each agent, the ultimate goal of negotiation, cities to be traded out through auctions, the bidding strategy, and the order of auctions. The primary advantage of such approach is that it can find an optimal task allocation ...

  • PDF

자동차부품산업에서 공급사슬경영을 위한 공급자 선정.관리 및 주문량 배분에 관한 연구 (Strategic Selection and Management of Suppliers, and Allocation of Order Quantity for Supply Chain Management in Automotive Parts Manufacturers)

  • 장길상;김재균
    • 산업경영시스템학회지
    • /
    • 제32권3호
    • /
    • pp.142-158
    • /
    • 2009
  • The supplier selection problem is perhaps the most important component of the purchasing function. Some of the common and influential criteria in the selection of a supplier include quality, price, delivery, and service. These evaluation criteria often conflict, however, and it is frequently impossible to find a supplier that excels in all areas. In addition, some of the criteria are quantitative and some are qualitative. Thus, a methodology is needed that can capture both subjective and objective evaluation measures. The Analytic Hierarchy Process(AHP) is a decision-making method for ranking alternative courses of action when multiple criteria must be considered. This paper proposes the AHP-based approach which can structure the supplier selection process and the achievements-based procedure which can allocate order quantities for the selected suppliers In automotive part manufacturers. Also, through the practical case of 'D' automotive part manufacturing company, we shows that the proposed AHP based supplier selection approach and the achievements-based allocation procedure of order quantity can be successfully applied for supplier selection and order quantity allocation problems.

레지스터 재활용 사슬의 체계적 생성 (A Systematic Generation of Register-Reuse Chains)

  • 이혁재
    • 대한전기학회논문지:전력기술부문A
    • /
    • 제48권12호
    • /
    • pp.1564-1574
    • /
    • 1999
  • In order to improve the efficiency of optimizing compilers, integration of register allocation and instruction scheduling has been extensively studied. One of the promising integration techniques is register allocation based on register-reuse chains. However, the generation of register-reuse chains in the previous approach was not completely systematic and consequently it creates unnecessarily dependencies that restrict instruction scheduling. This paper proposes a new register allocation technique based on a systematic generation of register-reuse chains. The first phase of the proposed technique is to generate register-reuse chains that are optimal in the sense that no additional dependencies are created. Thus, register allocation can be done without restricting instruction scheduling. For the case when the optimal register-reuse chains require more than available registers, the second phase reduces the number of required registers by merging the register-reuse chains. Chain merging always generates additional dependencies and consequently enforces the execution order of instructions. A heuristic is developed for the second phase in order to reduce additional dependencies created by merging chains. For matrix multiplication program, the number of registers resulting from the first phase is small enough to fit into available registers for most basic blocks. In addition, it is shown that the restriction to instruction scheduling is reduced by the proposed merging heuristic of the second phase.

  • PDF

A Performance Index for Time Slot Allocation in Link-16 Relative Navigation System

  • Lee, Jin Hyuk;Lee, Ju Hyun;Noh, Jae Hee;Lim, Deok Won;Park, Chansik;Lee, Sang Jeong
    • Journal of Positioning, Navigation, and Timing
    • /
    • 제6권3호
    • /
    • pp.117-123
    • /
    • 2017
  • In this paper, we propose a performance index that can compare the position estimation performance according to the time slot allocation order, which is superior in the position estimation performance in the operation of the Link-16 based relative navigation system. In order to verify the validity of the performance index, a software-based Link-16 relative navigation system performance analysis platform composed of a signal generator, a signal reception and navigation algorithm execution unit, and a performance analysis unit was designed. Using the designed software platform, we analyzed the relationship between proposed performance index and position estimation performance according to time slot allocation order in the same position reference (PR) arrangement. The performance index of the proposed time slot allocation is expected to be utilized not only for the Link-16 system, but also for the Time Division Multiple Access (TDMA)-based navigation system.

Optimal Relay Selection and Power Allocation in an Improved Low-Order-Bit Quantize-and-Forward Scheme

  • Bao, Jianrong;He, Dan;Xu, Xiaorong;Jiang, Bin;Sun, Minhong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권11호
    • /
    • pp.5381-5399
    • /
    • 2016
  • Currently, the quantize-and-forward (QF) scheme with high order modulation and quantization has rather high complexity and it is thus impractical, especially in multiple relay cooperative communications. To overcome these deficiencies, an improved low complex QF scheme is proposed by the combination of the low order binary phase shift keying (BPSK) modulation and the 1-bit and 2-bit quantization, respectively. In this scheme, the relay selection is optimized by the best relay position for best bit-error-rate (BER) performance, where the relays are located closely to the destination node. In addition, an optimal power allocation is also suggested on a total power constraint. Finally, the BER and the achievable rate of the low order 1-bit, 2-bit and 3-bit QF schemes are simulated and analyzed. Simulation results indicate that the 3-bit QF scheme has about 1.8~5 dB, 4.5~7.5 dB and 1~2.5 dB performance gains than those of the decode-and-forward (DF), the 1-bit and 2-bit QF schemes, at BER of $10^{-2}$, respectively. For the 2-bit QF, the scheme of the normalized Source-Relay (S-R) distance with 0.9 has about 5dB, 7.5dB, 9dB and 15dB gains than those of the distance with 0.7, 0.5, 0.3 and 0.1, respectively, at BER of $10^{-3}$. In addition, the proposed optimal power allocation saves about 2.5dB much more relay power on an average than that of the fixed power allocation. Therefore, the proposed QF scheme can obtain excellent features, such as good BER performance, low complexity and high power efficiency, which make it much pragmatic in the future cooperative communications.

수중 셀룰러 통신 네트워크에서 백홀 자원분배 프로토콜에 관한 연구 (Backhaul Resource Allocation Protocol for Underwater Cellular Communication Networks)

  • 윤창호;박종원;최수한
    • 한국통신학회논문지
    • /
    • 제42권2호
    • /
    • pp.393-402
    • /
    • 2017
  • 육상의 셀룰러 네트워크와 같이 수중에서도 기지국을 통해 유입되는 트래픽 양에 따라 적응적으로 기지국의 백홀 자원을 할당하여 전체 네트워크 자원을 효율적으로 관리할 수 있는 수중 셀룰러 통신 네트워크가 필요하다. 본 논문에서는 수중 셀룰러 통신 네트워크에서 기지국에 유입되는 트래픽에 비례하여 기지국의 백홀 자원을 할당하는 자원분배 프로토콜을 제안한다. 자원분배 프로토콜은 자원을 할당하는 주기에 따라 고정주기 방식과 적응주기 방식으로 분류된다. 더 효율적인 자원분배 프로토콜을 결정하기 위해 모의시험을 이용하여 고정주기 방식과 적응주기 방식의 수신율, 메시지 오버헤드, 전송지연 성능을 비교하고 분석하였다. 그 결과, 고정주기 방식이 적응주기 방식에 비해 최대 수백 배 이상의 전송지연이 증가하였으며, 수백 배 이상의 메시지 오버헤드가 더 발생하여 모든 성능 지표에서 적응주기 방식이 고정주기 방식보다 성능이 우수함을 확인하였다.

Fairness-insured Aggressive Sub-channel Allocation and Efficient Power Allocation Algorithms to Optimize the Capacity of an IEEE 802.16e OFDMA/TDD Cellular System

  • Ko, Sang-Jun;Chang, Kyung-Hi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제3권4호
    • /
    • pp.385-398
    • /
    • 2009
  • This paper aims to find a suitable solution to joint allocation of sub-channel and transmit power for multiple users in an IEEE 802.16e OFDMA/TDD cellular system. We propose the FASA (Fairness insured Aggressive Sub-channel Allocation) algorithm, which is a dynamic channel allocation algorithm that considers all of the users' channel state information conditionally in order to maximize throughput while taking into account fairness. A dynamic power allocation algorithm, i.e., an improved CHC algorithm, is also proposed in combination with the FASA algorithm. It collects the extra downlink transmit power and re-allocates it to other potential users. Simulation results show that the joint allocation scheme with the improved CHC power allocation algorithm provides an additional increase of sector throughput while simultaneously enhancing fairness. Four frames of time delay for CQI feedback and scheduling are considered. Furthermore, by addressing the difference between uplink and downlink scheduling in an IEEE 802.16e OFDMA TDD system, we can employ the uplink channel information directly via channel sounding, resulting in more accurate uplink dynamic resource allocation.

반 정량적 리스크 저감 요소를 고려한 철도 승강장 스크린 도어시스템의 안전 무결성 수준 할당 (Allocation of Safety Integrity Level for Railway Platform Screen Door System considering Semi-Quantitative Risk Reduction Factor)

  • 송기태;이성일
    • 한국안전학회지
    • /
    • 제31권4호
    • /
    • pp.156-163
    • /
    • 2016
  • There exists required safety integrity level (SIL) to assure safety in accordance with international standards for every electrical / electronics / control equipment or systems with safety related functions. The SIL is allocated from lowest level (level 0) to highest level (level 4). In order to guarantee certain safety level that is internationally acceptable, application of methodology for SIL allocation and demonstration based on related international standards is required. However, the theoretical and practical study for safety integrity level is barely under way in the domestic railway industry. This research studied not only the global process of SIL allocation to guarantee safety in accordance with international standards for safety related equipment and system, but the quantitative methodology based on international standard and the semi-quantitative methodology as alternative way for SIL allocation. Specifically, the systematic SIL allocation for platform screen door system of railway is studied applying the semi-quantitative methodology in order to save much time and effort compared to quantitative method.

Power Allocation Framework for OFDMA-based Decode-and-Forward Cellular Relay Networks

  • Farazmand, Yalda;Alfa, Attahiru S.
    • Journal of Communications and Networks
    • /
    • 제16권5호
    • /
    • pp.559-567
    • /
    • 2014
  • In this paper, a framework for power allocation of downlink transmissions in orthogonal frequency division multiple access-based decode-and-forward cellular relay networks is investigated. We consider a system with a single base station communicating with multiple users assisted by multiple relays. The relays have limited power which must be divided among the users they support in order to maximize the data rate of the whole network. Advanced power allocation schemes are crucial for such networks. The optimal relay power allocation which maximizes the data rate is proposed as an upper bound, by finding the optimal power requirement for each user based on knapsack problem formulation. Then by considering the fairness, a new relay power allocation scheme, called weighted-based scheme, is proposed. Finally, an efficient power reallocation scheme is proposed to efficiently utilize the power and improve the data rate of the network. Simulation results demonstrate that the proposed power allocation schemes can significantly improve the data rate of the network compared to the traditional scheme.

차기유도무기의 최적배치에 관한 모형 (An Optimal Allocation Model for SAM-X)

  • 김승빈;전건욱
    • 한국국방경영분석학회지
    • /
    • 제30권1호
    • /
    • pp.48-69
    • /
    • 2004
  • An optimal allocation model for SAM-X by using a set covering model is suggested. This allocation model considers to guarantee the maximum security of vital areas from the attack of enemy aircraft(s) and missiles. In order to formulate this model, we applied the concept of parallel structure reliability to set covering model. This model gives both direction of the primary target line and location of the facility. When applied this model to the real situation, the solution of this model can be used to the references of decision making for the optimal military facility allocation.