Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    OR spectrum 17 (1995), S. 55-66 
    ISSN: 1436-6304
    Keywords: Local search ; simulated annealing ; tabu search ; genetic algorithms ; machine learning ; knowledge based information systems ; Lokale Suche ; Simulated Annealing ; Tabu Search ; Genetische Algorithmen ; Maschinelles Lernen ; Wissensbasierte Informationssysteme
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Zusammenfassung Aus drei Gründen stellen wir diesem Sonderheft „Applied Local Search“ ein erweitertes Vorwort voran. Erstens sollen die mittlerweile bereits als klassisch zu bezeichnenden Strukturen und Ideen von dem, was derzeit unter lokaler Suche verstanden wird, vorgestellt werden. Simulated Annealing, Tabu Search and Genetische Algorithmen werden somit in ihren Grandelementen beschrieben, wobei der Schwerpunkt bewußt auf Tabu Search liegt, das sich derzeit als beste Strategie zur Lösung kombinatorischer Optimierungsprobleme etabliert hat. Neuere und mittlerweile sehr erfolgreiche aber immer noch wenig bekannte Ideen, wie die Reverse Elimination Methode und Ejection Chains, werden ebenfalls im Rahmen von Tabu Search vorgestellt. Zweites Anliegen ist, die Einbettung von lokalen Suchverfahren in einem allgemeineren Kontext wissensbasierter Informationssysteme zu beschreiben. Lokale Suche wird dabei als ein Paradigma maschinellen Lernens betrachtet. Schließlich soll dieses Vorwort ebenfalls einen kurzen Überblick der in diesem Heft enthaltenen Arbeiten geben und sie aufgrund der Verfahren und Modelle gruppieren.
    Notes: Abstract The idea of this extended foreword to the special issue on applied local search is threefold. Firstly, we provide a brief and fundamental description of what is nowadays called local search. Components which have meanwhile become an integral part of the classical aspects on simulated annealing, tabu search and genetic algorithms are reviewed. Furthermore, today tabu search can be considered as the major pillar of local search. Hence, attention is drawn to a couple of tabu search issues more recently developed such as the reverse elimination method and ejection chains. Secondly, local search based knowledge engineering is developed to constitute a substantial part of knowledge based information systems. Within this general setting local search will be considered as one particular paradigm of machine learning. Thirdly, we are going to introduce what is considered to be the main subject of this issue, local search applications. We briefly embed the contents of the subsequent papers and group them with respect to their particular methods and models within the above mentioned framework.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 63 (1996), S. 253-275 
    ISSN: 1572-9338
    Keywords: Traveling purchaser problem ; heuristics ; tabu search
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Tabu search is a metastrategy for guiding known heuristics to overcome local optimality with a large number of successful applications reported in the literature. In this paper we investigate two dynamic strategies, the reverse elimination method and the cancellation sequence method. The incorporation of strategic oscillation as well as a combination of these methods are developed. The impact of the different methods is shown with respect to the traveling purchaser problem, a generalization of the classical traveling salesman problem. The traveling purchaser problem is the problem of determining a tour of a purchaser buying several items in different shops by minimizing the total amount of travel and purchase costs. A comparison of the tabu search strategies with a simulated annealing approach is presented, too.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Journal of heuristics 2 (1997), S. 217-244 
    ISSN: 1572-9397
    Keywords: production/scheduling-line balancing ; heuristic ; tabu search
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper heuristics for Type 1 and Type 2 of the Simple Assembly Line Balancing Problem (SALBP) are described. Type 1 of SALBP (SALBP-1) consists of assigning tasks to work stations such that the number of stations is minimized for a given production rate whereas Type 2 (SALBP-2) is to maximize the production rate, or equivalently, to minimize the sum of idle times for a given number of stations. In both problem types, precedence constraints between the tasks have to be considered. We describe bidirectional and dynamic extensions to heuristic priority rules widely used for SALBP-1. For the solution of SALBP-2 we present search methods which involve the repetitive application of procedures for SALBP-1. Furthermore, improvement procedures for SALBP-2 are developed and combined with tabu search, a recent strategy to overcome local optimality. Several optional elements of tabu search are discussed. Finally, the application of a nontraditional tabu search approach to solve SALBP-1 is investigated. Computational experiments validate the effectiveness of our new approaches.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...