Abstract
The challenge of modeling real-world problems, especially the class of NP-complete problems, is that the solution space is usually very large. It often requires very large time to examine all possible solutions to choose the best one. It is sometimes impossible to find the real optimum solution and we have to be satisfied with a certain pseudo-optimum one. There are many optimization and search methods to obtain the pseudo-optimum solutions. In general, these procedures start by checking some given number of variants, then change the search direction towards the more promising area, and finally pick up the best among the examined ones. In these methods, the key point is on how to guide the search process.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ben-Arieh D, Maimon 0 (1992) Annealing method for PCB assembly scheduling on two sequential machines. IJ Computer Integrated Manufacturing 5: 361–367.
Cheng R, Gen M, Tsujimura Y (1999) A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies Computers and Industrial Engineering 36: 343–364.
Crama Y, Kolen AWJ, Oerlemans AG, Spieksma FCR (1994) Minimizing the number of tool switches on a flexible machine. IJ Flexible Manufacturing Systems 6: 33–54.
DeJong KA (1975) An analysis of the behavior of a class of genetic adaptive systems. Ph.D. dissertation, University of Michigan, USA.
Djellab H, Djellab K, Gourgand M (2000) A new heuristic based on a hypergraph representation for the tool switching problem. IJ Production Economics 64: 165–176.
Gen M, Tsujimura Y, Li Y (1996) Fuzzy assembly line balancing using genetic algorithms. Computers and Industrial Engineering 31: 631–634.
Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning. Wiley, Massachusetts.
Goldberg DE, Deb K, Korb B (1990) Messy genetic algorithms revisited: studies in mixed size and scale. Complex Systems 4: 415–444.
Gould JL, Keeton WT (1996) Biological Science. W.W. Norton und Company
Gronalt M, Grunow M, Gunther HO, Zeller R (1997) A heuristic for component switching on SMT placement machines. IJ Production Economics 53: 181–190.
Gunther HO, Gronalt M, Zeller R (1998) Job sequencing and component set-up on a surface mount placement machine. Production Planning and Control 9: 201–211.
Hinterding R, Michalewicz Z, Eiben AE (1997) Adaptation in evolutionary computation: a survey. In: proceedings of the 4th IEEE international conference on evolutionary computation. Indianapolis, pp 65–69.
Justinian R (1997) Analysis of complexity drift in genetic programming, In: genetic programming 1997: proceedings of the second annual conference. pp 28–31.
Maimon OZ, Braha D (1998) A genetic algorithm approach to scheduling PCBs on a single machine. IJ Production Research 36: 761–784.
Matzliach B, Tzur M (1998) The online tool switching problem with non-uniform tool size. IJ Production Research 36: 3407 —3420.
Matzliach B, Tzur M (2000) Storage management of items in two levels of availability. European Journal of Operational Research 121: 363 —3379.
Melanie M, Forrest S, Holland J (1991) The Royal Road for genetic algorithms: fitness landscapes and GA performance. In: proceedings of the first European conference on artificial life. MIT Press, Cambridge.
Melanie M, Holland J, Forrest S (1994) When will a genetic algorithm outperform hill climbing In: Cowan J, Tesauro G, Alspector J (eds) Advances in neural information processing systems. Morgan Kauffman, San Francisco.
Muhlenbein H. (1997) Genetic algorithms. In: Aarts A, Lenstra JK (Eds.) Local search in combinatorial optimization. Wiley, Chichester, pp 137–171.
Privault C, Finke G (1995) Modeling a tool switching problem on a single NC- machine. J Intelligent Manufacturing 6: 87–94.
Rajkumar K, Narendran TT (1997) A bi-criteria model for loading on PCB assembly machines. Production Planning und Control 8: 743–752.
Rajkumar K, Narendran TT (1998) A heuristic for sequencing PCB assembly to minimize set-up times. Production Planning and Control 9: 465–476.
Rupe J, Kuo W (1997) Solutions to a modified tool loading problem for a single FMM. IJ Production Research 35: 2253 —2268.
Salomon R (1996) Reevaluating genetic algorithm performance under coordinate rotation of benchmark functions; a survey of some theoretical and practical aspects of genetic algorithms. BioSystems 39: 263–278.
Salomon R (1997) Improving the performance of genetic algorithms through derandomization. In: software concept and tools, Springer, Berlin.
Schwefel HP (1995) Evolution and optimum seeking. Wiley, New York.
Sikora R (1996) A genetic algorithm for integrating lot-sizing and sequencing in scheduling a capacitated flow line. Computers and Industrial Engineering 30: 969–981.
Simões AB, Costa E (1999) Transposition versus crossover: an empirical study. In: proceedings of the genetic and evolutionary computation conference, GECCO 1999, Florida, USA.
Simões AB, Costa E (2000a) Using genetic algorithms with sexual or asexual transposition: a comparative study. In: proceedings of the congress on evolutionary computation, CEC 2000, San Diego, USA.
Simões AB, Costa E (2000b) Using genetic algorithms with asexual transposition. In: proceedings of the genetic and evolutionary computation conference, GECCO 2000, Las Vegas, USA.
Smed J, Johnsson M, Puranen M, Leipala T, Nevalainen 0 (1999) Job grouping in surface mounted component printing. Robotics and Computer-Integrated Manufacturing 15: 39–49.
Srinivas M, Patnaik L (1994) Genetic algorithms: a survey. IEEE Press.
Tang CS, Denardo EV (1988) Models arising from a flexible manufacturing machine, part I: minimization of the number of tool switches. Operations Research 36: 767–777.
Thierens D, Goldberg DE (1994) Convergence models of genetic algorithm selection schemes. In: Davidor Y, Schwefel HP, Manner R (eds.) Proceedings of parallel problem solving from nature. Springer, Berlin, pp 119–129.
VanHop N, Hanh PH (2000) A self-guiding derandomized genetic algorithm for setup problem in PCB assembly. In: the 2000 international conference on artificial intelligence, IC-AI’2000. Las Vegas, Nevada, USA.
VanHop N, Tabucanon MT (2001) Set-up problem for a line of machines in PCB assembly process planning: a multiple criteria decision making approach. IJ Computer Integrated Manufacturing 14: 343–352.
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Van Hop, N., Tabucanon, M.T. (2004). Improvement of Search Process in Genetic Algorithms: An Application of PCB Assembly Sequencing Problem. In: New Optimization Techniques in Engineering. Studies in Fuzziness and Soft Computing, vol 141. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39930-8_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-39930-8_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05767-0
Online ISBN: 978-3-540-39930-8
eBook Packages: Springer Book Archive