| Refueling station location problem with traffic deviation considering route choice and demand uncertainty M Miralinaghi, Y Lou, BB Keskin, A Zarrinmehr, R Shabanpour International Journal of Hydrogen Energy 42 (5), 3335-3351, 2017 | 82 | 2017 |
| A path-based greedy algorithm for multi-objective transit routes design with elastic demand A Zarrinmehr, M Saffarzadeh, S Seyedabrishami, YM Nie Public Transport 8, 261-293, 2016 | 16 | 2016 |
| Complementarity formulation and solution algorithm for auto-transit assignment problem A Zarrinmehr, HZ Aashtiani, Y Nie, H Azizian Transportation Research Record 2673 (4), 384-397, 2019 | 9 | 2019 |
| A local search algorithm for finding optimal transit routes configuration with elastic demand A Zarrinmehr, M Saffarzadeh, S Seyedabrishami International Transactions in Operational Research 25 (5), 1491-1514, 2018 | 9 | 2018 |
| Parallelization of the Branch-and-Bound Algorithm in Transportation Discrete Network Design A Zarrinmehr, Y Shafahi Scientia Iranica 23 (2), 407-419, 2016 | 5 | 2016 |
| Surveillance camera location problem for route-flow observation in urban transportation networks: bi-level formulation and solution algorithm A Zarrinmehr, M Meshkani, S Seyedabrishami International Journal of Systems Science: Operations & Logistics 5 (4), 327-338, 2018 | 4 | 2018 |
| Transit network design problem: An expansion of the route generation algorithm I Khanzad, S Seyedabrishami, M Nazemi, A Zarrinmehr Advanced Concepts, Methodologies and Technologies for Transportation and …, 2018 | 4 | 2018 |
| Transit Routes Network Design by Greedy Prioritization of the Routes in Grid Networks A Zarrinmehr, H Moloukzade Journal of Transportation Research 20 (2), 147-160, 2023 | 3 | 2023 |
| Planning the departure of vacant transit vehicles to the median stops in a single line S Seyedabrishami, A Rahimi, A Zarrinmehr Transportation Research Procedia 25, 1317-1326, 2017 | 3 | 2017 |
| Parallelization of Ant Colony Algorithm in Transportation Discrete Network Design A Zarrinmehr Modares Civil Engineering journal 15 (2), 37-50, 2015 | 3 | 2015 |
| Accelerating the performance of parallel depth-first-search branch-and-bound algorithm in transportation network design problem A Zarrinmehr, Y Shafahi International Conference on Operations Research and Enterprise Systems 2 …, 2015 | 2 | 2015 |
| Enumeration of dominant solutions: an application in transport network design A Zarrinmehr, Y Shafahi International Journal of Transportation Engineering 1 (4), 335-348, 2014 | 2 | 2014 |
| Discrete Network Design Using Parallel Branch-and-Bound Algorithms A Zarrinmehr Sharif University of Technology, 2011 | 2 | 2011 |
| Application of A Route Expansion Algorithm for Transit Routes Design in Grid Networks I Khanzad, A Zarrinmehr, S Seyedabrishami, M Saffarzadeh International Journal of Transportation Engineering 4 (3), 179-196, 2017 | 1 | 2017 |
| The greedy algorithm for development of the network based on the lowest developing cost: the case study of Iran A Zarrinmehr, R Mohammad Hasany Modares Civil Engineering journal 23 (3), 0-0, 2023 | | 2023 |
| Greedy approach to railways network design based on least-cost block expansions-case study: Iran’s railways network R Mohammad Hasany, A Zarrinmehr International Journal of Railway Research 9 (2), 61-74, 2022 | | 2022 |
| Application of a Hill-Climbing Algorithm to Public Transportation Routes Design in Grid Networks A Zarrinmehr, H Moloukzade International Journal of Transportation Engineering 9 (2), 597-612, 2021 | | 2021 |
| A Heuristic Algorithm for Railways Network Expansion: A Case Study of Iranian Railways 67th North American meetings of the Regional Science association (NARSC), 2020 | | 2020 |
| A Hill Climbing Approach to Find Optimal Public Transit Routes Configuration A Zarrinmehr 67th North American meetings of the Regional Science association (NARSC), 2020 | | 2020 |
| Transit Routes Network Design Problem Considering Elastic Demand A Zarrinmehr Tarbiat Modares University, 2016 | | 2016 |
