Masoud Yaghini

Orcid: 0000-0002-3239-8362

Affiliations:
  • Iran University of Science and Technology, Tehran, Iran


According to our database1, Masoud Yaghini authored at least 21 papers between 2009 and 2021.

Collaborative distances:
  • Dijkstra number2 of six.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

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
A set covering approach for multi-depot train driver scheduling.
J. Comb. Optim., 2015

A Cutting-Plane Neighborhood Structure for Fixed-Charge Capacitated Multicommodity Network Design Problem.
INFORMS J. Comput., 2015

A hybrid solution method for fuzzy train formation planning.
Appl. Soft Comput., 2015

2013
A hybrid simulated annealing and column generation approach for capacitated multicommodity network design.
J. Oper. Res. Soc., 2013

Passenger Train Delay Classification.
Int. J. Appl. Metaheuristic Comput., 2013

GeneticTKM: A Hybrid Clustering Method Based on Genetic Algorithm, Tabu Search and K-Means.
Int. J. Appl. Metaheuristic Comput., 2013

A hybrid algorithm for artificial neural network training.
Eng. Appl. Artif. Intell., 2013

A hybrid metaheuristic approach for the capacitated p-median problem.
Appl. Soft Comput., 2013

GOFAM: a hybrid neural network classifier combining fuzzy ARTMAP and genetic algorithm.
Artif. Intell. Rev., 2013

An efficient heuristic algorithm for the capacitated $$p-\!$$ median problem.
4OR, 2013

2012
DOE-based parameter tuning for local branching algorithm.
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
A Framework for Selection of Information Systems Development Methodologies.
Comput. Inf. Sci., 2009


  Loading...