Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements
type: Item
instance of: scholarly article
title: Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements
zbMATH Open document ID: 0843.90067
DOI: 10.1007/BF01719254
author: Teodor Gabriel Crainic
author: Michel Toulouse
author: Michel Gendreau
published in: OR Spektrum
publication date: 1996-08-19T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 65Y05
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 853144
zbMATH Keywords: synchronous parallelization strategies for tabu search
zbMATH Keywords: multicommodity location-allocation problems
describes a project that uses: Tabu search
MaRDI profile type: Publication
cites work: A connectionist approach to the quadratic assignment problem
cites work: Q4835590
cites work: Massively parallel tabu search for the quadratic assignment problem
cites work: Models for multimode multicommodity location problems with interdepot balancing requirements
cites work: A branch-and-bound method for multicommodity location with balancing requirements
cites work: A tabu search procedure for multicommodity location/allocation with balancing requirements
cites work: A branch-and-bound algorithm for depot location and container fleet management
cites work: Future paths for integer programming and links to artificial intelligence
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: Bandwidth Packing: A Tabu Search Approach
cites work: A user's guide to tabu search
cites work: Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
cites work: Parallel iterative search methods for vehicle routing problems
full work available at URL: https://doi.org/10.1007/bf01719254
OpenAlex ID: W1997202925
Recommended article: Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements
Recommended article: Parallel Implementations Of A Branch-And-Bound Algorithm For Multicommodity Location With Balancing Requirements
Recommended article: A parallel branch-and-bound algorithm for multicommodity location with balancing requirements
Recommended article: Tabu Search With Exact Neighbor Evaluation For Multicommodity Location With Balancing Requirements
Recommended article: A tabu search with slope scaling for the multicommodity capacitated location problem with balancing requirements
Recommended article: Parallel tabu search message-passing synchronous strategies for task scheduling under precendence constraints
Recommended article: Dual-Ascent Procedures for Multicommodity Location-Allocation Problems with Balancing Requirements
Recommended article: PARALLEL OPTIMIZATION ALGORITHM FOR COMPETITIVE FACILITY LOCATION
description: scientific article; zbMATH DE number 853144