Abstract
Due to the recent changes of the European domestic market including the opening up of Eastern Europe and its associated logistical (distribution) consequences, the economically significant question of reorganization of goods distribution networks represents an increasing problem for many companies operating in Europe. The existing concepts indicate several weak points because of insufficient consideration of real, nonlinear transportation and storage costs as well as of underlying strategies behind the distribution structure. In addition, the existing concepts are limited to the optimization of only one warehousing level. The consideration of real conditions incl. simultaneous optimization of multiple distribution echelons increases the complexity enormously, hence a further development of known concepts will practically fail. Contents of the following contribution — promoted by the DFG (Lu 373/18-1) - are based on application of heuristic concepts, i.e. Simulated Annealing, Evolutionary Strategies, Genetic Algorithms, and TABU Search for solving this complex optimization problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
7 References
Bach, L.: Methoden zur Bestimmung von Standorten und Einzugsbereichen zentraler Einrichtungen. Birkhäuser Verlag, Basel Stuttgart (1978)
Battiti, R., Tecchiolli, G.: The Continuous Reactive TABU Search: Blending Combinatorial Optimization and Stochastic Search for Global Optimization — Metaheuristics in Combinatorial Optimization —. In: Annals of Operations Research, 63 (1996) 113–118
Blank, U.: Entwicklung eines Verfahrens zur Segmentierung von Warenverteilungssystemen. Dissertation RWTH Aachen (Forschungsinstitut für Rationalisierung — FIR), Aachen (1980)
Cerny, V.: A thermodynamical Approach to the Traveling Salesman Problem. In: Journal of Optimization Theory and Applications, 45/1 (1985) 41–51
Davis, L.: Handbook of Genetic Algorithms. New York (1991)
Djamschidi, R., Friemuth, U.: Distributionslogistik im hochdynamischen Europa. In: Arbeitgeber 15/16 (1997) 483–486
Djamschidi, R.: Efficient Algorithms for Structuring Distribution Networks. In: Eufit’ 98, 6th European Congress on Intelligent Techniques and Soft Computing, Proceedings Volume III. Verlag Mainz Wissenschaftsverlag, Aachen (1998) 1665–1670
Djamschidi, R., Bruckner, A.: Distributionslogistik in einem sich ändernden Europa. In: Logistikplanung-Methoden, Werkzeuge, Potentiale. Tagungsband der 4. Magdeburger Logistik-Tagung, Magdeburg (1998)
Djamschidi, R.: Lagerstandortplanung in Europa. In: Praxishandbuch für Lagerplanung, organisation und-optimierung. WEKA Fachverlag für technische Führungskräfte, Augsburg (1998)
Domschke, W., Drexl, A.: Logistik: Standorte. München Wien (1985)
Glover, F.: Annals of Operations Research 41. Basel (1993)
Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Boston (1997)
Goldberg, D. E.: Genetic Algorithms in Search, Optimization and Machine Learning. Reading, Massachusetts (1989)
Hummelten, W.: Optimierungsmethoden zur betrieblichen Standortwahl. Würzburg Wien (1981)
Karaboga, D., Pham, D.: Intelligent Optimization Techniques: Genetic Algorithms, Tabu Search, Simulated Annealing and Neural Networks. Springer-Verlag, London, (1998)
Kinnebrock, W.: Optimierung mit genetischen und selektiven Algorithmen. Oldenbourg Verlag, München Wien (1994)
Kirkpatrick, S., Gelatt, C. D., Vecchini, M. P.: Optimization by Simulated Annealing. In: Science 220/4598 (1983) 671–680
Kitano, H.: A hybrid search for Genetic Algorithms: Combining Genetic Algorithms, Tabu Search and Simulated Annealing. In: Proceedings of the Fifth International Conference on Genetic Algorithms. Morgan Kaufman Publisher (1993)
Lee, J.: Faster Simulated Annealing techniques for stochastic optimization problems, with application to queering network simulation. Ph.D. Dissertation, Statistics and Operations Research, North Carolina State University (1995)
Love, R.F., Morris, J.G., Wesolowsky, G.O.: Facilities Location: models and methods. North Holland, New York (1988)
Malek, M., Guruswamy, M., Pandya, M., Owens, H: Serial and parallel Simulated Annealing and TABU Search algorithms for the travelling salesman problem. In: Annals of Operations Research, 21 (1989) 59–84
Metropolis, N., Rosenbluth, A., Teller, A. H.: Equation of state calculation by fast computing machines. In: Journal of Chem. Phys. 21 (1953) 1087–1091
Murtagh, B. A., Niwattisy, S. R.: An Efficient Method for the Multi-Depot Location-Allocation Problem. In: Journal of the Operational Research Society 33 (1982) 629–634
Nissen, V.: Evolutionäre Algorithmen. Wiesbaden (1994)
Rechenberg, I.: Evolutionsstrategie. Stuttgart (1973)
Reeves, C. R.: Modern Heuristic Techniques for Combinatorial Problems. New York (1993)
Reeves, C. R., Dowsland, K. A.: Simulated Annealing. In: Modern Heuristic Techniques for Combinatorial Problems. McGraw-Hill (1995)
Reeves, C. R., Glover, F., Laguna, M.: TABU Search. In: Modern Heuristic Techniques for Combinatorial Problems. McGraw-Hill (1995)
Schildt, B.: Strategische Produktions-und Distributionsplanung. Wiesbaden (1994)
Schwefel, H.-P.: Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie. Basel Stuttgart (1977)
Sivazlian, B. D., Stanfel, L. E.: Analysis of Systems in Operations Research. Englewood Cliffs (1975)
Tempelmeier, H.: Quantitative Marketing-Logistik. Berlin (1983)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Djamschidi, R., Bruckner, A. (1999). Applying Heuristic Algorithms on Structuring Europeanwide Distribution Networks. In: Reusch, B. (eds) Computational Intelligence. Fuzzy Days 1999. Lecture Notes in Computer Science, vol 1625. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48774-3_71
Download citation
DOI: https://doi.org/10.1007/3-540-48774-3_71
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66050-7
Online ISBN: 978-3-540-48774-6
eBook Packages: Springer Book Archive