A tabu search with slope scaling for the multicommodity capacitated location problem with balancing requirements

DOI10.1023/A:1026102724889zbMath1039.90026MaRDI QIDQ1413762

Jean-Yves Potvin, Bernard Gendron, Patrick Soriano

Publication date: 17 November 2003

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

Full work available at URL: https://doi.org/10.1023/a:1026102724889

zbMATH Keywords

tabu search; multicommodity capacitated location with balancing requirements; slope scaling

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

90B80: Discrete location and assignment

Related Items

Accelerating benders decomposition with heuristicmaster problem solutions, An exact approach for the multicommodity network optimization problem with a step cost function, Metaheuristics: A Canadian Perspective, 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, Lower and upper bounds for a capacitated plant location problem with multicommodity flow, Integer linear programming models for grid-based light post location problem, Separating tight metric inequalities by bilevel programming, A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements, Bicriteria optimization model for locating maritime container depots: application to the Port of Valencia, Lower and upper bounds for a two-stage capacitated facility location problem with handling costs, COLE: a new heuristic approach for fixed charge problem computational results