Skip to main content
SpringerLink
Log in

Metaheuristic Optimization in Certain and Uncertain Environments

  • Chapter
Frontiers in Computing Technologies for Manufacturing Applications

Part of the book series: Springer Series in Advanced Manufacturing ((SSAM))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Glover F W, Kochenberger GA (2003) Handbook of metaheuristics-variable neighborhood search (international series in operations research and management science 57). Springer, Netherlands

    Google Scholar 

  2. Ribeiro CC, Hansen P (eds.) (2002) Essays and surveys in metaheuristics. Kluwer, Norwell

    MATH  Google Scholar 

  3. Chambers LD (ed.) (1999) Practical handbook of genetic algorithms: complex coding systems. CRC Press, Boca Raton

    MATH  Google Scholar 

  4. Davis L (1991) Handbook of genetic algorithms. Van Nostrand Reinhold, New York

    Google Scholar 

  5. Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning. Kluwer, Boston

    MATH  Google Scholar 

  6. Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor

    Google Scholar 

  7. Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science, 220:671–680

    Article  MathSciNet  Google Scholar 

  8. Cerny V (1985) A thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm. Journal of Optimization Theory and Applications, 45:41–51

    Article  MATH  MathSciNet  Google Scholar 

  9. Glover F (1989) Tabu search: Part I. ORSA Journal on Computing, 1:190–206

    MATH  MathSciNet  Google Scholar 

  10. Glover F (1990) Tabu search: Part II. ORSA Journal on Computing, 2:4–32

    MATH  Google Scholar 

  11. Storn R, Price K (1997) Differential evolution-a simple and efficient heuristic for global optimization over continuous spaces. Journal of Global Optimization, 11:341–359

    Article  MATH  MathSciNet  Google Scholar 

  12. Kennedy J, Eberhart R (1995) Particle swarm optimization. Proc. IEEE International Conference on Neural Networks, pp. 1942–1948

    Google Scholar 

  13. Reynolds CW (1987) Flocks, herds, and schools: a distributed behavioral model, in computer graphics. Proc. SIGGRAPH’ 87, vol. 4, pp. 25–34

    Article  Google Scholar 

  14. Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics-Part B, 26:29–41

    Article  Google Scholar 

  15. Dorigo M, Stutzle T (2004) Ant colony optimization. MIT Press, Cambridge

    MATH  Google Scholar 

  16. Moscato P (1989) On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms. Caltech Concurrent Computation Program, C3P Report 826

    Google Scholar 

  17. Laguna M, Marti R (2003) Scatter search: methodology and implementation in C (Operations Research/Computer Science Interfaces Series 24). Kluwer, Norwell

    MATH  Google Scholar 

  18. Shimizu Y, Tachinami Y (2002) Parallel computing for solving mixed-integer programs through a hybrid genetic algorithm. Kagaku Kogaku Ronbunshu, 28:268–272 (in Japanese)

    Article  Google Scholar 

  19. Karimi IA, Srinivasan R, Han PL (2002) Unlock supply chain improvements through effective logistic. Chemical Engineering Progress, 98:32–38

    Google Scholar 

  20. Knolmayer G, Mertens P, Zeier A (2002) Supply chain management based on SAP systems: order management in manufacturing companies. Springer, New York

    Google Scholar 

  21. Stadtler H, Kilger C (2002) Supply chain management and advanced planning: concepts, models, software, and case studies (2nd ed.). Springer, New York

    Google Scholar 

  22. Campbell JF (1994) A survey of network hub location. Studies in Locational Analysis, 6:31–49

    Google Scholar 

  23. Drezner Z, Hamacher HW (2002) Facility Location: applications and theory. Springer, New York

    MATH  Google Scholar 

  24. Ebery J, Krishnamoorth M, Ernst A, Boland N (2000) The capacitated multiple allocation hub location problem: formulations and algorithms. European Journal of Operational Research, 120:614–631

    Article  MATH  Google Scholar 

  25. O’Kelly M E, Miller H J (1994) The hub network design problem. J. Transport Geography, 21:31–40

    Article  Google Scholar 

  26. Lee H, Shi Y, Nazem SM, Kang SY, Park TH, Sohn MH (2001) Multicriteria hub decision making for rural area telecommunication networks. European Journal of Operational Research, 133:483–495

    Article  MATH  Google Scholar 

  27. Wada T, Shimizu Y (2006) A hybrid metaheuristic approach for optimal design of total supply chain network. Transaction of ISCIE 19, 2:69–77 (in Japanese), see also Wada T, Shimizu Y, Yoo J-K (2005) Entire supply chain optimization in terms of hybrid in approach. Proc. 15th ESCAPE, Barcelona, Spain, pp. 591–1596

    Google Scholar 

  28. Okamura K, Yamashida H (1979) A heuristic algorithm for the assembly line model-mix sequencing problem to minimize the risk of stopping the conveyor. International Journal of Production Research, 17:233–247

    Article  Google Scholar 

  29. Yano C A, Rachamadugu R (1991) Sequencing to minimize work overload in assembly lines with product options. Management Science, 37:572–586

    Google Scholar 

  30. Yoo J-K, Moriyama T, Shimizu Y (2005) A sequencing problem in mixed-model assembly line including a painting line. Proc. ICCAS2005, Gyeonggi-Do, Korea, pp. 1118–1122

    Google Scholar 

  31. Pinedo M (2002) Scheduling: theory, algorithms, and systems (2nd ed.). Prentice Hall, Upper Saddle River

    MATH  Google Scholar 

  32. Blazewicz J, Ecker KH, Pesch E, Schmidt G, Weglarz J (2001) Scheduling computer and manufacturing processes (2nd ed.). Springer, Berlin

    MATH  Google Scholar 

  33. Muth JF, Thompson GL (1963) Industrial scheduling. Prentice Hall, Englewood Cliffs

    Google Scholar 

  34. Brucker P (2001) Scheduling algorithms. Springer, New York

    MATH  Google Scholar 

  35. Calrier J (1982) The one-machine sequencing problem. European Journal of Operation Research, 11:42–47

    Article  Google Scholar 

  36. Iwata K et al. (1980) Jobshop scheduling with operators and proxy machines. Transactions of JSME, 417:709–718

    Google Scholar 

  37. Hino R, Kobayashi Y, Yoo J-K, Shimizu Y (2004) Generalization of scheduling problem associated with cooperation among human operators and machine. Proc. Japan-USA Symposium on Flexible Automation, Denver

    Google Scholar 

  38. Garcia-Flores R, Wang XZ, Goltz GE (2000) Agent-based information flow process industries’ supply chain modeling. Computers & Chemical Engineering, 24:1135–1141

    Article  Google Scholar 

  39. Gupta A, Maranas CD, McDonald CM (2000) Mid-term supply chain planning under demand uncertainty: customer demand satisfaction and inventory management. Computers & Chemical Engineering, 24:2613–2621

    Article  Google Scholar 

  40. Zhou Z, Cheng S, Hua B (2000) Supply chain optimization of continuous process industries with sustainability considerations. Computers & Chemical Engineering, 24:1151–1158

    Article  Google Scholar 

  41. Wada T, Yamazaki Y, Shimizu Y (2007) Logistic optimization using hybrid metaheuristic approach-consideration on multi-commodity and volume discount. Transactions of JSME, 73:919–926 (in Japanese), see also Wada T, Yamazaki Y, Shimizu Y (2007) Logistic optimization using hybrid metaheuristic approach under very realistic conditions. Proc. 17th ESCAPE, Bucharest, Romania, pp. 733–738

    Google Scholar 

  42. Hassin R (1983) The minimum cost flow problem: a unifying approach to existing algorithms and a new tree search algorithm. Mathematical Programming, 25:228–239

    Article  MATH  MathSciNet  Google Scholar 

  43. Shimizu Y, Wada T (2004) Hybrid tabu search approach for hierarchical logistics optimization. Transactions of ISCIE 17, 6:241–248 (in Japanese), see also Logistic optimization for site location and route selection under capacity constraints using hybrid tabu search. Proc. 8th International Symposium on PSE, pp. 612–617

    Google Scholar 

  44. Goldberg: AV (1997) An efficient implementation of a scaling minimum-cost flow algorithm. Algorithms, 22:1–29

    Article  MathSciNet  Google Scholar 

  45. http://www.ilog.co.jp

    Google Scholar 

  46. Miltenburg J (1989) Level schedules for mixed-model assemble lines in just-intime production systems. Management Science, 35:192–207

    MATH  Google Scholar 

  47. Duplaga EA, Bragg DJ (1998) Mixed-model assembly line sequencing heuristics for smoothing component parts usage. International Journal of Production Research, 36:2209–2224

    Article  MATH  Google Scholar 

  48. Monden Y (1991) Toyota production system: an integrated approach to Just-In-Time. Chapman & Hall, London

    Google Scholar 

  49. Koren Y, Heisel U, Jovane F, Moriwaki T, Pritshow G, Ulsoy G, Van BH (1999) Reconfigurable manufacturing systems. Annals of the CIRP, 48:527–540

    Google Scholar 

  50. Ruszczynski A, Shapiro A (eds.) (2003) Stochastic programming. Elsevier, London

    MATH  Google Scholar 

  51. Branke J (2002) Evolutionary optimization in dynamic environments. Kluwer, Norwell

    MATH  Google Scholar 

  52. Fitzpatrick JM, Grefenstette JJ (1988) Genetic algorithms in noisy environments. Machine Learning, 3:101–120

    Google Scholar 

  53. Hughes EJ (2001) Evalutionary multi-objective ranking with uncertainty and noise. In: Zitzler E et al. (eds.) EMO 2001. Springer, Berlin, pp. 329–343

    Google Scholar 

  54. Sano Y, Kita H (2002) Optimization of noisy fitness functions by means of genetic algorithms using history of search. Transactions of IEE Japan, 122-C, 6:1001–1008 (in Japanese)

    Google Scholar 

  55. Tamaki H, Arai T, Abe S (1999) A genetic algorithm approach to optimization problems with uncertainties. Transactions of ISCIE, 12:297–303 (in Japanese)

    Google Scholar 

  56. Adachi M, Yamamoto K, Shimizu Y (2003) A genetic algorithm for deriving insensitive solution against uncertain parameters. Proc. 46-th JAAC Conference, FA2-04-3, pp. 736–739 (in Japanese)

    Google Scholar 

  57. Jung JY, Blau G, Pekny JF, Reklaitis GV, Eversdyk D (2004) A simulation based optimization approach to supply chain management under demand uncertainty. Computers & Chemical Engineering, 28:2087–2106

    Article  Google Scholar 

  58. Guillen G, Mele FD, Bagajewicz MJ, Espuna A, Puigjaner L (2005) Multiobjective supply chain design under uncertainty. Chemical Engineering Science, 60:1535–1553

    Article  Google Scholar 

  59. Shimizu Y, Matsuda S, Wada T (2006) A flexible design for logistic network under uncertain demands through hybrid meta-heuristic strategy. Transactions of ISCIE, 19:342–349 (in Japanese), see also Flexible design of logistic network against uncertain demands through hybrid meta-heuristic method. Proc. 16th ESCAPE, Garmisch Partenkirchen, Germany, pp. 2051–2056

    Google Scholar 

  60. Swaney RE, Grossmann IE (1985) An index for operational flexibility in chemical process design. Part 1: formulation and theory. AIChE Journal, 31:621–630

    Article  Google Scholar 

  61. Shimizu Y, Takamatsu T (1987) A design method for process systems with flexibility consideration. Kagaku Kogaku Ronbunshu, 13:574–580 (in Japanese)

    Google Scholar 

  62. Shimizu Y (1989) Application of flexibility analysis for compromise solution in large scale linear systems. Journal of Chemical Engineering of Japan, 22:189–194

    Article  Google Scholar 

Download references

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag London Limited

About this chapter

Cite this chapter

(2007). Metaheuristic Optimization in Certain and Uncertain Environments. In: Frontiers in Computing Technologies for Manufacturing Applications. Springer Series in Advanced Manufacturing. Springer, London. https://doi.org/10.1007/978-1-84628-955-2_2

Download citation

  • DOI: https://doi.org/10.1007/978-1-84628-955-2_2

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-84628-954-5

  • Online ISBN: 978-1-84628-955-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation