A tabu search procedure for multicommodity location/allocation with balancing requirements

DOI10.1007/BF02023001zbMath0775.90289OpenAlexW2068267372MaRDI QIDQ2367013

Patrick Soriano, Michel Toulouse, Teodor Gabriel Crainic, Michel Gendreau

Publication date: 16 August 1993

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02023001

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Bicriteria optimization model for locating maritime container depots: application to the Port of Valencia, Dantzig-Wolfe decomposition approach to the vehicle assignment problem with demand uncertainty in a hybrid hub-and-spoke network, A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements, Optimisation of transportation service network using \(\kappa\)-node large neighbourhood search, Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements, A parallel branch-and-bound algorithm for multicommodity location with balancing requirements, Diversification strategies in tabu search algorithms for the maximum clique problem, Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements, Metaheuristics: A bibliography, Parallel local search, Tabu search for the multilevel generalized assignment problem, Flexible job-shop scheduling with transportation resources, Metaheuristics: A Canadian Perspective, Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem, Unnamed Item, A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations, Positioning empty containers among multiple ports with leasing and purchasing considerations, Planning models for freight transportation, Driving tabu search with case-based reasoning, Some personal views on the current state and the future of locational analysis, Kohonen maps for solving a class of location-allocation problems, Metaheuristics in combinatorial optimization

Cites Work

• Algorithms for the maximum satisfiability problem
• Models for multimode multicommodity location problems with interdepot balancing requirements
• A new heuristic method for the flow shop sequencing problem
• Tabu search techniques. A tutorial and an application to neural networks
• A branch-and-bound method for multicommodity location with balancing requirements
• Future paths for integer programming and links to artificial intelligence
• Tabu Search Applied to the Quadratic Assignment Problem
• Dual-Ascent Procedures for Multicommodity Location-Allocation Problems with Balancing Requirements
• A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design