| A Simplex-based simulated annealing algorithm for node-arc capacitated multicommodity network design M Yaghini, M Momeni, M Sarmadi Applied Soft Computing 12 (9), 2997-3003, 2012 | 42 | 2012 |
| Solving train formation problem using simulated annealing algorithm in a simplex framework M Yaghini, M Momeni, M Sarmadi Journal of Advanced Transportation 48 (5), 402-416, 2014 | 30 | 2014 |
| An improved local branching approach for train formation planning M Yaghini, M Momeni, M Sarmadi Applied Mathematical Modelling 37 (4), 2300-2307, 2013 | 29 | 2013 |
| An efficient heuristic algorithm for the capacitated median problem M Yaghini, M Momeni, M Sarmadi, HR Ahadi 4OR 11 (3), 229-248, 2013 | 12 | 2013 |
| DIMMA-Implemented Metaheuristics for Finding Shortest Hamiltonian Path Between Iranian Cities Using Sequential DOE Approach for Parameters Tuning M Yaghini, M Momeni, M Sarmadi International Journal of Applied Metaheuristic Computing (IJAMC) 2 (2), 74-92, 2011 | 4 | 2011 |
| Finding the Shortest Hamiltonian Path for Iranian Cities Using Hybrid Simulated Annealing and Ant Colony Optimization Algorithms M Yaghini, M Momeni, M Sarmadi INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION RESEARCH …, 2011 | 2 | 2011 |
| DOE–based parameter tuning for local branching algorithm M Yaghini, M Momeni, M Sarmadi International Journal of Metaheuristics 2 (1), 1-14, 2012 | 1 | 2012 |
| A DIMMA-Based Memetic Algorithm for 0-1 Multidimensional Knapsack Problem Using DOE Approach for Parameter Tuning M Yaghini, M Momeni, M Sarmadi International Journal of Applied Metaheuristic Computing (IJAMC) 3 (2), 43-55, 2012 | | 2012 |
| FINDING THE SHORTEST HAMILTONIAN PATH FOR IRANIAN CITIES, USING TABU SEARCH AND MEMETIC ALGORITHMS M YAGHINI, M MOMENI, M SARMADI JOURNAL OF TRANSPORTATION ENGINEERING 2 (26), 0-0, 2011 | | 2011 |
Masoud YaghiniIran University of Science and TechnologyVerified email at iust.ac.ir
