Cover of the Inter'l Journal of Industrial Engineering: Theory, Applications, and Practice Computational Intelligence in Industrial Engineering

A Special Issue of the
Inter'l Journal of Industrial Engineering: Theory, Applications, and Practice
Vol. 7, No. 1, March of 2003


T. Warren Liao, Evangelos Triantaphyllou, and Jacob Chen
Guest Editors


TABLE OF CONTENTS


  1. A Directed Mutation Operation For Differential Evolution Algorithm
    Hui-Yuan Fan , and Jouni Lampinen (See Abstract)


  2. A Simulation Based Genetic Algorithm For Risk-Based Partner Selection In New Product Development
    by Hongyi Cao and Dingwei Wang (See Abstract)


  3. Advanced Process Planning And Scheduling With Precedence Constraints And Machine Selection Using A Genetic Algorithm
    by Chiung Moon and Young Hae Lee (See Abstract)


  4. Optimizing The Production Scheduling Of A Petroleum Refinery Through Genetic Algorithms
    by Mayron Rodrigues de Almeida Sílvio Hamacher (See Abstract)


  5. A Genetic Algorithm Approach to Solving a Multiple-Inventory Loading Problem
    by J. Cole Smith (See Abstract)


  6. A Neural Networks Approach For Due-Date Assignment In A Wafer Fabrication Factory
    by Pei-Chann Chang and Jih-Chang Hsieh (See Abstract)


  7. Joint Monitoring Of The Mean And Variance Of A Process By Using An Artificial Neural Network Approach
    by Chuen-Sheng Cheng and Shin-Jia Chen (See Abstract)


  8. Comparison Of Neural And Statistical Algorithms For Supervised Classification Of Multi-Dimensional Data
    by Te-Sheng Li1, Chang-You Chen2 and Chao-Ton Su2 (See Abstract)


  9. The Prediction Of Airplane Landing Gravity Using Case-Based Reasoning
    by Chaochang Chiu and Nan-Hsing Chiu (See Abstract)



ABSTRACTS:


     
  1. FEATURE EXTRACTION USING ROUGH SET THEORY AND GENETIC ALGORITHMS - AN APPLICATION FOR THE SIMPLIFICATION OF PRODUCT QUALITY EVALUATION


  2. Int'l J. of Industrial Engineering: : Theory, Applications, and Practice, Vol. x, No. x, pp. xxx-xxx.

    by Lian-Yin Zhai, Li-Pheng Khoo, and Sai-Cheong Fok

    School of Mechanical and Production Engineering
    Nanyang Technological University
    50 Nanyang Avenue
    Singapore 639798

    E-mail: mlyzhai@ntu.edu.sg
    E-mail: mlpkhoo@ntu.edu.sg
    E-mail: mscfok@ntu.edu.sg
    Web: http://www.ntu.edu.sg/MPE/Divisions/manufacturing/Faculty/mlpkhoo.htm


    ABSTRACT:
    Feature extraction is an important aspect in data mining and knowledge discovery. In this paper an integrated feature extraction approach, which is based on rough set theory and genetic algorithms, is proposed. Based on this approach, a prototype feature extraction system is established and illustrated in an application for the simplification of product quality evaluation. The prototype system successfully integrates the capability of rough set theory in handling uncertainty with a robust search engine, which is based on a genetic algorithm. The results show that it can remarkably reduce the cost and time consumed on product quality evaluation without compromising the overall specifications of the acceptance tests.

    KEY WORDS: Feature extraction, Rough sets, Genetic algorithms, Knowledge extraction.

    up


     
  3. A SIMULATION BASED GENETIC ALGORITHM FOR RISK-BASED PARTNER SELECTION IN NEW PRODUCT DEVELOPMENT


  4. Inter'l Journal of Industrial Engineering: Theory, Applications and Practice, Vol. x, No. x, pp. xxx-xxx.

    by Hongyi Cao and Dingwei Wang

    Collage of Information Science and Engineering
    Northeastern University
    Shenyang, Liaoning
    People's Republic of China


    ABSTRACT:
    In this paper, we investigate the problem of partner selection in new product development. First, we give a formal description of the problem and model it as a 0-1integer programming problem with non-linear objective function and stochastic constraints. Because of the complexity of the constraints, a Monte Carlo method is used to measure the probabilities of stochastic constraints satisfaction. Then, we develop a simulation based genetic algorithm approach to find the optimal solution for partner selection. The approach is demonstrated by some numerical examples. The results show that the suggested approach has high efficiency and the model has potential to practical applications.

    KEY WORDS: Genetic algorithm, Monte Carlo simulation, Partner selection, Risk analysis, New product development.

    up


     
  5. ADVANCED PROCESS PLANNING AND SCHEDULING WITH PRECEDENCE CONSTRAINTS AND MACHINE SELECTION USING A GENETIC ALGORITHM


  6. Inter'l Journal of Industrial Engineering: Theory, Applications, and Practice Vol. x, No. x, pp. xxx-xxx.

    by Chiung Moon and Young Hae Lee

    Department of Industrial Engineering
    Hanyang University, Ansan 425-791
    Korea

    Tel:+82-31-400-5268
    Fax:+82-31-400-3843
    cumoon@hanyang.ac.kr
    or cumoon@hanmail.ne


    ABSTRACT:
    This paper deals with integrated process planning and scheduling problems with minimizing makespan for a flexible flow manufacturing where alternative operations sequences with precedence constraints and alternative machines. The problem is formulated as a mathematical model which includes operation sequencing, machine selection, and operation scheduling. The integrated planning of having more than one machine to perform the same operation and precedence constraints for sequences increases the size of the solution space, and consequently, makes the problem even more complex. We develop a new genetic algorithm approach using topological sort to solve the model efficiently. Schedules with operations sequences and machine selections are currently decided by the proposed approach. Some experimental results are presented for various problem sizes and parameter settings to describe the performance of the proposed approach.

    KEY WORDS: Integrated planning and scheduling, topological sort, traveling salesman problem, genetic algorithms.

    up


     
  7. OPTIMIZING THE PRODUCTION SCHEDULING OF A PETROLEUM REFINERY THROUGH GENETIC ALGORITHMS


  8. Inter'l Journal of Industrial Engineering: Theory, Applications, and Practice Vol. x, No. x, pp. xxx-xxx.

    by Mayron Rodrigues de Almeida1 and Sílvio Hamacher1
    Marco Aurélio Cavalcanti Pacheco2 and Marley Maria B.R. Vellasco2


    1: Department of Industrial Engineering
    Pontifícia Universidade Católica do Rio de Janeiro
    Rua Marquês de São Vicente, 225, Gávea
    Rio de Janeiro, RJ
    Brasil, 22453-900

    E-mail: {Mayron@ons.org.br ; Hamacher@rdc.puc-rio.br}

    2: ICA Laboratory of Applied Computational Intelligence
    Department of Electrical Engineering
    Pontifícia Universidade Católica do Rio de Janeiro
    Rua Marquês de São Vicente, 225, Gávea, Rio de Janeiro, RJ
    Brasil, 22453-900

    E-mail: {Marco@ele.puc-rio.br ; Marley@ele.puc-rio.br}


    ABSTRACT:
    This paper presents a method, based on Genetic Algorithms, to optimize the production scheduling of the fuel oil and asphalt area in a petroleum refinery. The fuel oil and asphalt area is a multi-product plant, with two machine stages – one mixer and a set of tanks – with no setup time and with resource constrains in continuous operation. Two genetic algorithm models were developed to establish the sequence and size of all production shares. A special mutation operator – Neighborhood Mutation - is proposed to minimize the number of changes in the production. A multi- objective fitness evaluation technique, based on an energy minimization method, was also incorporated to the Genetic Algorithm models. The results obtained confirm that the proposed Genetic Algorithm models, associated with the multi-objective energy minimization method, are able to solve the scheduling problem, optimizing the refinery operational objectives.

    KEY WORDS: Production Scheduling, Petroleum Refinery, Genetic Algorithms.

    up


     
  9. A GENETIC ALGORITHM APPROACH TO SOVING A MULTIPLE-INVENTORY LOADING PROBLEM


  10. Inter'l Journal of Industrial Engineering: Theory, Applications, and Practice Vol. x, No. x, pp. xxx-xxx.

    by J. Cole Smith

    Department of Systems and Industrial Engineering
    University of Arizona
    P.O. Box 210020
    Tucson, AZ 85721

    E-mail: cole@sie.arizona.edu


    ABSTRACT:
    In this paper we consider a multiple-inventory loading problem involving a set of commodities that must be transported from a distributor to a retailer. The vehicle carrying out this distribution is divided into several compartments, in which only one type of commodity may be loaded. The problem becomes one of determining optimal assignments of vehicle compartments to commodities in order to minimize a mix of transportation and inventory costs. We first demonstrate the weakness of the underlying linear relaxation of a traditional mixed-integer programming approach that must be solved in a branch-and-bound framework. Instead of pursuing the development of an exact algorithm, we instead recommend the use of a genetic algorithm to quickly provide good quality solutions. Next, we introduce an additional strategy for defeating symmetry complications arising in certain specially structured problems. Finally, the effectiveness of each of the proposed techniques is demonstrated on a test bed of problems.

    KEY WORDS: Genetic algorithms, Mathematical modeling, Inventory management, Logistics

    up


     
  11. A NEURAL NETWORKS APPROACH FOR DUE-DATE ASSIGNMENT IN A WAFER FABRICATION FACTORY


  12. Inter'l Journal of Industrial Engineering: Theory, Applications, and Practice Vol. x, No. x, pp. xxx-xxx.

    by Pei-Chann Chang and Jih-Chang Hsieh

    Department of Industrial Engineering
    Yuan Ze University
    Nei-Li, Taoyuan
    Taiwan

    E-mail: iepchang@saturn.yzu.edu.tw


    ABSTRACT:
    The production processes in a wafer fabrication factory are very complicated and time-consuming. This presents a challenging problem to the production planning and scheduling department for the due-date assignment of each order. This research proposes a simulation model to mimic a real wafer fabrication factory and the flowtime of each order is collected for the purpose of due-date assignment. Various influential variables related to the flowtime of each order are identified through regression analysis. Accordingly, a neural network model is established to forecast the due-date of each order. The system is very applicable in the real world and the experimental results show that the proposed approach is very convincing when compared with the traditional approaches.

    KEY WORDS: Wafer fabrication factory, Due-date assignment, Backpropagation neural networks

    up


     
  13. JOINT MONITORING OF THE MEAN AND VARIANCE OF A PROCESS BY USING AN ARTIFICIAL NEURAL NETWORK APPROACH


  14. Inter'l Journal of Industrial Engineering: Theory, Applications, and Practice Vol. x, No. x, pp. xxx-xxx.

    by Chuen-Sheng Cheng and Shin-Jia Chen

    Department of Industrial Engineering and Management
    Yuan-Ze University
    135 Yuan-Tung Road, Taoyuan
    Taiwan, R.O.C.


    ABSTRACT:
    In this paper we consider the joint control of process mean and variance using artificial neural network technology. The performance of the neural network was evaluated by estimating the recognition accuracy. Extensive comparisons show that the neural network appears to be a good control procedure for joint monitoring of the process mean and variance.

    KEY WORDS: Shewhart Control Chart, Neural Network.

    up


     
  15. COMPARISON OF NEURAL AND STATISTICAL ALGORITHMS FOR SUPERVISED CLASSIFICATION OF MULTI-DIMENSIONAL DATA


  16. Inter'l Journal of Industrial Engineering: Theory, Applications, and Practice Vol. x, No. x, pp. xxx-xxx.

    by Te-Sheng Li1, Chang-You Chen2 and Chao-Ton Su2

    1: Department of Industrial Engineering and Management
    Minghsin Institute of Technology
    Hsinchu, 300
    Taiwan

    2: Department of Industrial Engineering and Management
    National Chiao Tung University,
    Hsinchu, 300
    Taiwan


    ABSTRACT:
    Various algorithms for supervised classification of multi-dimensional data have been implemented in the past decades. Among these algorithms, neural and statistical classifiers are two major methodologies used in the literature. In this paper, a comparison of different neural networks and statistical algorithms used for classification is presented. Three types of neural classifiers are considered: Back-propagation (BP) network, Radial Basis Function (RBF), and Learning Vector Quantization (LVQ). Meanwhile, the k-nearest neighbor (KNN) statistical classifier and linear discriminant analysis (LDA) are also discussed in order to compare the accuracy of classification with those of using neural network models. This paper includes an introduction to the theoretical background of the classifiers, their implementation procedures, and two case studies to evaluate their performance in diagnosis of diseases and glass identification. Both neural networks and statistical models are demonstrated to be efficient and effective methods for multi-dimensional data classification. For neural classifiers, the type of neural network, the type of data, and the parameters of the neural network may have considerable impact on the classification accuracy. For statistical models, the type of data distribution and the criteria used to determine the thresholds are the two most important factors in classification. In the cases studied in this paper, the overall performance of neural networks is better than that of statistical models. Finally, the comparison and discussion of these approaches are presented in view of practical and theoretical considerations.

    KEY WORDS: Back-propagation, Radial Basis Function, Learning Vector Quantization, k-nearest neighbor, Discriminant analysis

    up


     
  17. THE PREDICTION OF AIRPLANE LANDING GRAVITY USING CASE- BASED REASONING


  18. Inter'l Journal of Industrial Engineering: Theory, Applications, and Practice Vol. x, No. x, pp. xxx-xxx.

    by Chaochang Chiu and Nan-Hsing Chiu

    Department of Information Management
    Yuan Ze University
    Taoyuan
    Taiwan, R. O. C.

    E-mail:{for C. C. Chiu: imchiu@saturn.yzu.edu.tw; and for N. H. Chiu: s887720@mail.yzu.edu.tw}


    ABSTRACT:
    Most flight accidents occurring worldwide are due to the lack of an appropriate approach in the landing phase. Recent data mining developments have provided aviation insights into the landing phase. Among these methods, case-based reasoning is a potential approach that can be applied for predicting landing gravity. This research proposes a novel model construction method that consists of non-linear similarity functions and dynamic weighting mechanisms to optimize the prediction accuracy. We illustrate our approach with the data obtained directly from flight data recorders of Boeing 747-400 airplanes. This experiment also shows that non-linear similarity functions demonstrate better prediction accuracy over the results from other approaches.

    KEY WORDS: Case-based reasoning, Genetic algorithms, Feature weights, Similarity functions, Landing gravity.

    up





Dr. Liao's Homepage

Dr. Triantaphyllou's Homepage

Dr. J Chen's Homepage

Dr. Triantaphyllou's Books / Special Issues web site     A new site in Dr. Triantaphyllou's Homepage

Dr. Chen's Homepage




Send suggestions / comments to Dr. E. Triantaphyllou (trianta@lsu.edu).