Transformation of bi-level transit network design problem into single-objective unconstrained optimization

DOI10.1007/S11067-025-09698-8MaRDI QIDQ7286706zbMATH OpenFDO

Authors Jincheol Lee, Gyeongjun Kim, Keemin Sohn

Publication date 23 June 2026

Published in Networks and Spatial Economics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11067-025-09698-8

Mathematics Subject Classification ID

Numerical analysis (65-XX) Operations research, mathematical programming (90-XX)

Cites work

• A blood bank network design problem with integrated facility location, inventory and routing decisions
• A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
• A mixed integer formulation for multiple-route transit network design
• A penalty function method based on Kuhn-Tucker condition for solving linear bilevel programming
• A quadratic objective penalty function for bilevel programming
• A simultaneous bus route design and frequency setting problem for Tin Shui Wai, Hong Kong
• An enhanced branch-and-bound algorithm for bilevel integer linear programming
• An extended branch and bound algorithm for linear bilevel programming
• An extended Kuhn-Tucker approach for linear bilevel programming
• Bilevel programming model and solution method for mixed transportation network design problem
• Clean water network design for refugee camps
• Estimation of distribution algorithm for a class of nonlinear bilevel programming problems
• Evaluating Derivatives
• Exact penalty functions for convex bilevel programming problems.
• Exact penalty method for the nonlinear bilevel programming problem
• Exclusive bus lane network design: a perspective from intersection operational dynamics
• Existence of solutions to bilevel variational problems in Banach spaces
• Foundations of bilevel programming
• scientific article; zbMATH DE number 1765103 (Why is no real title available?)
• Hybrid evolutionary metaheuristics for concurrent multi-objective design of urban road and public transit networks
• Multi-objective rapid transit network design with modal competition: the case of Concepción, Chile
• New necessary optimality conditions in optimistic bilevel programming
• On Nonconvex Optimization for Machine Learning
• On the Karush-Kuhn-Tucker reformulation of the bilevel optimization problem
• Pareto-optimal sustainable transportation network design under spatial queuing
• Rapid transit network design considering risk aversion
• Solving bilevel programs with the KKT-approach

This page was built for publication: Transformation of bi-level transit network design problem into single-objective unconstrained optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7286706)