A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design
From MaRDI portal
Publication:2357911
DOI10.1007/s11067-015-9284-8zbMath1364.90375OpenAlexW2059743164MaRDI QIDQ2357911
Mohsen Momeni, Mohammadreza Sarmadi
Publication date: 20 June 2017
Published in: Networks and Spatial Economics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11067-015-9284-8
genetic algorithmhybrid algorithmslocal branchingrelaxation induced neighborhood searchcapacitated multicommodity network design problem
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Related Items
MIP Neighborhood Search Heuristics for a Capacitated Fixed-Charge Network Design Problem, Reliable intermodal freight network expansion with demand uncertainties and network disruptions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A branch and bound algorithm for bi-level discrete network design problem
- Capacity consumption analysis using heuristic solution method for under construction railway routes
- Heuristic algorithms for solving an integrated dynamic center facility location -- network design model
- Robust optimization model for a dynamic network design problem under demand uncertainty
- Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
- A local branching heuristic for the capacitated fixed-charge network design problem
- Local branching
- A survey on Benders decomposition applied to fixed-charge network design problems
- Exploring relaxation induced neighborhoods to improve MIP solutions
- A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
- A branch-and-cut algorithm for capacitated network design problems
- Sustainability SI: bikeway network design model for recreational bicycling in scenic areas
- A first multilevel cooperative algorithm for capacitated multicommodity network design
- An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions
- Tuning an Algorithm Using Design of Experiments
- Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search
- Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
- A Simplex-Based Tabu Search Method for Capacitated Network Design
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- Capacitated Network Design—Polyhedral Structure and Computation
- Introduction to evolutionary computing
- Using experimental design to find effective parameter settings for heuristics
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
