On the public citation graph
Hybrid Discrete Particle Swarm Optimization for Bi-level Network Design Incorporating Dynamic Project Utilities
0 signed · 53 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/nav.10026openalex-snapshot
Using hybrid metaheuristics for the one‐way and two‐way network design problem
inferredcites →https://doi.org/10.1007/11816102_11openalex-snapshot
An Improved Particle Swarm Optimization Algorithm with Disturbance Term
inferredcites →https://doi.org/10.1007/s11067-012-9173-3openalex-snapshot
A Branch and Bound Algorithm for Bi-level Discrete Network Design Problem
inferredcites →https://doi.org/10.1007/s11116-004-8246-7openalex-snapshot
Application of Ant System to network design problem
inferredcites →https://doi.org/10.1016/0041-1647(74)90014-8openalex-snapshot
Transport network optimization in the Dutch integral transportation study
inferredcites →https://doi.org/10.1016/0041-1647(75)90030-1openalex-snapshot
An efficient approach to solving the road network equilibrium traffic assignment problem
inferredcites →https://doi.org/10.1016/0191-2615(79)90003-1openalex-snapshot
Formulating and solving the network design problem by decomposition
inferredcites →https://doi.org/10.1016/0191-2615(79)90004-3openalex-snapshot
Continuous equilibrium network design models
inferredcites →https://doi.org/10.1016/0191-2615(82)90040-6openalex-snapshot
Approximate algorithms for the discrete network design problem
inferredcites →https://doi.org/10.1016/j.advengsoft.2011.07.005openalex-snapshot
Optimizing reserve capacity of urban road networks in a discrete Network Design Problem
inferredcites →https://doi.org/10.1016/j.amc.2006.09.098openalex-snapshot
Particle swarm and ant colony algorithms hybridized for improved continuous optimization
inferredcites →https://doi.org/10.1016/j.chaos.2006.09.063openalex-snapshot
A dynamic inertia weight particle swarm optimization algorithm
inferredcites →https://doi.org/10.1016/j.compbiolchem.2007.10.001openalex-snapshot
Hybrid particle swarm optimization and tabu search approach for selecting genes for tumor classification using gene expression data
inferredcites →https://doi.org/10.1016/j.ejor.2006.07.038openalex-snapshot
Hybrid meta-heuristic algorithms for solving network design problem
inferredcites →https://doi.org/10.1016/j.ejor.2013.01.001openalex-snapshot
A review of urban transportation network design problems
inferredcites →https://doi.org/10.1016/j.ejor.2015.05.039openalex-snapshot
Integration of selecting and scheduling urban road construction projects as a time-dependent discrete network design problem
inferredcites →https://doi.org/10.1016/j.ejor.2020.02.016openalex-snapshot
A stochastic programming model with endogenous and exogenous uncertainty for reliable network design under random disruption
inferredcites →https://doi.org/10.1016/j.ejor.2024.11.021openalex-snapshot
Resilient transportation network design with disruption uncertainty and lead times
inferredcites →https://doi.org/10.1016/j.fss.2020.09.007openalex-snapshot
A multi-objective robust possibilistic programming approach to sustainable public transportation network design
inferredcites →https://doi.org/10.1016/j.ijepes.2008.04.001openalex-snapshot
Optimum cost of generation for maximum loadability limit of power system using hybrid particle swarm optimization
inferredcites →https://doi.org/10.1016/j.jksus.2011.03.001openalex-snapshot
Application of particle swarm optimization to transportation network design problem
inferredcites →https://doi.org/10.1016/j.proeng.2016.01.259openalex-snapshot
Continuous Transportation Network Design Problem Based on Bi-level Programming Model
inferredcites →https://doi.org/10.1016/j.psep.2022.03.048openalex-snapshot
A pareto-based multi-objective network design approach for mitigating the risk of hazardous materials transportation
inferredcites →https://doi.org/10.1016/j.rtbm.2020.100462openalex-snapshot
Tactical network planning and design in multimodal transportation – A systematic literature review
inferredcites →https://doi.org/10.1016/j.trb.2013.01.006openalex-snapshot
Global optimization methods for the discrete network design problem
inferredcites →https://doi.org/10.1016/j.trb.2014.09.007openalex-snapshot
Benders Decomposition for Discrete–Continuous Linear Bilevel Problems with application to traffic network design
inferredcites →https://doi.org/10.1016/j.trb.2018.02.013openalex-snapshot
Transportation network design for maximizing flow-based accessibility
inferredcites →https://doi.org/10.1016/j.trb.2020.02.011openalex-snapshot
An exact algorithm for inland container transportation network design
inferredcites →https://doi.org/10.1016/j.trb.2023.102805openalex-snapshot
Humanitarian transportation network design via two-stage distributionally robust optimization
inferredcites →https://doi.org/10.1016/j.trc.2024.104967openalex-snapshot
A composite transportation network design problem with land-air coordinated operations
inferredcites →https://doi.org/10.1016/j.tre.2011.02.001openalex-snapshot
A single-level mixed integer linear formulation for a bi-level discrete network design problem
inferredcites →https://doi.org/10.1016/j.tre.2022.102918openalex-snapshot
Large-scale multimodal transportation network models and algorithms-Part II: Network capacity and network design problem
inferredcites →https://doi.org/10.1016/j.treng.2024.100247openalex-snapshot
Network design and vehicle routing problems in road transport systems: Integrating models and algorithms
inferredcites →https://doi.org/10.1016/j.trpro.2016.05.376openalex-snapshot
The Application of the Artificial Intelligence Methods for Planning of the Development of the Transportation Network
inferredcites →https://doi.org/10.1016/s0191-2615(97)00020-9openalex-snapshot
Using decomposition in large-scale highway network design with a quasi-optimization heuristic
inferredcites →https://doi.org/10.1061/(asce)0733-947x(2000)126:2(115)openalex-snapshot
Genetic-Algorithms-Based Approach for Bilevel Programming Models
inferredcites →https://doi.org/10.1068/a050519openalex-snapshot
Optimal Network Problem: A Branch-and-Bound Algorithm
inferredcites →https://doi.org/10.1080/01441649808717016openalex-snapshot
Models and algorithms for road network design: a review and some new developments
inferredcites →https://doi.org/10.1080/19427867.2016.1227531openalex-snapshot
Origin-destination-based truncated quadratic programming algorithm for traffic assignment problem
inferredcites →https://doi.org/10.1080/19427867.2020.1750767openalex-snapshot
A cuckoo search based approach to design sustainable transit network
inferredcites →https://doi.org/10.1080/19427867.2023.2166212openalex-snapshot
Incorporating travel time means and standard deviations into transportation network design problem: a hybrid method based on column generation and Lagrangian relaxation
inferredcites →https://doi.org/10.1080/23249935.2013.787557openalex-snapshot
A heuristic methodology to tackle the Braess Paradox detecting problem tailored for real road networks
inferredcites →https://doi.org/10.1109/4235.985692openalex-snapshot
The particle swarm - explosion, stability, and convergence in a multidimensional complex space
inferredcites →https://doi.org/10.1109/mhs.1995.494215openalex-snapshot
A new optimizer using particle swarm theory
inferredcites →https://doi.org/10.1109/tac.1982.1102873openalex-snapshot
Topological optimization of networks: A nonlinear mixed integer model employing generalized Benders decomposition
inferredcites →https://doi.org/10.1109/tevc.2004.826069openalex-snapshot
A Cooperative Approach to Particle Swarm Optimization
inferredcites →https://doi.org/10.1111/j.1435-5597.1994.tb00606.xopenalex-snapshot
NETWORK DESIGN OF ONE‐WAY STREETS WITH SIMULATED ANNEALING
inferredcites →https://doi.org/10.1287/opre.46.2.247openalex-snapshot
Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound
inferredcites →https://doi.org/10.1287/trsc.18.1.1openalex-snapshot
Network Design and Transportation Planning: Models and Algorithms
inferredcites →https://doi.org/10.1287/trsc.25.3.215openalex-snapshot
A Network Design Algorithm Using a Stochastic Incremental Traffic Assignment Approach
inferredcites →https://doi.org/10.1287/trsc.9.3.183openalex-snapshot
An Algorithm for the Discrete Network Design Problem
inferredcites →https://doi.org/10.1504/ijlsm.2013.055561openalex-snapshot
A hybrid meta-heuristic algorithm for solving real-life transportation network design problems
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.