Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
From MaRDI portal
Publication:702717
DOI10.1023/B:ANOR.0000039515.90453.1dzbMath1067.90014MaRDI QIDQ702717
Michel Gendreau, Teodor Gabriel Crainic, Ilfat Ghamlouche
Publication date: 17 January 2005
Published in: Annals of Operations Research (Search for Journal in Brave)
tabu search; meta-heuristics; cycle-based neighbourhoods; fixed-charge capacitated multicommodity network design; Path relinking
90C35: Programming involving graphs or networks
90C59: Approximation methods and heuristics in mathematical programming
90B10: Deterministic network models in operations research
Related Items
Adaptive memory in multistart heuristics for multicommodity network design, Benders, metric and cutset inequalities for multicommodity capacitated network design, A unified framework for population-based metaheuristics, A metaheuristic for stochastic service network design, A capacity scaling heuristic for the multicommodity capacitated network design problem, A hybrid meta-heuristic for the batching problem in just-in-time flow shops, Tabu search-based metaheuristic algorithm for software system reliability problems, 0-1 reformulations of the multicommodity capacitated network design problem, A local branching heuristic for the capacitated fixed-charge network design problem, Algorithms for the non-bifurcated network design problem, TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem, A first multilevel cooperative algorithm for capacitated multicommodity network design, Path relinking for the vehicle routing problem, Linear programming and Lagrangian relaxation heuristics for designing a material flow network on a block layout, A heuristic two-phase solution approach for the multi-objective dial-a-ride problem, A three-phase heuristic algorithm for fixed-charge capacitated material flow network design with input/output points location
