Masoud Yaghini
Orcid: 0000-0002-3239-8362Affiliations:
- Iran University of Science and Technology, Tehran, Iran
According to our database1,
Masoud Yaghini
authored at least 22 papers
between 2009 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
A Bi-objective model and a branch-and-price-and-cut solution method for the railroad blocking problem in hazardous material transportation.
J. Rail Transp. Plan. Manag., 2024
2021
Efficient algorithms to minimize makespan of the unrelated parallel batch-processing machines scheduling problem with unequal job ready times.
RAIRO Oper. Res., 2021
A mathematical formulation and an LP-based neighborhood search matheuristic solution method for the integrated train blocking and shipment path problem.
Networks, 2021
2018
Optimizing headways for urban rail transit services using adaptive particle swarm algorithms.
Public Transp., 2018
2017
Train timetabling at rapid rail transit lines: a robust multi-objective stochastic programming approach.
Oper. Res., 2017
2015
J. Comb. Optim., 2015
A Cutting-Plane Neighborhood Structure for Fixed-Charge Capacitated Multicommodity Network Design Problem.
INFORMS J. Comput., 2015
Appl. Soft Comput., 2015
2013
A hybrid simulated annealing and column generation approach for capacitated multicommodity network design.
J. Oper. Res. Soc., 2013
GeneticTKM: A Hybrid Clustering Method Based on Genetic Algorithm, Tabu Search and K-Means.
Int. J. Appl. Metaheuristic Comput., 2013
Eng. Appl. Artif. Intell., 2013
Appl. Soft Comput., 2013
GOFAM: a hybrid neural network classifier combining fuzzy ARTMAP and genetic algorithm.
Artif. Intell. Rev., 2013
4OR, 2013
2012
Int. J. Metaheuristics, 2012
A DIMMA-Based Memetic Algorithm for 0-1 Multidimensional Knapsack Problem Using DOE Approach for Parameter Tuning.
Int. J. Appl. Metaheuristic Comput., 2012
A Simplex-based simulated annealing algorithm for node-arc capacitated multicommodity network design.
Appl. Soft Comput., 2012
2011
DIMMA-Implemented Metaheuristics for Finding Shortest Hamiltonian Path Between Iranian Cities Using Sequential DOE Approach for Parameters Tuning.
Int. J. Appl. Metaheuristic Comput., 2011
A Hybrid Simulated Annealing and Simplex Method for Fixed-Cost Capacitated Multicommodity Network Design.
Int. J. Appl. Metaheuristic Comput., 2011
2010
DIMMA: A Design and Implementation Methodology for Metaheuristic Algorithms - A Perspective from Software Development.
Int. J. Appl. Metaheuristic Comput., 2010
2009
Comput. Inf. Sci., 2009