A Simplex-Based Tabu Search Method for Capacitated Network Design
From MaRDI portal
Publication:4427333
DOI10.1287/ijoc.12.3.223.12638zbMath1040.90506OpenAlexW2139575211MaRDI QIDQ4427333
Michel Gendreau, Teodor Gabriel Crainic, Judith M. Farvolden
Publication date: 28 October 2003
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.12.3.223.12638
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Related Items
A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design, A scheme for determining vehicle routes based on Arc-based service network design, The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design, Effective material flow at an assembly facility, Multimodal freight transportation planning: a literature review, A capacity scaling heuristic for the multicommodity capacitated network design problem, Near real-time loadplan adjustments for less-than-truckload carriers, A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem, An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems, Matheuristics for the single-path design-balanced service network design problem, Optimisation of transportation service network using \(\kappa\)-node large neighbourhood search, A cutting plane algorithm for the capacitated connected facility location problem, Single source single-commodity stochastic network design, The transit time constrained fixed charge multi-commodity network design problem, Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods, Avoiding unnecessary demerging and remerging of multi‐commodity integer flows, Metaheuristics: A Canadian Perspective, Benders, metric and cutset inequalities for multicommodity capacitated network design, A three-phase heuristic algorithm for fixed-charge capacitated material flow network design with input/output points location, Integrating operations research in constraint programming, Metric inequalities and the network loading problem, A Lagrangian relaxation approach for expansion of a highway network, Integrating operations research in constraint programming, Algorithms for an integer multicommodity network flow problem with node reliability considerations, Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design, A first multilevel cooperative algorithm for capacitated multicommodity network design, Algorithms for the non-bifurcated network design problem, Bundle-based relaxation methods for multicommodity capacitated fixed charge network design, Linear programming and Lagrangian relaxation heuristics for designing a material flow network on a block layout, A review of transport market modeling using game-theoretic principles, Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design, Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité, 0-1 reformulations of the multicommodity capacitated network design problem, Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design, A local branching heuristic for the capacitated fixed-charge network design problem, Directed fixed charge multicommodity network design: a cutting plane approach using polar duality, Hybridizing exact methods and metaheuristics: a taxonomy, Service network design in freight transportation, The single-node dynamic service scheduling and dispatching problem, Memetic algorithms, Scatter search for network design problem, Metaheuristics in combinatorial optimization
