#### Filter Results:

- Full text PDF available (22)

#### Publication Year

2009

2017

- This year (1)
- Last 5 years (18)
- Last 10 years (31)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Masoud Yaghini, Mohammad M. Khoshraftar, Mehdi Fallahi
- Eng. Appl. of AI
- 2013

Artificial neural network (ANN) training is one of the major challenges in using a prediction model based on ANN. Gradient based algorithms are the most frequent training algorithms with severalâ€¦ (More)

- Mohammad Yaghini, M. R. Akhavan Kazemzadeh, Masoud Yaghini, Mohammad Rahim Akhavan
- 2012

The Network Design Problem (NDP) is one of the important problems in combinatorial optimization. Among the network design problems, the Multicommodity Capacitated Network Design (MCND) problem hasâ€¦ (More)

- Masoud Yaghini, Mohammad Karimi, Mohadeseh Rahbar, Rahim Akhavan
- Int. J. of Applied Metaheuristic Computing
- 2011

The fixed-cost Capacitated Multicommodity Network Design (CMND) problem is a well known NP-hard problem. This paper presents a matheuristic algorithm combining Simulated Annealing (SA) metaheuristicâ€¦ (More)

- Masoud Yaghini, Mohammad M. Khoshraftar, Masoud Seyedabadi
- 2014

The aim of this paper is to present an artificial neural network model with high accuracy to predict the delay of passenger trains in Iranian Railways. In the proposed model, we use three differentâ€¦ (More)

- Masoud Yaghini, Mohsen Momeni, Mohammadreza Sarmadi
- Int. J. of Applied Metaheuristic Computing
- 2011

A Hamiltonian path is a path in an undirected graph, which visits each node exactly once and returns to the starting node. Finding such paths in graphs is the Hamiltonian path problem, which isâ€¦ (More)

The capacitated p-median problem (CPMP) is one of the well-known facility-location problems. The objective of the problem is to minimize total cost of locating a set of capacitated service points andâ€¦ (More)

In the context of public transportation system, improving the service quality and robustness through minimizing the average passengers waiting time is a real challenge. This study provides robustâ€¦ (More)

- Erfan Hassannayebi, Seyed Hessameddin Zegordi, Mohammad Reza Amin-Naseri, Masoud Yaghini
- Operational Research
- 2017

- Masoud Yaghini, Mohammad Karimi, Mohadeseh Rahbar
- J. Comb. Optim.
- 2015

The set covering problem (SCP), which has many practical applications, is one of the fundamental combinatorial problems. In this paper, a new neighborhood structure is proposed for solving thisâ€¦ (More)

- Masoud Yaghini, Mohsen Momeni, Mohammadreza Sarmadi
- Int. J. of Applied Metaheuristic Computing
- 2012

Multidimensional 0-1 Knapsack Problem (MKP) is a well-known integer programming problems. The objective of MKP is to find a subset of items with maximum value satisfying the capacity constraints. Aâ€¦ (More)