Library

X
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
    Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements (1995)
    Springer
    OR spectrum 17 (1995), S. 113-123 
    Details
    ISSN: 1436-6304
    Keywords: Tabu search methods ; Parallel algorithms ; Synchronous strategies ; Multicommodity location-allocation with balancing requirements ; Tabu search ; parallele Algorithmen ; synchrone Strategien ; Mehrgüter-Location Allocation-Probleme (Standort-Einzugsbereich-Probleme) mit Ausgleichsbedingungen
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Zusammenfassung Die Arbeit befaßt sich mit synchronen Parallelisierungsstrategien für Tabu Search. Wir zeigen die vielversprechendsten Parallelisierungsansätze auf und beurteilen deren Auswirkungen auf Leistungsverhalten und Lösungsgüte einiger wesentlicher Parameter; Länge der Synchronisationsschritte, Anzahl der Prozessoren, Art der Kommunikationsbeziehungen etc. Die Parallelisierungsansätze wurden implementiert und einander bei Anwendung eines Tabu Search-Verfahrens für Mehrgüter-Standort-Einzugsbereich-Probleme mit Ausgleichsbedingungen gegenübergestellt.
    Notes: Abstract We study and compare synchronous parallelization strategies for tabu search. We identify the most promising parallelization approaches, and evaluate the impact on performance and solution quality of some important algorithmic design parameters: length of the synchronization steps, number of processors, handling of exchanged information, etc. Parallelization approaches are implemented and compared by using a tabu search algorithm for multicommodity location-allocation problems with balancing requirements.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01719254
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements (1996)
    Springer
    Annals of operations research 63 (1996), S. 277-299 
    Details
    ISSN: 1572-9338
    Keywords: Tabu search methods ; parallel algorithms ; asynchronous strategies ; multicommodity location-allocation with balancing requirements
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract We study and compare asynchronous parallelization strategies for tabu search, and evaluate the impact on performance and solution quality of some important algorithmic design parameters: number of processors, handling of exchanged information, etc. Parallelization approaches are implemented and compared by using a tabu search algorithm for multicommodity location-allocation problems with balancing requirements.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02125458
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Centralized and decentralized stochastic routing models in telecommunication networks (1993)
    Springer
    Telecommunication systems 1 (1993), S. 133-148 
    Details
    ISSN: 1572-9451
    Source: Springer Online Journal Archives 1860-2000
    Topics: Electrical Engineering, Measurement and Control Technology
    Notes: Abstract With the advent of non-hierarchical routing in circuit-switched telecommunication networks, on-line routing policies have been developed with the objective of optimizing some measure of gain or performance. These policies are decentralized. However, traditional planning models are centralized models. We present a decentralized routing model to be used in network planning. We compare it theoretically and empirically with a centralized multicommodity flow model previously presented. The two models are solved by the same type of algorithm, a convex simplex implementation, adapted differently according to the model. Comparative results between planning models reproducing the two policies are discussed.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02136158
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Foreword (1995)
    Springer
    Annals of operations research 61 (1995), S. v 
    Details
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02098278
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    Diversification strategies in tabu search algorithms for the maximum clique problem (1996)
    Springer
    Annals of operations research 63 (1996), S. 189-207 
    Details
    ISSN: 1572-9338
    Keywords: Tabu search ; diversification ; maximum clique ; combinatorial optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract The purpose of this study is to develop some understanding of the benefits that can be derived from the inclusion of diversification strategies in tabu search methods. To do so, we discuss the implementation of various diversification strategies in several tabu search heuristics developed for the maximum clique problem. Computational results on a large set of randomly generated test problems are reported and compared to assess the impact of these techniques on solution quality and running time.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02125454
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    A Constraint Programming Framework for Local Search Methods (1999)
    Springer
    Journal of heuristics 5 (1999), S. 255-279 
    Details
    ISSN: 1572-9397
    Keywords: local search ; constraint programming ; neighborhood model ; interface constraints ; tabu search ; traveling salesman problem with time windows ; personnel scheduling problem
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We propose in this paper a novel integration of local search algorithms within a constraint programming framework for combinatorial optimization problems, in an attempt to gain both the efficiency of local search methods and the flexibility of constraint programming while maintaining a clear separation between the constraints of the problem and the actual search procedure. Each neighborhood exploration is performed by branch-and-bound search, whose potential pruning capabilities open the door to more elaborate local moves, which could lead to even better approximate results. Two illustrations of this framework are provided, including computational results for the traveling salesman problem with time windows. These results indicate that it is one order of magnitude faster than the customary constraint programming approach to local search and that it is competitive with a specialized local search algorithm.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1009694016861
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    Efficient heuristics for the design of ring networks (1995)
    Springer
    Telecommunication systems 4 (1995), S. 177-188 
    Details
    ISSN: 1572-9451
    Source: Springer Online Journal Archives 1860-2000
    Topics: Electrical Engineering, Measurement and Control Technology
    Notes: Abstract In telecommunications, the Ring Design Problem (RDP) lies at the heart ofmetropolitan area network design. We propose an integer programming formulation for the RDP, as well as several ring construction and post-optimization heuristics. These heuristics are tested and compared on a series of test problems.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02110085
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    An algorithm for network dimensioning under reliability considerations (1992)
    Springer
    Annals of operations research 36 (1992), S. 263-274 
    Details
    ISSN: 1572-9338
    Keywords: Network dimensioning ; telecommunications ; reliability ; circuit switching ; routing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract In this paper we introduce a new methodology to adjust link capacities in circuit switched networks taking into account the costing policy and reliability considerations. This methodology, which is an extension of previous work on reliability evaluation using routing models, is based on a cyclic decomposition algorithm which alternates between a routing subproblem and a link capacity adjustment subproblem. The proposed procedure, which is shown to converge to a global optimum for the dimensioning/routing problem, has been tested on a 14 undirected arc problem for various levels of link failure probability. The numerical results are extremely satisfactory and they demonstrate the usefulness of the proposed method for proper network dimensioning.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02094333
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 9
    Electronic Resource
    Electronic Resource
    Solving the maximum clique problem using a tabu search approach (1993)
    Springer
    Annals of operations research 41 (1993), S. 385-403 
    Details
    ISSN: 1572-9338
    Keywords: Maximum clique ; tabu search ; probabilistic tabu ; random graph generator ; approximate methods
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract We describe two variants of a tabu search heuristic, a deterministic one and a probabilistic one, for the maximum clique problem. This heuristic may be viewed as a natural alternative implementation of tabu search for this problem when compared to existing ones. We also present a new random graph generator, the $$\hat p$$ -generator, which produces graphs with larger clique sizes than comparable ones obtained by classical random graph generating techniques. Computational results on a large set of test problems randomly generated with this new generator are reported and compared with those of other approximate methods.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02023002
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 10
    Electronic Resource
    Electronic Resource
    A tabu search procedure for multicommodity location/allocation with balancing requirements (1993)
    Springer
    Annals of operations research 41 (1993), S. 359-383 
    Details
    ISSN: 1572-9338
    Keywords: Tabu search ; multicommodity location/allocation problems ; empty flow balancing ; container transportation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract We propose a tabu search heuristic for the location/allocation problem with balancing requirements. This problem typically arises in the context of the medium term management of a fleet of containers of multiple types, where container depots have to be selected, the assignment of customers to depots has to be established for each type of container, and the interdepot container traffic has to be planned to account for differences in supplies and demands in various zones of the geographical territory served by a container shipping company. It is modeled as a mixed integer program, which combines zero-one location variables and a multicommodity network flow structure. Extensive computational results on a set of benchmark problems and comparisons with an efficient dual ascent procedure are reported. These show that tabu search is a competitive approach for this class of problems.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02023001
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...