Hybrid meta-heuristic algorithms for solving network design problem

DOI10.1016/j.ejor.2006.07.038zbMath1121.90024OpenAlexW2086753570MaRDI QIDQ881517

Hossain Poorzahedy, Omid M. Rouhani

Publication date: 30 May 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.07.038

zbMATH Keywords

transportationnetwork designhybrid algorithmant system

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Related Items

Hybrid evolutionary metaheuristics for concurrent multi-objective design of urban road and public transit networks ⋮ A branch and bound algorithm for bi-level discrete network design problem ⋮ Evaluating various road ownership structures and potential competition on an urban road network ⋮ Enhanced flow direction arithmetic optimization algorithm for mathematical optimization problems with applications of data clustering ⋮ Bi-objective bimodal urban road network design using hybrid metaheuristics ⋮ Solving urban transit route design problem using selection hyper-heuristics ⋮ Integration of selecting and scheduling urban road construction projects as a time-dependent discrete network design problem ⋮ Mixed network design using hybrid scatter search ⋮ Scalable algorithms for designing \(\mathrm{CO}_2\) capture and storage infrastructure ⋮ Multi-objective discrete urban road network design ⋮ A traffic restriction scheme for enhancing carpooling ⋮ Global optimization for transport network expansion and signal setting ⋮ Optimizing the selection and scheduling of multi-class projects using a Stackelberg framework ⋮ A dynamic discrete network design problem for maintenance planning in traffic networks ⋮ A survey on traffic optimization problem using biologically inspired techniques ⋮ Optimizing reserve capacity of urban road networks in a discrete network design problem ⋮ BO-B\&B: a hybrid algorithm based on Bayesian optimization and branch-and-bound for discrete network design problems ⋮ Solving constrained global optimization problems by using hybrid evolutionary computing and artificial life approaches ⋮ Solving unconstrained global optimization problems via hybrid swarm intelligence approaches ⋮ Turning restriction design in traffic networks with a budget constraint ⋮ Traffic equilibrium and charging facility locations for electric vehicles ⋮ An MPEC formulation and its cutting constraint algorithm for continuous network design problem with multi-user classes ⋮ A turning restriction design problem in urban road networks ⋮ A multi-objective integrated model for selecting, scheduling, and budgeting road construction projects ⋮ A review of transport market modeling using game-theoretic principles ⋮ An anisotropic continuum model for traffic assignment in mixed transportation networks ⋮ A meta-heuristic approach for solving the urban network design problem ⋮ A review of urban transportation network design problems

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tabu search techniques. A tutorial and an application to neural networks
• Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
• Genetic algorithms and tabu search: Hybrids for optimization
• Guidelines for the use of meta-heuristics in combinatorial optimization.
• Genetic and Nelder--Mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions.
• Heuristics for urban road network design: lane layout and signal settings
• Emerging Optimization Techniques in Production Planning and Control
• Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound
• A Network Design Algorithm Using a Stochastic Incremental Traffic Assignment Approach
• Topological optimization of networks: A nonlinear mixed integer model employing generalized Benders decomposition
• A Simulated Annealing Approach to the Network Design Problem with Variational Inequality Constraints
• Facts, Conjectures, and Improvements for Simulated Annealing
• An Evolutionary Tabu Search Algorithm And The NHL Scheduling Problem

This page was built for publication: Hybrid meta-heuristic algorithms for solving network design problem