Bibliothek

feed icon rss

Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
  • 1
    Digitale Medien
    Digitale Medien
    Springer
    International journal of flexible manufacturing systems 10 (1998), S. 27-42 
    ISSN: 1572-9370
    Schlagwort(e): flexible manufacturing ; strip sequencing strategies ; tool partitioning ; Manhattan and Chebychev metrics
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Maschinenbau
    Notizen: Abstract The purpose of this paper is to develop optimal tool partitioning policies and strip sequencing strategies for a class of flexible manufacturing problems. The problems under consideration involve a large number of operations to be performed by a series of tools on a two-dimensional object. For example, these operations could consist of drilling holes in a metallic sheet. Tools are arranged in a carousel or along a toolbar according to a predetermined sequence. Operations are performed by repeatedly moving the sheet to bring the hole locations under the tool. During each pass, as all operations involving a series of consecutive tools are executed, two main problems are to be solved: (1) how to move the sheet during each pass, (2) how to partition the tools into blocks of consecutive tools. A strip strategy is used to move the sheet. Given this policy, optimal strip widths and tool partitioning policies are determined jointly. Analytical solutions are derived under two metrics corresponding to different operating modes. A numerical example is provided.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 2
    Digitale Medien
    Digitale Medien
    Springer
    Annals of operations research 63 (1996), S. 511-623 
    ISSN: 1572-9338
    Schlagwort(e): Artificial intelligence ; bibliography ; combinatorial optimization ; constraint logic programming ; evolutionary computation ; genetic algorithms ; greedy random adaptive search procedure ; heuristics ; hybrids ; local search ; metaheuristics ; neural networks ; non-monotonic search strategies ; problem-space method ; simulated annealing ; tabu search ; threshold algorithms
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik , Wirtschaftswissenschaften
    Notizen: Abstract Metaheuristics are the most exciting development in approximate optimization techniques of the last two decades. They have had widespread successes in attacking a variety of difficult combinatorial optimization problems that arise in many practical areas. This bibliography provides a classification of a comprehensive list of 1380 references on the theory and application of metaheuristics. Metaheuristics include but are not limited to constraint logic programming; greedy random adaptive search procedures; natural evolutionary computation; neural networks; non-monotonic search strategies; space-search methods; simulated annealing; tabu search; threshold algorithms and their hybrids. References are presented in alphabetical order under a number of subheadings.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 3
    Digitale Medien
    Digitale Medien
    Springer
    Journal of heuristics 2 (1997), S. 187-200 
    ISSN: 1572-9397
    Schlagwort(e): clustered traveling salesman problem ; tabu search ; diversification ; genetic algorithms ; crossover
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract The clustered traveling salesman problem is an extension of the classical traveling salesman problem where the set of vertices is partitioned into clusters. The objective is to find a least cost Hamiltonian cycle such that the vertices of each cluster are visited contiguously and the clusters are visited in a prespecified order. A tabu search heuristic is proposed to solve this problem. This algorithm periodically restarts its search by merging two elite solutions to form a new starting solution (in a manner reminiscent of genetic algorithms). Computational results are reported on sets of Euclidean problems with different characteristics.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie hier...