• Title/Summary/Keyword: Resource Search

Search Result 411, Processing Time 0.029 seconds

Generation of Pareto Sets based on Resource Reduction for Multi-Objective Problems Involving Project Scheduling and Resource Leveling (프로젝트 일정과 자원 평준화를 포함한 다목적 최적화 문제에서 순차적 자원 감소에 기반한 파레토 집합의 생성)

  • Jeong, Woo-Jin;Park, Sung-Chul;Yim, Dong-Soon
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.43 no.2
    • /
    • pp.79-86
    • /
    • 2020
  • To make a satisfactory decision regarding project scheduling, a trade-off between the resource-related cost and project duration must be considered. A beneficial method for decision makers is to provide a number of alternative schedules of diverse project duration with minimum resource cost. In view of optimization, the alternative schedules are Pareto sets under multi-objective of project duration and resource cost. Assuming that resource cost is closely related to resource leveling, a heuristic algorithm for resource capacity reduction (HRCR) is developed in this study in order to generate the Pareto sets efficiently. The heuristic is based on the fact that resource leveling can be improved by systematically reducing the resource capacity. Once the reduced resource capacity is given, a schedule with minimum project duration can be obtained by solving a resource-constrained project scheduling problem. In HRCR, VNS (Variable Neighborhood Search) is implemented to solve the resource-constrained project scheduling problem. Extensive experiments to evaluate the HRCR performance are accomplished with standard benchmarking data sets, PSPLIB. Considering 5 resource leveling objective functions, it is shown that HRCR outperforms well-known multi-objective optimization algorithm, SPEA2 (Strength Pareto Evolutionary Algorithm-2), in generating dominant Pareto sets. The number of approximate Pareto optimal also can be extended by modifying weight parameter to reduce resource capacity in HRCR.

An Application of Harmony Search Algorithm for Operational Cost Minimization of MicroGrid System (마이크로 그리드 운영비용 최소화를 위한 Harmony Search 알고리즘 응용)

  • Rhee, Sang-Bong;Kim, Kyu-Ho;Kim, Chul-Hwan
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.58 no.7
    • /
    • pp.1287-1293
    • /
    • 2009
  • This paper presents an application of Harmony Search (HM) meta-heuristic optimization algorithm for optimal operation of microgrid system. The microgrid system considered in this paper consists of a wind turbine, a diesel generator, and a fuel cell. An one day load profile which divided 20 minute data and wind resource for wind turbine generator were used for the study. In optimization, the HS algorithm is used for solving the problem of microgrid system operation which a various generation resources are available to meet the customer load demand with minimum operating cost. The application of HS algorithm to optimal operation of microgrid proves its effectiveness to determine optimally the generating resources without any differences of load mismatch and having its nature of fast convergency time as compared to other optimization method.

A Method of Clustering for SCOs in the SCORM (SCORM에서 SCO의 클러스터링 기법)

  • Yun, Hong-Won
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.12
    • /
    • pp.2230-2234
    • /
    • 2006
  • A SCO is a learning resource that is retrieved by a learner in the SCORM. A storage policy is required a learner to search SCOs rapidly in e-learning environment. In this paper, We define the mathematical formulation of clustering method for SCOs. Also we present criteria for cluster evaluation and describe procedure to evaluate each SCO. We show the search based on proposed clustering method increase performance than the existing search though performance evaluation.

Advanced Genetic Algrorithm Strategies in Optimal Design of Stiffened Composite Panels (보강된 복합재 패널의 최적설계를 위한 유전알고리듬의 연구)

  • Lee, Jong-Su
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.24 no.5 s.176
    • /
    • pp.1193-1202
    • /
    • 2000
  • The paper describes the use of genetic algorithms (GA's) to the minimum weight design of stiffened composite panels for buckling constraints. The proposed design problem is characterized by mixture of continuous and discrete design variables corresponding to panel elements and stacking sequence of laminates, respectively. Design space is multimodal and non-convex, thereby introducing the need for global search strategies. Advanced strategies in GA's such as directed crossover, multistage search and separated crossover are adopted to improve search ability and to save computational resource requirements. The paper explores the effectiveness of genetic algorithms and their advanced strategies in designing stiffened composite panels under various uniaxial compressive load conditions and the linrlit on stacking sequence of laminates.

Design of Internet Search Engine by Intelligent Agents on WWW

  • Nakano, Ryota;Noto, Masato
    • Proceedings of the IEEK Conference
    • /
    • 2000.07b
    • /
    • pp.699-702
    • /
    • 2000
  • The Internet has become widely used in many countries. In particular, a new emerging technology, the WWW (World Wide Web), which has become a major application of the Internet, has been rapidly developed. As a result, there are hundreds of millions of URLs (Uniform Resource Locators) on the WWW, and the total number of URLs is still explosively increasing. To get information from the WWW, we generally use Internet search engines. However, we cannot always get the actual information we want. Accordingly, we have solved this problem by constructing a prototype system based on agents by programming language Java for constructing a more effective search engine. This so-called “intelligent agent system on WWW” deletes redundant HTML (Hyper Text Markup Language) files and exchanges information about the existence of URLs. And we found that our prototype system is more powerful and effective than conventional search engines.

  • PDF

Design and Implement of E-textbook Authoring System Supporting Open Resource based on Original Contents Tracing Model (원본 추적 모델 기반의 오픈 리소스를 지원하는 강의 교재 저작 시스템의 설계 및 개발)

  • Choi, Ja-Ryoung;Lim, Soon-Bum
    • Journal of Korea Multimedia Society
    • /
    • v.19 no.3
    • /
    • pp.650-658
    • /
    • 2016
  • This study proposes web-based authoring system for the lecturers who published textbooks by inserting external open resource. When lecturer publishes textbooks, the system makes it easier to utilize external resources by providing an open resource pool that the lecturer can search not only his own resources but external resources. In addition, we designed an open resource pool based on Original Contents Tracing Model to check whether the scrapped resource is changed or not in the future. Open Resource Pool allows inserting text, images and videos by searching multimedia, and stores metadata for the follow-up management. We made the system to determine the change of the resource using the metadata stored in the tracking system. Through this research, we confirmed that it is possible to publish textbooks by utilizing a variety of open resources on the web and revise the book by tracing the scrapped resources.

Development of a Meta-Information System for Microbial Resources

  • Yu Jae-Woo;Chung Won-Hyong;Sohn Tae-Kwon;Park Yong-Ha;Kim Hong-Ik
    • Journal of Microbiology and Biotechnology
    • /
    • v.16 no.2
    • /
    • pp.178-183
    • /
    • 2006
  • Microbes are one of the most important bioresources in bioindustry and provide high economic values. Although there are currently about 6,000 bacterial species with validly published names, microbiologists generally assume that the number may account for less than 1% of the bacterial species present on Earth. To discover the remaining species, studies of metagenomes, metabolomes, and proteomes related to microbes have recently been carried out in various fields. We have constructed an information system that integrates various data on microbial resources and manages bioinformation to support efficient research of microorganisms. We have designated this system 'Bio-Meta Information System (Bio-MIS).' Bio-MIS consists of an integrated microbial resource database, a microbial resource input system, an integrated microbial resource search engine, a microbial resource online distribution system, a portal service, and management via the Internet. In the future, this system is expected to be connected with various public databases. We plan to implement useful bioinformatics software for analyzing microbial genome resources. The Web site is accessible at http://biomis.probionic.com.

A Cloud-Edge Collaborative Computing Task Scheduling and Resource Allocation Algorithm for Energy Internet Environment

  • Song, Xin;Wang, Yue;Xie, Zhigang;Xia, Lin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.6
    • /
    • pp.2282-2303
    • /
    • 2021
  • To solve the problems of heavy computing load and system transmission pressure in energy internet (EI), we establish a three-tier cloud-edge integrated EI network based on a cloud-edge collaborative computing to achieve the tradeoff between energy consumption and the system delay. A joint optimization problem for resource allocation and task offloading in the threetier cloud-edge integrated EI network is formulated to minimize the total system cost under the constraints of the task scheduling binary variables of each sensor node, the maximum uplink transmit power of each sensor node, the limited computation capability of the sensor node and the maximum computation resource of each edge server, which is a Mixed Integer Non-linear Programming (MINLP) problem. To solve the problem, we propose a joint task offloading and resource allocation algorithm (JTOARA), which is decomposed into three subproblems including the uplink transmission power allocation sub-problem, the computation resource allocation sub-problem, and the offloading scheme selection subproblem. Then, the power allocation of each sensor node is achieved by bisection search algorithm, which has a fast convergence. While the computation resource allocation is derived by line optimization method and convex optimization theory. Finally, to achieve the optimal task offloading, we propose a cloud-edge collaborative computation offloading schemes based on game theory and prove the existence of Nash Equilibrium. The simulation results demonstrate that our proposed algorithm can improve output performance as comparing with the conventional algorithms, and its performance is close to the that of the enumerative algorithm.

Competitive Resource Sharing Based on Game Theory in Cooperative Relay Networks

  • Zhang, Guopeng;Cong, Li;Zhao, Liqiang;Yang, Kun;Zhang, Hailin
    • ETRI Journal
    • /
    • v.31 no.1
    • /
    • pp.89-91
    • /
    • 2009
  • This letter considers the problem of resource sharing among a relay and multiple user nodes in cooperative transmission networks. We formulate this problem as a sellers' market competition and use a noncooperative game to jointly consider the benefits of the relay and the users. We also develop a distributed algorithm to search the Nash equilibrium, the solution of the game. The convergence of the proposed algorithm is analyzed. Simulation results demonstrate that the proposed game can stimulate cooperative diversity among the selfish user nodes and coordinate resource allocation among the user nodes effectively.

  • PDF