• Title/Summary/Keyword: solution upper bounds

Search Result 48, Processing Time 0.024 seconds

Integrated Inventory-Distribution Planning in a (1 : N) Supply Chain System with Heterogeneous Vehicles Incorporated

  • Kim, Eun-Seok;Lee, Ik-Sun
    • Management Science and Financial Engineering
    • /
    • v.17 no.2
    • /
    • pp.1-21
    • /
    • 2011
  • This paper considers an integrated inventory-distribution system with a fleet of heterogeneous vehicles employed where a single warehouse distributes a single type of products to many spatially distributed retailers to satisfy their dynamic demands. The problem is to determine order planning at the warehouse, and also vehicle schedules and delivery quantities for the retailers with the objective of minimizing the sum of ordering cost at the warehouse, inventory holding cost at both the warehouse and retailers, and transportation cost. For the problem, we give a Mixed Integer Programming formulation and develop a Lagrangean heuristic procedure for computing lower and upper bounds on the optimal solution value. The Lagrangean dual problem of finding the best Lagrangrean lower bound is solved by subgradient optimization. Computational experiments on randomly generated test problems showed that the suggested algorithm gives relatively good solutions in a reasonable amount of computation time.

BPN Based Approximate Optimization for Constraint Feasibility (구속조건의 가용성을 보장하는 신경망기반 근사최적설계)

  • Lee, Jong-Soo;Jeong, Hee-Seok;Kwak, No-Sung
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2007.04a
    • /
    • pp.141-144
    • /
    • 2007
  • Given a number of training data, a traditional BPN is normally trained by minimizing the absolute difference between target outputs and approximate outputs. When BPN is used as a meta-model for inequality constraint function, approximate optimal solutions are sometimes actually infeasible in a case where they are active at the constraint boundary. The paper describes the development of the efficient BPN based meta-model that enhances the constraint feasibility of approximate optimal solution. The modified BPN based meta-model is obtained by including the decision condition between lower/upper bounds of a constraint and an approximate value. The proposed approach is verified through a simple mathematical function and a ten-bar planar truss problem.

  • PDF

A Perceptually-Adaptive High-Capacity Color Image Watermarking System

  • Ghouti, Lahouari
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.1
    • /
    • pp.570-595
    • /
    • 2017
  • Robust and perceptually-adaptive image watermarking algorithms have mainly targeted gray-scale images either at the modeling or embedding levels despite the widespread availability of color images. Only few of the existing algorithms are specifically designed for color images where color correlation and perception are constructively exploited. In this paper, a new perceptual and high-capacity color image watermarking solution is proposed based on the extension of Tsui et al. algorithm. The $CIEL^*a^*b^*$ space and the spatio-chromatic Fourier transform (SCFT) are combined along with a perceptual model to hide watermarks in color images where the embedding process reconciles between the conflicting requirements of digital watermarking. The perceptual model, based on an emerging color image model, exploits the non-uniform just-noticeable color difference (NUJNCD) thresholds of the $CIEL^*a^*b^*$ space. Also, spread-spectrum techniques and semi-random low-density parity check codes (SR-LDPC) are used to boost the watermark robustness and capacity. Unlike, existing color-based models, the data hiding capacity of our scheme relies on a game-theoretic model where upper bounds for watermark embedding are derived. Finally, the proposed watermarking solution outperforms existing color-based watermarking schemes in terms of robustness to standard image/color attacks, hiding capacity and imperceptibility.

Approximate Calculation of Order Fill Rate under Purchase Dependence (구매종속성을 고려한 주문충족률의 근사적 계산)

  • Park, Changkyu
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.40 no.4
    • /
    • pp.137-146
    • /
    • 2017
  • For the competitive business environment under purchase dependence, this paper proposes a new approximate calculation of order fill rate which is a probability of satisfying a customer order immediately using the existing inventory. Purchase dependence is different to demand dependence. Purchase dependence treats the purchase behavior of customers, while demand dependence considers demand correlation between items, between regions, or over time. Purchase dependence can be observed in such areas as marketing, manufacturing systems, and distribution systems. Traditional computational methods have a difficulty of the curse of dimensionality for the large cases, when deriving the stationary joint distribution which is utilized to calculate the order fill rate. In order to escape the curse of dimensionality and protect the solution from diverging for the large cases, we develop a greedy iterative search algorithm based on the Gauss-Seidel method. We show that the greedy iterative search algorithm is a dependable algorithm to derive the stationary joint distribution of on-hand inventories in the retailer system by conducting a comparison analysis of a greedy iterative search algorithm with the simulation. In addition, we present some managerial insights such as : (1) The upper bound of order fill rate can be calculated by the one-item pure system, while the lower bound can be provided by the pure system that consists of all items; (2) As the degree of purchase dependence declines while other conditions remain same, it is observed that the difference between the lower and upper bounds reduces, the order fill rate increases, and the order fill rate gets closer to the upper bound.

Optimal Design of Nonsequential Batch-Storage Network (비순차 회분식 공정-저장조 망구조 최적 설계)

  • 이경범;이의수
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.9 no.5
    • /
    • pp.407-412
    • /
    • 2003
  • An effective methodology is .reported for determining the optimal capacity (lot-size) of batch processing and storage networks which include material recycle or reprocessing streams. We assume that any given storage unit can store one material type which can be purchased from suppliers, be internally produced, internally consumed and/or sold to customers. We further assume that a storage unit is connected to all processing stages that use or produce the material to which that storage unit is dedicated. Each processing stage transforms a set of feedstock materials or intermediates into a set of products with constant conversion factors. The objective for optimization is to minimize the total cost composed of raw material procurement, setup and inventory holding costs as well as the capital costs of processing stages and storage units. 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 storage inventory hold-up. The expressions for the Kuhn-Tucker conditions of the optimization problem can be reduced to two subproblems. The first yields analytical solutions for determining batch sizes while the second is a separable concave minimization network flow subproblem whose solution yields the average material flow rates through the networks. For the special case in which the number of storage is equal to the number of process stages and raw materials storage units, a complete analytical solution for average flow rates can be derived. The analytical solution for the multistage, strictly sequential batch-storage network case can also be obtained via this approach. The principal contribution of this study is thus the generalization and the extension to non-sequential networks with recycle streams. An illustrative example is presented to demonstrate the results obtainable using this approach.

On the Method of Rankine Source Distribution for Free Surface Flow Problem: Radiation Condition and Influence of Finite Distribution (자유표면문제해석(자유표면문제해석)을 위한 Rankine용출점(湧出點) 분포법(分布法) -방사조건(放射條件)과 유한분포(有限分布)의 영향-)

  • Chang-Sup,Lee;Seung-Il,Yang;Chang-Gu,Kang
    • Bulletin of the Society of Naval Architects of Korea
    • /
    • v.19 no.2
    • /
    • pp.13-18
    • /
    • 1982
  • The method of Rankine source distribution is emerging as a powerful yet simple alternative for the solution of complicated free surface problems. But it has been uncertain whether the radiation condition could be satisfied exactly by distributing the simple sources on the free surface only. In this paper, it is proved rigorously that the Rankine sources, whose intensities are varying sinusoidally along the axis satisfying the free surface boundary condition, generate the radiation waves both in the infinite and finite-depth flows. A formula is derived to give the upper and lower bounds of the errors in the induced velocity computation that will be introduced by truncating the extent of source distribution on the free surface. Since the truncation is inevitable in the numerical analysis, this formula may be used as a criterion to limit the position of the field points, where velocity computation is made, away from the truncation boundary. A typical analysis shows that the maximum error will be 3.4 percent of the exact induced velocity when the field point is on the free surface two wave lengths away from the truncation boundary.

  • PDF

Minimum dynamic response of cantilever beams supported by optimal elastic springs

  • Aydin, Ersin
    • Structural Engineering and Mechanics
    • /
    • v.51 no.3
    • /
    • pp.377-402
    • /
    • 2014
  • In this study, optimal distribution of springs which supports a cantilever beam is investigated to minimize two objective functions defined. The optimal size and location of the springs are ascertained to minimize the tip deflection of the cantilever beam. Afterwards, the optimization problem of springs is set up to minimize the tip absolute acceleration of the beam. The Fourier Transform is applied on the equation of motion and the response of the structure is defined in terms of transfer functions. By using any structural mode, the proposed method is applied to find optimal stiffness and location of springs which supports a cantilever beam. The stiffness coefficients of springs are chosen as the design variables. There is an active constraint on the sum of the stiffness coefficients and there are passive constraints on the upper and lower bounds of the stiffness coefficients. Optimality criteria are derived by using the Lagrange Multipliers. Gradient information required for solution of the optimization problem is analytically derived. Optimal designs obtained are compared with the uniform design in terms of frequency responses and time response. Numerical results show that the proposed method is considerably effective to determine optimal stiffness coefficients and locations of the springs.

Optimization of ride comfort for a three-axle vehicle equipped with interconnected hydro-pneumatic suspension system

  • Saglam, Ferhat;Unlusoy, Y. Samim
    • Advances in Automotive Engineering
    • /
    • v.1 no.1
    • /
    • pp.1-20
    • /
    • 2018
  • The aim of this study is the optimization of the parameters of interconnected Hydro-Pneumatic (HP) suspension system of a three-axle vehicle for ride comfort and handling. For HP suspension systems of equivalent vertical stiffness and damping characteristics, interconnected HP suspension systems increase roll and pitch stiffness and damping characteristics of the vehicle as compared to unconnected HP suspension systems. Thus, they result in improved handling and braking/acceleration performances of the vehicle. However, increased roll and pitch stiffness and damping characteristics also increase roll and pitch accelerations, which in turn result in degraded ride comfort performance. Therefore, in order to improve both ride comfort and vehicle handling performances simultaneously, an optimum parameter set of an interconnected HP suspension system is obtained through an optimization procedure. The objective function is formed as the sum of the weighted vertical accelerations according to ISO 2631. The roll angle, one of the important measures of vehicle handling and driving safety, is imposed as a constraint in the optimization study. Upper and lower parameter bounds are used in the optimization in order to get a physically realizable parameter set. Optimization procedure is implemented for a three-axle vehicle with unconnected and interconnected suspension systems separately. Optimization results show that interconnected HP suspension system results in improvements in both ride comfort and vehicle handling performance, as compared to the unconnected suspension system. As a result, interconnected HP suspension systems present a solution to the conflict between ride comfort and vehicle handling which is present in unconnected suspension systems.

Energy Efficient Wireless Sensor Networks Using Linear-Programming Optimization of the Communication Schedule

  • Tabus, Vlad;Moltchanov, Dmitri;Koucheryavy, Yevgeni;Tabus, Ioan;Astola, Jaakko
    • Journal of Communications and Networks
    • /
    • v.17 no.2
    • /
    • pp.184-197
    • /
    • 2015
  • This paper builds on a recent method, chain routing with even energy consumption (CREEC), for designing a wireless sensor network with chain topology and for scheduling the communication to ensure even average energy consumption in the network. In here a new suboptimal design is proposed and compared with the CREEC design. The chain topology in CREEC is reconfigured after each group of n converge-casts with the goal of making the energy consumption along the new paths between the nodes in the chain as even as possible. The new method described in this paper designs a single near-optimal Hamiltonian circuit, used to obtain multiple chains having only the terminal nodes different at different converge-casts. The advantage of the new scheme is that for the whole life of the network most of the communication takes place between same pairs of nodes, therefore keeping topology reconfigurations at a minimum. The optimal scheduling of the communication between the network and base station in order to maximize network lifetime, given the chosen minimum length circuit, becomes a simple linear programming problem which needs to be solved only once, at the initialization stage. The maximum lifetime obtained when using any combination of chains is shown to be upper bounded by the solution of a suitable linear programming problem. The upper bounds show that the proposed method provides near-optimal solutions for several wireless sensor network parameter sets.

Alternative Design of Mega Structural Members of a Super-tall Building using 800MPa Grade High-performance Steel Plate (800MPa급 고성능 강재 적용한 초고층 메가 부재 대안설계)

  • Cho, So Hoon;Kim, Do Hwan;Kim, Jin Won;Lee, Seung Eun;Kim, Jin Ho
    • Journal of Korean Society of Steel Construction
    • /
    • v.26 no.4
    • /
    • pp.299-309
    • /
    • 2014
  • HSA800 is a new high strength steel (HSS) plate for building structures developed by POSCO and RIST in 2011. It has upper and lower bounds for yield ($F_y$) and tensile ($F_u$) strength as of 650-770MPa and 800-950MPa, respectively, with yield ratio ($F_y/F_u$) limit as of 0.85 which make steel quality more reliable and enhance the seismic resistance of structures. As made by TMCP, it has a good weldability without increasing carbon percentage. The objective of this study is to provide alternative design of mega-structural members of the Lotte World Tower (555m, 123 story), a first super-tall building in Korea, using HSS considering structural safety, constructability, and cost-effectiveness. Steel outrigger trusses, belt-trusses and steel exterior columns were selected and analyzed to evaluate the structural performance between original and alternative designs using HSS. The results show that HSS can be applied to the members which do not affect lateral stiffness of a building and, in this study, approximately 1100tons of steel were saved. It implies that HSS can save overall construction costs - manufacturing, delivery, and erection costs - by reducing mega structural member size. HSA800 was very first applied to the Lotte World Tower based on the results of this study.