A modified active set algorithm for transportation discrete network design bi-level problem
DOI10.1007/S10898-015-0396-YzbMATH Open1359.90144OpenAlexW2197746508MaRDI QIDQ506465FDOQ506465
Authors: Ximing Wang, Panos M. Pardalos
Publication date: 1 February 2017
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-015-0396-y
Recommendations
- A branch and bound algorithm for bi-level discrete network design problem
- A stochastic user equilibrium assignment problem in discrete network design problem
- Bilevel programming model and solution method for mixed transportation network design problem
- Genetic algorithm for multiuser discrete network design problem under demand uncertainty
- Bicriterion discrete equilibrium network design problem
bi-level problembinary numeral systembinary variablediscrete network designmodified active set algorithmternary numeral system
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)
Cites Work
- Network flows. Theory, algorithms, and applications.
- CONOPT—A Large-Scale GRG Code
- A note on two problems in connexion with graphs
- Title not available (Why is that?)
- A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem
- Title not available (Why is that?)
- Aggregation and equilibrium with multinomial logit models
- Incremental network optimization: theory and algorithms
Cited In (5)
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
- Integrated intelligence of neuro-evolution with sequential quadratic programming for second-order Lane-Emden pantograph models
- DESIGN OF NEURO-SWARMING HEURISTIC SOLVER FOR MULTI-PANTOGRAPH SINGULAR DELAY DIFFERENTIAL EQUATION
- Designing networks with resiliency to edge failures using two-stage robust optimization
- BO-B\&B: a hybrid algorithm based on Bayesian optimization and branch-and-bound for discrete network design problems
Uses Software
This page was built for publication: A modified active set algorithm for transportation discrete network design bi-level problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q506465)