This study introduces a Flex-Route Transit (FRT) system that combines the cost-efficiency of conventional public transport with the flexibility of demand-responsive services. We formulate a Mixed-Integer Linear Programming (MILP) model, and adapt valid inequalities to a multi-vehicle context to enhance computational performance. To address the NP-hard nature of the problem, we design greedy and neighborhood search heuristics to generate high-quality initial solutions for the use of a commercial solver (CPLEX). A Tabu Search algorithm is further applied for parameter tuning across different demand scenarios. Using data from a case study in Iran, we demonstrate the model’s ability to maintain service quality while reducing average waiting times under varying demand levels. The results validate the efficiency of the proposed methods in producing scalable and practical solutions for the FRT. Finally, we perform Sobol sensitivity analysis to find the most impactful parameters.
Shahin, Reza. Capacitated flex-route transit optimization through mathematical programming with enhanced heuristic solutions. // Public Transport. – 2026. – DOI: 10.1007/s12469-026-00433-1. – URL: http://link.springer.com/openurl/fulltext?id=doi:10.1007/s12469-026-00433-1
Shahin & Reza (2026). Capacitated flex-route transit optimization through mathematical programming with enhanced heuristic solutions. Public Transport. https://doi.org/10.1007/s12469-026-00433-1
Shahin and Reza. “Capacitated flex-route transit optimization through mathematical programming with enhanced heuristic solutions.” Public Transport, 2026. doi:10.1007/s12469-026-00433-1.
@article{Shahin2026,
title = {Capacitated flex-route transit optimization through mathematical programming with enhanced heuristic solutions},
author = {Shahin and Reza},
journal = {Public Transport},
year = {2026},
doi = {10.1007/s12469-026-00433-1},
url = {http://link.springer.com/openurl/fulltext?id=doi:10.1007/s12469-026-00433-1}
}
In this paper, we consider cost-sharing problems defined on rooted trees. We refer to these problems as cost-tree problems and to the induced transferable utility cooperative games as irrigation games. We introduce a formal notion of...
In this paper, we focus on nonlinear programming problems with cardinality constraints that restrict the number of nonzero components of the decision vector. We start with a straightforward mixed-integer programming reformulation....
Portfolio selection is a critical issue in financial management under uncertainty. In this paper, we propose a complex approach for portfolio selection with quantile return approximation. In particular, we propose a practical workflow...
The transcendental logarithmic (translog) production function is recognised as a flexible functional form for modelling production processes. It accommodates varying elasticities of input substitution and diverse types of...
This study investigates mothership-drone route determination using two optimization approaches: a Mixed Integer Linear Programming (MILP) model based on a discrete hexagonal grid, and a Mixed Integer Nonlinear Programming (MINLP) model...