Skip to main content

Optimization of Logistic Processes in Supply-Chains Using Meta-heuristics

  • Conference paper
Progress in Artificial Intelligence (EPIA 2003)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2902))

Included in the following conference series:

Abstract

This paper addresses the optimization of logistic processes in supply-chains using meta-heuristics: genetic algorithms and ant colony optimization. The dynamic assignment of components to orders and choosing the solution that is able to deliver more orders at the correct date, is a scheduling problem that classical scheduling methods can not cope with. However, the implementation of meta-heuristics is done only after a positive assessment of the performance’s expectation provided by the fitness-distance correlation analysis. Both meta-heuristics are then applied to a simulation example that describes a general logistic process. The performance is similar for both methods, but the ant colony optimization method provides more information at the expenses of computational costs.

This work is supported by the German Ministry of Education and Research (BMBF) under Contract no.13N7906 (project Nivelli) and by the Portuguese Foundation for Science and Technology (FCT) under Grant no. SFRH/BD/6366/2001.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Barbuceanu, M., Fox, M.: Coordinating multiple agents in the supply chain. In: Proceedings of the Fifth Workshops on Enabling Technology for Collaborative Enterprises, WET ICE 1996, pp. 134–141. IEEE Computer Society Press, Los Alamitos (1996)

    Chapter  Google Scholar 

  2. Swaminathan, J.M., Smith, S.F., Sadeh, N.M.: Modeling supply chain dynamics:Amultiagent approach. Decision Sciences Journal 29, 607–632 (1998)

    Article  Google Scholar 

  3. Pinedo, M.: Scheduling: Theory, Algorithms, and Systems, 2nd edn. Prentice-Hall, Englewood Cliffs (2002)

    MATH  Google Scholar 

  4. Jain, A., Meeran, S.: A state-of-the-art review of job-shop scheduling techniques. A. S. Jain and S. Meeran. A state-of-the-art review of job-shop scheduling techniques. Technical report, Department of Applied Physics, Electronic and Mechanical Engineering, University of Dundee, Dundee, Scotland (1998)

    Google Scholar 

  5. Holland, J.H.: Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor (1975)

    Google Scholar 

  6. Cheng, R., Gen, M., Tsujimura, Y.: A total survey of job-shop scheduling problems using genetic algorithms-i. representation. Computers and Industrial Engineering 30, 983–997 (1996)

    Article  Google Scholar 

  7. Shen, W., Norrie, D.: Agent-based systems for intelligent manufacturing: a state-of-the-art survey. Knowledge and Information Systems, an International Journal 1, 129–156 (1999)

    Google Scholar 

  8. Dewan, P., Joshi, S.: Implementation of an auction-based distributed scheduling model for a dynamic job-shop environment. International Journal of Computer Integrated Manufacturing 14, 446–456 (2001)

    Article  Google Scholar 

  9. Wolff, R.: Stochastic Modeling and the Theory of Queues. Prentice-Hall, Englewood Cliffs (1989)

    MATH  Google Scholar 

  10. Martello, S., Toth, P.: Knapsack problems: algorithms and computer implementations. John Wiley and Sons, Ltd., NewYork (1990)

    MATH  Google Scholar 

  11. Dorigo, M., Di Caro, G.: The ant colony optimization meta-heuristic. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 11–32. McGraw-Hill, New York (1999)

    Google Scholar 

  12. Kauffman, S.A.: Adaptation on rugged fitness landscapes. In: Stein, D. (ed.) Lectures in the Sciences of Complexity, vol. 1, pp. 527–618. Addsion-Weley Longman, Amsterdam (1989)

    Google Scholar 

  13. Jones, T., Forrest, S.: Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In: Kaufmann, M. (ed.) Proceedings of the 6th international conference on genetic algorithms, pp. 184–192 (1995)

    Google Scholar 

  14. Stützle, T., Hoos, H.: Max min ant system. Journal of Future Generation Computer Systems 8, 889–914 (2000)

    Article  Google Scholar 

  15. Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading (1989)

    MATH  Google Scholar 

  16. Lawton, G. Genetic algorithms for schedule optimization. AI Expert May Issue, 23–27 (1992)

    Google Scholar 

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

    Article  Google Scholar 

  18. den Besten, M., Stützle, T., Dorigo, M.: Ant colony optimization for the total weighted tardiness problem. In: Deb, K., Rudolph, G., Lutton, E., Merelo, J.J., Schoenauer, M., Schwefel, H.-P., Yao, X. (eds.) PPSN 2000. LNCS, vol. 1917, Springer, Heidelberg (2000)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Silva, C.A., Runkler, T.A., Sousa, J.M., da Costa, J.M.S. (2003). Optimization of Logistic Processes in Supply-Chains Using Meta-heuristics. In: Pires, F.M., Abreu, S. (eds) Progress in Artificial Intelligence. EPIA 2003. Lecture Notes in Computer Science(), vol 2902. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24580-3_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24580-3_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20589-0

  • Online ISBN: 978-3-540-24580-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics