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
    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...