Seguir
Vahid Mahmoodian
Vahid Mahmoodian
Email confirmado em mail.usf.edu
Título
Citado por
Citado por
Ano
An Ant Colony Algorithm (ACA) for solving the new integrated model of job shop scheduling and conflict-free routing of AGVs
M Saidi-Mehrabad, S Dehnavi-Arani, F Evazabadian, V Mahmoodian
Computers & Industrial Engineering 86, 2-13, 2015
2282015
Strategic and operational supply chain network design to reduce carbon emission considering reliability and robustness
D Rahmani, V Mahmoodian
Journal of Cleaner Production 149, 607-620, 2017
532017
Non-myopic dynamic routing of electric taxis with battery swapping stations
HR Sayarshad, V Mahmoodian, HO Gao
Sustainable Cities and Society 57, 102113, 2020
512020
A modified genetic algorithm for the capacitated competitive facility location problem with the partial demand satisfaction
MM Nasiri, V Mahmoodian, A Rahbari, S Farahmand
Computers & Industrial Engineering 124, 435-448, 2018
462018
Automated flight planning of high-density urban air mobility
H Tang, Y Zhang, V Mohmoodian, H Charkhgard
Transportation Research Part C: Emerging Technologies 131, 103324, 2021
422021
Multi-objective robust optimization model for social responsible closed-loop supply chain solved by non-dominated sorting genetic algorithm
H Saffari, A Makui, V Mahmoodian, MS Pishvaee
Journal of industrial and systems engineering 8 (3), 42-58, 2015
382015
A novel intelligent particle swarm optimization algorithm for solving cell formation problem
V Mahmoodian, A Jabbarzadeh, H Rezazadeh, F Barzinpour
Neural Computing and Applications 31, 801-815, 2019
292019
An intelligent method for dynamic distribution of electric taxi batteries between charging and swapping stations
HR Sayarshad, V Mahmoodian
Sustainable Cities and Society 65, 102605, 2021
242021
Hybrid rebalancing with dynamic hubbing for free-floating bike sharing systems
V Mahmoodian, Y Zhang, H Charkhgard
International Journal of Transportation Science and Technology 11 (3), 636-652, 2022
132022
Query batching optimization in database systems
M Eslami, V Mahmoodian, I Dayarian, H Charkhgard, Y Tu
Computers & Operations Research 121, 104983, 2020
122020
Multi-objective Optimization Based Algorithms for Solving Mixed Integer Linear Minimum Multiplicative Programs
V Mahmoodian, H Charkhgard, Y Zhang
Computers & Operations Research, 0
12*
Dynamic inventory routing and pricing problem with a mixed fleet of electric and conventional urban freight vehicles
HR Sayarshad, V Mahmoodian, N Bojović
Sustainability 13 (12), 6703, 2021
62021
A new mathematical model for integrated production planning and scheduling problem in capacitated flexible flow shop with sequence-dependent setups
R Ramezanian, S Fallah Sanami, V Mahmoodian
Scientia Iranica, 2017
62017
A criterion space branch-and-cut algorithm for mixed integer bilinear maximum multiplicative programs
V Mahmoodian, I Dayarian, P Ghasemi Saghand, Y Zhang, H Charkhgard
INFORMS Journal on Computing 34 (3), 1453-1470, 2022
32022
Design of a Hybrid Rebalancing Strategy to Improve Level of Service of FreeFloating Bike Sharing Systems
V Mahmoodian, Y Zhang, H Charkhgard
32019
AquaNutriOpt: Optimizing nutrients for controlling harmful algal blooms in Python—A case study of Lake Okeechobee
A Khanal, V Mahmoodian, OM Tarabih, J Hua, ME Arias, Q Zhang, ...
Environmental Modelling & Software 176, 106025, 2024
12024
Solving multiplicative programs by binary-encoding the multiplication operation
PG Saghand, F Rigterink, V Mahmoodian, H Charkhgard
Computers & Operations Research 159, 106340, 2023
12023
Sus-tainability 2021, 13, x
HR Sayarshad, V Mahmoodian, N Bojovic
s Note: MDPI stays neu-tral with regard to jurisdictional claims in …, 2021
12021
Hybrid Rebalancing with Dynamic Hubbing for Free-floating Bike Sharing Using Multi-objective Simulation Optimization
V Mahmoodiana, Y Zhang, H Charkhgarda
12019
FPBH: A feasibility pump based heuristic for multi-objective mixed integer linear programming (vol 112, 104760, 2019)
F Tricoire, V Mahmoodian, H Charkhgard
COMPUTERS & OPERATIONS RESEARCH 140, 2022
2022
O sistema não pode efectuar a operação agora. Tente mais tarde.
Artigos 1–20