A modified active set algorithm for transportation discrete network design bi-level problem

DOI10.1007/s10898-015-0396-yzbMath1359.90144OpenAlexW2197746508MaRDI QIDQ506465

Panos M. Pardalos, Ximing Wang

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

zbMATH Keywords

bi-level problembinary numeral systembinary variablediscrete network designmodified active set algorithmternary numeral system

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)

Related Items (4)

Integrated intelligence of neuro-evolution with sequential quadratic programming for second-order Lane-Emden pantograph models ⋮ Designing networks with resiliency to edge failures using two-stage robust optimization ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ DESIGN OF NEURO-SWARMING HEURISTIC SOLVER FOR MULTI-PANTOGRAPH SINGULAR DELAY DIFFERENTIAL EQUATION

Uses Software

• Mathematica
• CONOPT
• CPLEX
• GAMS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Aggregation and equilibrium with multinomial logit models
• Incremental Network Optimization: Theory and Algorithms
• CONOPT—A Large-Scale GRG Code
• A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem

This page was built for publication: A modified active set algorithm for transportation discrete network design bi-level problem