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

DOI10.1023/A:1026102724889zbMath1039.90026OpenAlexW223119275MaRDI 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 searchmulticommodity capacitated location with balancing requirementsslope scaling

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (12)

Bicriteria optimization model for locating maritime container depots: application to the Port of Valencia ⋮ A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements ⋮ Integer linear programming models for grid-based light post location problem ⋮ Metaheuristics: A Canadian Perspective ⋮ Separating tight metric inequalities by bilevel programming ⋮ A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations ⋮ Accelerating benders decomposition with heuristicmaster problem solutions ⋮ Positioning empty containers among multiple ports with leasing and purchasing considerations ⋮ Lower and upper bounds for a two-stage capacitated facility location problem with handling costs ⋮ Lower and upper bounds for a capacitated plant location problem with multicommodity flow ⋮ An exact approach for the multicommodity network optimization problem with a step cost function ⋮ COLE: a new heuristic approach for fixed charge problem computational results

This page was built for publication: A tabu search with slope scaling for the multicommodity capacitated location problem with balancing requirements