• Title/Summary/Keyword: Strategy Programming

Search Result 292, Processing Time 0.026 seconds

An Optimization Algorithm for the Two-Echelon Capacitated Facility Location Problem (용량 제약이 있는 이계층 설비 입지선정 문제의 최적화 해법)

  • Kim Eun Jeong;Gang Dong Hwan;Lee Gyeong Sik;Park Seong Su
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2003.05a
    • /
    • pp.137-144
    • /
    • 2003
  • We consider Two-echelon Single source Capacitated Facility Location Problem (TSCFLP). TSCFLP is a variant or Capacitated Facility Location Problem (CFLP). which has been an important issue in boa academic and industrial aspects. Given a set or possible facility locations in two echelons (warehouse / plant), a set or customers, TSCFLP is a decision problem to find a set or facility locations to open and to determine an allocation schedule that satisfies the demands or the customers and the capacity constraints or the facilities, while minimizing the overall cost. It ran be shown that TSCFLP Is strongly NP-hard For TSCFLf, few algorithms are known. which are heuristics. We propose a disaggregated version or the standard mixed integer programming formulation or TSCFLP We also provide a class or valid Inequalities Branch-and-price algorithm with rutting plane method Is used to find an optimal solution Efficient branching strategy compatible with subproblem optimization problems Is also provided. We report computational results or tests on 15 randomly generated instances.

  • PDF

Development of A System Optimum Traffic Control Strategy with Cell Transmission Model (Cell Transmission 이론에 근거한 시스템최적 신호시간산정)

  • 이광훈;신성일
    • Journal of Korean Society of Transportation
    • /
    • v.20 no.5
    • /
    • pp.193-206
    • /
    • 2002
  • A signal optimization model is proposed by applying the Cell-Transmission Model(CTM) as an embedded traffic flow model to estimate a system-optimal signal timing plan in a transportation network composed of signalized intersections. Beyond the existing signal-optimization models, the CTM provides appropriate theoretical and practical backgrounds to simulate oversaturation phenomena such as shockwave, queue length, and spillback. The model is formulated on the Mixed-Integer Programming(MIP) theory. The proposed model implies a system-optimal in a sense that traffic demand and signal system cooperate to minimize the traffic network cost: the demand departing from origins through route choice behavior until arriving at destinations and the signal system by calculating optimal signal timings considering the movement of these demand. The potential of model's practical application is demonstrated through a comparison study of two signal control strategies: optimal and fixed signal controls.

A Multi-Objective Differential Evolution for Just-In-Time Door Assignment and Truck Scheduling in Multi-door Cross Docking Problems

  • Wisittipanich, Warisa;Hengmeechai, Piya
    • Industrial Engineering and Management Systems
    • /
    • v.14 no.3
    • /
    • pp.299-311
    • /
    • 2015
  • Nowadays, the distribution centres aim to reduce costs by reducing inventory and timely shipment. Cross docking is a logistics strategy in which products delivered to a distribution centre by inbound trucks are directly unloaded and transferred to outbound trucks with minimum warehouse storage. Moreover, on-time delivery in a distribution network becomes very crucial especially when several distribution centres and customers are involved. Therefore, an efficient truck scheduling is needed to synchronize the delivery throughout the network in order to satisfy all stake-holders. This paper presents a mathematical model of a mixed integer programming for door assignment and truck scheduling in a multiple inbound and outbound doors cross docking problem according to Just-In-Time concept. The objective is to find the schedule of transhipment operations to simultaneously minimize the total earliness and total tardiness of trucks. Then, a multi-objective differential evolution (MODE) is proposed with an encoding scheme and four decoding strategies, called ITSH, ITDD, OTSH and OTDD, to find a Pareto frontier for the multi-door cross docking problems. The performances of MODE are evaluated using 15 generated instances. The numerical experiments demonstrate that the proposed algorithm is capable of finding a set of diverse and high quality non-dominated solutions.

Output-error state-space identification of vibrating structures using evolution strategies: a benchmark study

  • Dertimanis, Vasilis K.
    • Smart Structures and Systems
    • /
    • v.14 no.1
    • /
    • pp.17-37
    • /
    • 2014
  • In this study, four widely accepted and used variants of Evolution Strategies (ES) are adapted and applied to the output-error state-space identification problem. The selection of ES is justified by prior strong indication of superior performance to similar problems, over alternatives like Genetic Algorithms (GA) or Evolutionary Programming (EP). The ES variants that are being tested are (i) the (1+1)-ES, (ii) the $({\mu}/{\rho}+{\lambda})-{\sigma}$-SA-ES, (iii) the $({\mu}_I,{\lambda})-{\sigma}$-SA-ES, and (iv) the (${\mu}_w,{\lambda}$)-CMA-ES. The study is based on a six-degree-of-freedom (DOF) structural model of a shear building that is characterized by light damping (up to 5%). The envisaged analysis is taking place through Monte Carlo experiments under two different excitation types (stationary / non-stationary) and the applied ES are assessed in terms of (i) accurate modal parameters extraction, (ii) statistical consistency, (iii) performance under noise-corrupted data, and (iv) performance under non-stationary data. The results of this suggest that ES are indeed competitive alternatives in the non-linear state-space estimation problem and deserve further attention.

An Efficient Incremental Maintenance of SPJ Materialized Views (SPJ 실체화 뷰의 효율적인 점진적 관리 기법)

  • Lee, Ki-Yong;Son, Jin-Hyun;Kim, Myoung-Ho
    • The KIPS Transactions:PartD
    • /
    • v.13D no.6 s.109
    • /
    • pp.797-806
    • /
    • 2006
  • In the data warehouse environment, materialized views are typically used to support efficient query processing. Materialized views need to be updated when source data change. Since the update of the views need impose a significant overhead, it is essential to update the views efficiently. Though various view maintenance strategies have been discussed in the past, the efficient maintenance of SPJ materialized views has not been sufficiently investigated. In this paper, we propose an efficient incremental view maintenance method for SPJ materialized views that minimizes the total accesses to data sources. The proposed method finds an optimal view maintenance strategy using a dynamic programming algorithm. We also present various experimental results that shows the efficiency of our proposed method.

A Modified Approach to Density-Induced Support Vector Data Description

  • Park, Joo-Young;Kang, Dae-Sung
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.7 no.1
    • /
    • pp.1-6
    • /
    • 2007
  • The SVDD (support vector data description) is one of the most well-known one-class support vector learning methods, in which one tries the strategy of utilizing balls defined on the feature space in order to distinguish a set of normal data from all other possible abnormal objects. Recently, with the objective of generalizing the SVDD which treats all training data with equal importance, the so-called D-SVDD (density-induced support vector data description) was proposed incorporating the idea that the data in a higher density region are more significant than those in a lower density region. In this paper, we consider the problem of further improving the D-SVDD toward the use of a partial reference set for testing, and propose an LMI (linear matrix inequality)-based optimization approach to solve the improved version of the D-SVDD problems. Our approach utilizes a new class of density-induced distance measures based on the RSDE (reduced set density estimator) along with the LMI-based mathematical formulation in the form of the SDP (semi-definite programming) problems, which can be efficiently solved by interior point methods. The validity of the proposed approach is illustrated via numerical experiments using real data sets.

A Study on the Technology Transfer Efficiency for Public Institutes Using DEA Model (DEA 모형을 이용한 공공연구기관의 기술이전 효율성 분석에 관한 연구)

  • Hyon, Man-Sok;Yoo, Wang-Jin
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.31 no.2
    • /
    • pp.94-103
    • /
    • 2008
  • This study measured technology transfer efficiency for public institutes. The study made use of DEA being one of the non-parametric linear programming to evaluate technology transfer efficiency for public institutes and to measure technology efficiency, pure technical efficiency and scale efficiency. The measurement of the technology transfer efficiency for public institutes was as follows: The cause of the technology transfer inefficiency was affected by pure technical inefficiency more than by scale inefficiency. Public institutes' RTS(Return To Scale) value varied depending upon the features of the organizations than the features of the regions. Public research institutes' RTS value is more effective than universities' RTS value. We compared the RTS group with the RTS of Projected DMU groups. The RTS group had constant returns to scale effect while the RTS of the Projected DMU had increasing returns to scale effect. The technology transfer efficiency of public institutes varied depending upon the features of the organizations and regions : The technology transfer efficiency of public institutes were as follows : public research institutes at the metropolitan area, public research institutes at the local areas, universities at the metropolitan area and universities at the local areas. In other words, the technology transfer efficiency was affected by organizational characteristics more than by regional characteristics at the place where public institutes were located.

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

  • Jo, Sung-Min;Kim, Tai-Young;Hwang, Seung-June
    • Journal of Information Technology Applications and Management
    • /
    • v.20 no.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.

Simulation of fracture in plain concrete modeled as a composite material

  • Bui, Thanh T.;Attard, Mario M.
    • Computers and Concrete
    • /
    • v.2 no.6
    • /
    • pp.499-516
    • /
    • 2005
  • A composite model is used to represent the heterogeneity of plain concrete consisting of coarse aggregates, mortar matrix and the mortar-aggregate interface. The composite elements of plain concrete are modeled using triangular finite element units which have six interface nodes along the sides. Fracture is captured through a constitutive single branch softening-fracture law at the interface nodes, which bounds the elastic domain inside each triangular unit. The inelastic displacement at an interface node represents the crack opening or sliding displacement and is conjugate to the internodal force. The path-dependent softening behaviour is developed within a quasi-prescribed displacement control formulation. The crack profile is restricted to the interface boundaries of the defined mesh. No re-meshing is carried out. Solutions to the rate formulation are obtained using a mathematical programming procedure in the form of a linear complementary problem. An event by event solution strategy is adopted to eliminate solutions with simultaneous formation of softening zones in symmetric problems. The composite plain concrete model is compared to experimental results for the tensile crack growth in a Brazilian test and three-point bending tests on different sized specimens. The model is also used to simulate wedge-type shear-compression failure directly under the loading platen of a Brazilian test.

Optimal cross-section and configuration design of cyclic loaded elastic-plastic structures

  • Valido, Anibal J.;Sousa, Luis G.;Cardoso, J. Barradas
    • Structural Engineering and Mechanics
    • /
    • v.4 no.1
    • /
    • pp.25-35
    • /
    • 1996
  • This paper describes a continuum variational formulation for design optimization of nonlinear structures in the elastic-plastic domain, where unloading and reloading of the structures are allowed to occur. The Total Lagrangian procedure is used for the description of the structural deformation. The direct differentiation approach is used to derive the sensitivities of the various structural response measures with respect to the design parameters. Since the material goes into the inelastic range and unloading and reloading of the structure are allowed to occur, the structural response is path dependent and an additional step is needed to integrate the constitutive equations. It can be shown, consequently, that design sensitivity analysis is also path-dependent. The theory has been discretized by the finite element technique and implemented in a structural analysis code. Mathematical programming approach is used for the optimization process. Numerical applications on trusses are performed, where cross-sectional areas and nodal point coordinates are treated as design variables. Optimal designs have been obtained and compared by using two different strategies: a two level strategy where the levels are defined accordingly the type of design variables, cross sectional areas or node coordinates, and optimizing simultaneously with respect to both types of design variables.