• Title/Summary/Keyword: network optimization

Search Result 2,239, Processing Time 0.034 seconds

Optimal Design Of Batch-Storage Network with Financial Transactions and Cash Flows (현금흐름을 포함하는 회분식 공정-저장조 망구조의 최적설계)

  • ;Lee, Euy-Soo;Lee, In-Beom;Yi, Gyeong-Beom
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.11 no.11
    • /
    • pp.956-962
    • /
    • 2005
  • This paper presents an integrated analysis of production and financing decisions. We assume that a cash storage unit is installed to manage the cash flows related with production activities such as raw material procurement, process operating setup, Inventory holding cost and finished product sales. Temporarily financial investments are allowed for more profit. The production plant is modeled by the Batch-Storage Network with Recycle Streams in Yi and Reklaitis (2003). The objective function of the optimization is minimizing the opportunity costs of annualized capital investment and cash/material inventory while maximizing stockholder's benefit. No depletion of all the material and cash storage units is major constraints of the optimization. A novel production and inventory analysis formulation, the PSW(Periodic Square Wave) model, provides useful expressions for the upper/lower bounds and average level of the cash and material inventory holdups. The expressions for the Kuhn-Tucker conditions of the optimization problem can be reduced to two subproblems and analytical lot sizing equations under a mild assumption about the cash flow pattern of stockholder's dividend. The first subproblem is a separable concave minimization network flow problem whose solution yields the average material flow rates through the networks. The second subproblem determines the decisions about financial Investment. Finally, production and financial transaction lot sizes and startup times can be determined by analytical expressions as far as the average flow rates are calculated. The optimal production lot and storage sizes considering financial factors are smaller than those without such consideration. An illustrative example is presented to demonstrate the results obtainable using this approach.

An Improvement of the P2P Streaming Network Topology Algorithm Using Link Information (연결 정보를 이용한 P2P 스트리밍 네트워크 구조의 개선)

  • Lee, Sang-Hoon;Han, Chi-Geun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.5
    • /
    • pp.49-57
    • /
    • 2012
  • In P2P streaming management, peer's churning and finding efficient topology architecture optimization algorithm that reduces streaming delay is important. This paper studies a topology optimization algorithm based on the P2P streaming using peer's link information. The proposed algorithm is based on the estimation of peer's upload bandwidth using peer's link information on mesh-network. The existing algorithm that uses the information of connected links is efficient to reduce message overload in the point of resource management. But it has a risk of making unreliable topology not considering upload bandwidth. And when some network error occurs in a server-closer-peer, it may make the topology worse. In this paper we propose an algorithm that makes up for the weak point of the existing algorithm. We compare the existing algorithm with the proposed algorithm using test data and analyze each simulation result.

Optimization Numeral Recognition Using Wavelet Feature Based Neural Network. (웨이브렛 특징 추출을 이용한 숫자인식 의 최적화)

  • 황성욱;임인빈;박태윤;최재호
    • Proceedings of the Korea Institute of Convergence Signal Processing
    • /
    • 2003.06a
    • /
    • pp.94-97
    • /
    • 2003
  • In this Paper, propose for MLP(multilayer perception) neural network that uses optimization recognition training scheme for the wavelet transform and the numeral image add to noise, and apply this system in Numeral Recognition. As important part of original image information preserves maximum using the wavelet transform, node number of neural network and the loaming convergence time did size of input vector so that decrease. Apply in training vector, examine about change of the recognition rate as optimization recognition training scheme raises noise of data gradually. We used original image and original image added 0, 10, 20, 30, 40, 50㏈ noise (or the increase of numeral recognition rate. In case of test image added 30∼50㏈, numeral recognition rate between the original image and image added noise for training Is a little But, in case of test image added 0∼20㏈ noise, the image added 0, 10, 20, 30, 40 , 50㏈ noise is used training. Then numeral recognition rate improved 9 percent.

  • PDF

Stochastic Optimization of Multipath TCP for Energy Minimization and Network Stability over Heterogeneous Wireless Network

  • Arain, Zulfiqar Arain;Qiu, Xuesong;Zhong, Lujie;Wang, Mu;Chen, Xingyan;Xiong, Yongping;Nahida, Kiran;Xu, Changqiao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.1
    • /
    • pp.195-215
    • /
    • 2021
  • Multipath Transport Control Protocol (MPTCP) is a transport layer protocol that enables multiple TCP connections across various paths. Due to path heterogeneity, it incurs more energy in a multipath wireless network. Recent work presents a set of approaches described in the literature to support systems for energy consumption in terms of their performance, objectives and address issues based on their design goals. The existing solutions mainly focused on the primary system model but did not discourse the overall system performance. Therefore, this paper capitalized a novel stochastically multipath scheduling scheme for data and path capacity variations. The scheduling problem formulated over MPTCP as a stochastic optimization, whose objective is to maximize the average throughput, avoid network congestion, and makes the system more stable with greater energy efficiency. To design an online algorithm that solves the formulated problem over the time slots by considering its mindrift-plus penalty form. The proposed solution was examined under extensive simulations to evaluate the anticipated stochastic optimized MPTCP (so-MPTCP) outcome and compared it with the base MPTCP and the energy-efficient MPTCP (eMPTCP) protocols. Simulation results justify the proposed algorithm's credibility by achieving remarkable improvements, higher throughput, reduced energy costs, and lower-end to end delay.

An Algorithm based on Evolutionary Computation for a Highly Reliable Network Design (높은 신뢰도의 네트워크 설계를 위한 진화 연산에 기초한 알고리즘)

  • Kim Jong-Ryul;Lee Jae-Uk;Gen Mituso
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.4
    • /
    • pp.247-257
    • /
    • 2005
  • Generally, the network topology design problem is characterized as a kind of NP-hard combinatorial optimization problem, which is difficult to solve with the classical method because it has exponentially increasing complexity with the augmented network size. In this paper, we propose the efficient approach with two phase that is comprised of evolutionary computation approach based on Prufer number(PN), which can efficiently represent the spanning tree, and a heuristic method considering 2-connectivity, to solve the highly reliable network topology design problem minimizing the construction cost subject to network reliability: firstly, to find the spanning tree, genetic algorithm that is the most widely known type of evolutionary computation approach, is used; secondly, a heuristic method is employed, in order to search the optimal network topology based on the spanning tree obtained in the first Phase, considering 2-connectivity. Lastly, the performance of our approach is provided from the results of numerical examples.

Research on Data-Flow Optimization and Advanced Application Research on KREONET (국가과학기술연구망에서의 첨단연구 적용과 데이터흐름 최적화모델 연구)

  • Noh, Minki;Lee, Chankyun;Jang, Minseok;Seok, Woojin
    • KNOM Review
    • /
    • v.22 no.2
    • /
    • pp.1-11
    • /
    • 2019
  • The paradigm of science and technology and R&D system changes from the existing form of independent research to community research which transmits and stores large-capacity data generated from observation and experiment to the research site through a high-speed network. Network-dependent advanced research is improves form of collaboration, sharing, globalization. For this purpose, not only the integration of science and IT technology, but also the optimized network infrastructure and technology for real-time sharing of the enormous data is necessary. This paper explains the direction of change through the case of KREONET's network-dependent advanced research and analyzes the technology and network resources supported in each research field. Through this, we propose a network optimization model for each advanced research field with the main data flow and satisfy the network required performance by advanced applications on KREONET.

Service ORiented Computing EnviRonment (SORCER) for deterministic global and stochastic aircraft design optimization: part 1

  • Raghunath, Chaitra;Watson, Layne T.;Jrad, Mohamed;Kapania, Rakesh K.;Kolonay, Raymond M.
    • Advances in aircraft and spacecraft science
    • /
    • v.4 no.3
    • /
    • pp.297-316
    • /
    • 2017
  • With rapid growth in the complexity of large scale engineering systems, the application of multidisciplinary analysis and design optimization (MDO) in the engineering design process has garnered much attention. MDO addresses the challenge of integrating several different disciplines into the design process. Primary challenges of MDO include computational expense and poor scalability. The introduction of a distributed, collaborative computational environment results in better utilization of available computational resources, reducing the time to solution, and enhancing scalability. SORCER, a Java-based network-centric computing platform, enables analyses and design studies in a distributed collaborative computing environment. Two different optimization algorithms widely used in multidisciplinary engineering design-VTDIRECT95 and QNSTOP-are implemented on a SORCER grid. VTDIRECT95, a Fortran 95 implementation of D. R. Jones' algorithm DIRECT, is a highly parallelizable derivative-free deterministic global optimization algorithm. QNSTOP is a parallel quasi-Newton algorithm for stochastic optimization problems. The purpose of integrating VTDIRECT95 and QNSTOP into the SORCER framework is to provide load balancing among computational resources, resulting in a dynamically scalable process. Further, the federated computing paradigm implemented by SORCER manages distributed services in real time, thereby significantly speeding up the design process. Part 1 covers SORCER and the algorithms, Part 2 presents results for aircraft panel design with curvilinear stiffeners.

Service ORiented Computing EnviRonment (SORCER) for deterministic global and stochastic aircraft design optimization: part 2

  • Raghunath, Chaitra;Watson, Layne T.;Jrad, Mohamed;Kapania, Rakesh K.;Kolonay, Raymond M.
    • Advances in aircraft and spacecraft science
    • /
    • v.4 no.3
    • /
    • pp.317-334
    • /
    • 2017
  • With rapid growth in the complexity of large scale engineering systems, the application of multidisciplinary analysis and design optimization (MDO) in the engineering design process has garnered much attention. MDO addresses the challenge of integrating several different disciplines into the design process. Primary challenges of MDO include computational expense and poor scalability. The introduction of a distributed, collaborative computational environment results in better utilization of available computational resources, reducing the time to solution, and enhancing scalability. SORCER, a Java-based network-centric computing platform, enables analyses and design studies in a distributed collaborative computing environment. Two different optimization algorithms widely used in multidisciplinary engineering design-VTDIRECT95 and QNSTOP-are implemented on a SORCER grid. VTDIRECT95, a Fortran 95 implementation of D. R. Jones' algorithm DIRECT, is a highly parallelizable derivative-free deterministic global optimization algorithm. QNSTOP is a parallel quasi-Newton algorithm for stochastic optimization problems. The purpose of integrating VTDIRECT95 and QNSTOP into the SORCER framework is to provide load balancing among computational resources, resulting in a dynamically scalable process. Further, the federated computing paradigm implemented by SORCER manages distributed services in real time, thereby significantly speeding up the design process. Part 1 covers SORCER and the algorithms, Part 2 presents results for aircraft panel design with curvilinear stiffeners.

Meta-model Effects on Approximate Multi-objective Design Optimization of Vehicle Suspension Components (차량 현가 부품의 근사 다목적 설계 최적화에 대한 메타모델 영향도)

  • Song, Chang Yong;Choi, Ha-Young;Byon, Sung-Kwang
    • Journal of the Korean Society of Manufacturing Process Engineers
    • /
    • v.18 no.3
    • /
    • pp.74-81
    • /
    • 2019
  • Herein, we performed a comparative study on approximate multi-objective design optimization, to realize a structural design to improve the weight and vibration performances of the knuckle - a car suspension component - considering various load conditions and vibration characteristics. In the approximate multi-objective optimization process, a regression meta-model was generated using the response surfaces method (RSM), while Kriging and back-propagation neural network (BPN) methods were applied for interpolation meta-modeling. The Pareto solutions, multi-objective optimal solutions, were derived using the non-dominated sorting genetic algorithm (NSGA-II). In terms of the knuckle design considered in this study, the characteristics and influence of the meta-model on multi-objective optimization were reviewed through a comparison of the approximate optimization results with the meta-models and the actual optimization.

Improved AP Deployment Optimization Scheme Based on Multi-objective Particle Swarm Optimization Algorithm

  • Kong, Zhengyu;Wu, Duanpo;Jin, Xinyu;Cen, Shuwei;Dong, Fang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.4
    • /
    • pp.1568-1589
    • /
    • 2021
  • Deployment of access point (AP) is a problem that must be considered in network planning. However, this problem is usually a NP-hard problem which is difficult to directly reach optimal solution. Thus, improved AP deployment optimization scheme based on swarm intelligence algorithm is proposed to research on this problem. First, the scheme estimates the number of APs. Second, the multi-objective particle swarm optimization (MOPSO) algorithm is used to optimize the location and transmit power of APs. Finally, the greedy algorithm is used to remove the redundant APs. Comparing with multi-objective whale swarm optimization algorithm (MOWOA), particle swarm optimization (PSO) and grey wolf optimization (GWO), the proposed deployment scheme can reduce AP's transmit power and improves energy efficiency under different numbers of users. From the experimental results, the proposed deployment scheme can reduce transmit power about 2%-7% and increase energy efficiency about 2%-25%, comparing with MOWOA. In addition, the proposed deployment scheme can reduce transmit power at most 50% and increase energy efficiency at most 200%, comparing with PSO and GWO.