• Title/Summary/Keyword: Heuristic Procedure

Search Result 204, Processing Time 0.019 seconds

Efficient heuristic of vehicle routing problem for container shuttle service (컨테이너 셔틀 서비스를 위한 차랑 경로 문제의 근사적 해법)

  • Shin, Jae-Young;Oh, Sung-Inn;Park, Jong-Won
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2009.06a
    • /
    • pp.171-172
    • /
    • 2009
  • Generally, the container road transportal ion am be divided into three types; short distance, long distance and shuttle transportation. Also container vehicle am be divided into three types according to the chassis types of vehicle; only 20-feet container, only 40-feet container, combined chassis trailer. This paper deals with Vehicle Routing Problem(VRP) for delivering containers considering shuttle transportation. The shuttle service occurs several amounts of container which is same as O/D pairs. This problem is similar to the previously studied VRP for delivering containers using combined chassis trailers, but the characteristics of shuttle service must be considered additionally. We formulate the container shuttle transportation planning problem using combined chassis trailers based on VRP with pick-up and delivery which can visit each node more than one time, and propose an efficient solution procedure.

  • PDF

Simulation Analysis to Optimize the Management of Military Maintenance Facility (군 정비시설 운용 최적화를 위한 시뮬레이션 분석 연구)

  • Kim, Kyung-Rok;Rhee, Jong-Moon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.15 no.5
    • /
    • pp.2724-2731
    • /
    • 2014
  • As the future national defense plan of government focus on advanced weapon system, military maintenance facility becomes more important. However, military maintenance facility has been managed by director's experience and simple mathematical calculation until now. Thus, the optimization for the management of military maintenance facility is suggested by more scientistic and logical methods in this study. The study follows the procedure below. First, simulation is designed according to the analysis of military maintenance facility. Second, independent variable and dependent variable are defined for optimization. Independent Variable includes the number of maintenance machine, transportation machine, worker in the details of military maintenance facility operation, and dependent variable involves total maintenance time affected by independent variable. Third, warmup analysis is performed to get warmup period, based on the simulation model. Fourth, the optimal combination is computed with evolution strategy, meta-heuristic, to enhance military maintenance management. By the optimal combination, the management of military maintenance facility can gain the biggest effect against the limited cost. In the future, the multipurpose study, to analyze the military maintenance facility covering various weapon system equipments, will be performed.

Development of Facial Emotion Recognition System Based on Optimization of HMM Structure by using Harmony Search Algorithm (Harmony Search 알고리즘 기반 HMM 구조 최적화에 의한 얼굴 정서 인식 시스템 개발)

  • Ko, Kwang-Eun;Sim, Kwee-Bo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.21 no.3
    • /
    • pp.395-400
    • /
    • 2011
  • In this paper, we propose an study of the facial emotion recognition considering the dynamical variation of emotional state in facial image sequences. The proposed system consists of two main step: facial image based emotional feature extraction and emotional state classification/recognition. At first, we propose a method for extracting and analyzing the emotional feature region using a combination of Active Shape Model (ASM) and Facial Action Units (FAUs). And then, it is proposed that emotional state classification and recognition method based on Hidden Markov Model (HMM) type of dynamic Bayesian network. Also, we adopt a Harmony Search (HS) algorithm based heuristic optimization procedure in a parameter learning of HMM in order to classify the emotional state more accurately. By using all these methods, we construct the emotion recognition system based on variations of the dynamic facial image sequence and make an attempt at improvement of the recognition performance.

Development of Intelligent ATP System Using Genetic Algorithm (유전 알고리듬을 적용한 지능형 ATP 시스템 개발)

  • Kim, Tai-Young
    • Journal of Intelligence and Information Systems
    • /
    • v.16 no.4
    • /
    • pp.131-145
    • /
    • 2010
  • The framework for making a coordinated decision for large-scale facilities has become an important issue in supply chain(SC) management research. The competitive business environment requires companies to continuously search for the ways to achieve high efficiency and lower operational costs. In the areas of production/distribution planning, many researchers and practitioners have developedand evaluated the deterministic models to coordinate important and interrelated logistic decisions such as capacity management, inventory allocation, and vehicle routing. They initially have investigated the various process of SC separately and later become more interested in such problems encompassing the whole SC system. The accurate quotation of ATP(Available-To-Promise) plays a very important role in enhancing customer satisfaction and fill rate maximization. The complexity for intelligent manufacturing system, which includes all the linkages among procurement, production, and distribution, makes the accurate quotation of ATP be a quite difficult job. In addition to, many researchers assumed ATP model with integer time. However, in industry practices, integer times are very rare and the model developed using integer times is therefore approximating the real system. Various alternative models for an ATP system with time lags have been developed and evaluated. In most cases, these models have assumed that the time lags are integer multiples of a unit time grid. However, integer time lags are very rare in practices, and therefore models developed using integer time lags only approximate real systems. The differences occurring by this approximation frequently result in significant accuracy degradations. To introduce the ATP model with time lags, we first introduce the dynamic production function. Hackman and Leachman's dynamic production function in initiated research directly related to the topic of this paper. They propose a modeling framework for a system with non-integer time lags and show how to apply the framework to a variety of systems including continues time series, manufacturing resource planning and critical path method. Their formulation requires no additional variables or constraints and is capable of representing real world systems more accurately. Previously, to cope with non-integer time lags, they usually model a concerned system either by rounding lags to the nearest integers or by subdividing the time grid to make the lags become integer multiples of the grid. But each approach has a critical weakness: the first approach underestimates, potentially leading to infeasibilities or overestimates lead times, potentially resulting in excessive work-inprocesses. The second approach drastically inflates the problem size. We consider an optimized ATP system with non-integer time lag in supply chain management. We focus on a worldwide headquarter, distribution centers, and manufacturing facilities are globally networked. We develop a mixed integer programming(MIP) model for ATP process, which has the definition of required data flow. The illustrative ATP module shows the proposed system is largely affected inSCM. The system we are concerned is composed of a multiple production facility with multiple products, multiple distribution centers and multiple customers. For the system, we consider an ATP scheduling and capacity allocationproblem. In this study, we proposed the model for the ATP system in SCM using the dynamic production function considering the non-integer time lags. The model is developed under the framework suitable for the non-integer lags and, therefore, is more accurate than the models we usually encounter. We developed intelligent ATP System for this model using genetic algorithm. We focus on a capacitated production planning and capacity allocation problem, develop a mixed integer programming model, and propose an efficient heuristic procedure using an evolutionary system to solve it efficiently. This method makes it possible for the population to reach the approximate solution easily. Moreover, we designed and utilized a representation scheme that allows the proposed models to represent real variables. The proposed regeneration procedures, which evaluate each infeasible chromosome, makes the solutions converge to the optimum quickly.