Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
From MaRDI portal
Publication:702717
DOI10.1023/B:ANOR.0000039515.90453.1dzbMath1067.90014OpenAlexW2089233175MaRDI QIDQ702717
Teodor Gabriel Crainic, Ilfat Ghamlouche, Michel Gendreau
Publication date: 17 January 2005
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:anor.0000039515.90453.1d
tabu searchmeta-heuristicscycle-based neighbourhoodsfixed-charge capacitated multicommodity network designPath relinking
Programming involving graphs or networks (90C35) 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, A capacity scaling heuristic for the multicommodity capacitated network design problem, Near real-time loadplan adjustments for less-than-truckload carriers, TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem, Dantzig-Wolfe decomposition approach to the vehicle assignment problem with demand uncertainty in a hybrid hub-and-spoke network, A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem, Double resource optimization for a robust computer network subject to a transmission budget, A parallel local search framework for the fixed-charge multicommodity network flow problem, 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, A hybrid meta-heuristic for the batching problem in just-in-time flow shops, Design of sensor networks for chemical plants based on meta-heuristics, Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods, Benders, metric and cutset inequalities for multicommodity capacitated network design, A unified framework for population-based metaheuristics, A three-phase heuristic algorithm for fixed-charge capacitated material flow network design with input/output points location, Stochastic multi-commodity network design: the quality of deterministic solutions, A hybrid algorithm for large-scale service network design considering a heterogeneous fleet, MIP Neighborhood Search Heuristics for a Capacitated Fixed-Charge Network Design Problem, Accelerating benders decomposition with heuristicmaster problem solutions, Tabu search-based metaheuristic algorithm for software system reliability problems, Bundle methods for sum-functions with ``easy components: applications to multicommodity network design, Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design, Adaptive memory in multistart heuristics for multicommodity network design, A first multilevel cooperative algorithm for capacitated multicommodity network design, Path relinking for the vehicle routing problem, A metaheuristic for stochastic service network design, Algorithms for the non-bifurcated network design 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, Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design, 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, Scheduled Service Network Design for Freight Rail Transportation
