Zusammenfassung
Dieses Kapitel befaßt sich mit der für den Kunden sichtbaren Leistung des FS, der Logistik. Diese stellt die Schnittstelle zwischen der Außenwelt und den Prozessen innerhalb des FS dar. Drehscheibe aller dispositiven Aktivitäten ist dabei der Logistik-Leitstand.
„Der einzige Profitcenter ist der Kunde.“
[Tue93], S. (13)
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.
Literatur des Kapitels
Bernard Angeniol, G. Vaubois, J. Y. Letexier: ‘Self-organizing feature maps and the travelling salesman problem’;
Shirish C, Nigel John, M. R. Kabuka: ‘A Real-Time solution for the Traveling Salesman Problem using a Boolean Neural Network’;
Maria Cláudia S. Eueres, Valmir C. Barbosa: ‘A Faster Elastic-Net Algorithm for the Traveling Salesman Problem’;
David E. Vanderbout, T. K. Miller: ‘A Travelling Salesman Objective Function that Works’;
Robert D. Brandt, Yao Wang, Alan J. Laub, Sanjit K. Mitra: ‘AlternativeNetworks for Solving the Travelling Salesman Problem and the List-Matching Problem’;
Pim H. W. Buurman, Wim J. M. Philipsen, John van Spaandonk: ‘plan-net: A New Neural Net Simulator’;
Laura I. Burke: ‘Neural Methods for the Traveling Salesman Problem: Insights From Operations Research’;
John Y. Cheung: ‘Scheduling’;
Richard Durbin, D. Willshaw: ‘An analogue approach to the traveilng salesman problem using an elastic net method’;
Richard Durbin, Richard Szeliski, Alan Yuille: ‘An Analysis of the Elastic Net Approach to the Travelling Salesman Problem’;
M. Goldstein: ‘Self-Organization Feature Map For The Multiple Travelling Salesmen Problem (MTSP)’;
John J. Hopfield: ‘Neural Networks and Physical Systems with Emergent Collective Computational Abilities’;
John J. Hopfield: ‘Neurons with grades have collected computational properties like those of two-state neurons’;
John J. Hopfield, D. W. Tank: ‘Neural Computing of De cisions in Optimization Problems’;
A. Joppe, H. R. A. Cardons, J. C. Bioch: ‘A Neural Network for solving the Travelling Salesman Problem on the basis of city adjacency in the tour’;
Eugene Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys (Hrsg.): ‘The traveling salesman problem: a guided tour of combinatorial optimization’;
Raymond Lister: ‘Segment Reversal and the Travelling Salesman Problem’;
Shanshank Mehta, Layzlo Fulop: ‘An Analog Neural Network to Solve the Hamiltonian Cycle Problem’]
Robert Mundigl: „Ansätze künstlich er neuronaler Netze zur Lösung von Tourenplanungsproblemen“;
Marcello Pelillo: ‘Relaxation Labeling Processes for the Traveling Salesman Problem’;
M. P. Pensini, G. Mauri, F. Gardin: ‘Flowshop and Travelling Salesman Problem’;
C. Peterson: ‘Parallel Distributed Approaches to Combinatorial Optimization: Benchmark Studies on Traveling Salesman Problem’;
Helge Ritter, Thomas Martinez, Klaus Schulten: „Neuronale Netze: EineEinführung in die Neuromformatik selbstorganisierender Netzwerke“;
P. D. Simic: ‘Statistical mechanics as the underlying theory of “elastic“ and “neural“ optimization’;
J. V. Stone: ‘The Optimal Elastic Net: Finding Solutions to the Travelling Salesman Problem’;
K. T. Sun, H. C. Fu, C. Chen: ‘A Neural network for Solving the Hamiltonian Cycle Problem’;
Harold Szu: ‘Fast TSP algorithm based on binary neuron output and analog neuron input using the zero-diagonal interconnect matrix and necessary and sufficient constraints of the permutation matrix’;
Harold Szu: ‘Coloured Noise Annealing Benchmark by Exhaustive Solutions of TSP’;
Harold Szu: ‘Lossless Divide & Conquer Principle for Massively Parallel Optimizations’;
Kochi Urahama, Hiroshi Nishiyuki: ‘Neural Algorithms for Placement Problems’;
Rudy Van Vliet, Helmut Cardon: ‘Combining a Graph Partitioning and a TSP Neural Network to Solve the MTSP’;
E. Wacholder, J. Han, R. C. Mann: ‘A Neural Network Algorithm for the Multiple Salesman Problem’;
Derek M. Wells: ‘Solving Degenerate Optimization Problems using Networks of Neural Oscillators’;
V. Wilson, G. S. Pawley: ‘On the stability of the TSP problem algorithm of Hopfield and Tank’;
X. Xu, W. T. Tasi: ‘Effective Neural Algorithms for the Traveling Salesman Problem’;
Dan Xu, Itsuo Kümazawa: ‘Single Minimum Method for Combinatorial Optimization Problems and An Efficient Algorithm for the TSP Problem’;
Taiji Yamada, Kazuyuki Aihara, Makoto Kotani: ‘Chaotic Neural Networks and The Traveling Salesman Problem’;
Percy P. C. YLP, Yoh-Han Pao: ‘A New Approach to the Travelling Salesman Problem’;
Günther Zäpfel: „Produktionswirtschaft“;
J. Jim Zhu, Weiping Xiao: ‘Case Studies of CMAB Neural Network in the Control of Time-Varying Dynamical Systems’;
Rights and permissions
Copyright information
© 1997 Betriebswirtschaftlicher Verlag Dr. Th. Gabler GmbH, Wiesbaden
About this chapter
Cite this chapter
Heuer, J. (1997). Der neuronal-unterstützte logistische Prozeß. In: Neuronale Netze in der Industrie. Deutscher Universitätsverlag. https://doi.org/10.1007/978-3-322-93384-3_8
Download citation
DOI: https://doi.org/10.1007/978-3-322-93384-3_8
Publisher Name: Deutscher Universitätsverlag
Print ISBN: 978-3-8244-6386-2
Online ISBN: 978-3-322-93384-3
eBook Packages: Springer Book Archive