#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2015

2016

- This year (0)
- Last 5 years (6)
- Last 10 years (6)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Gholam Hassan Shirdel, Ameneh Mortezaee, G. H. Shirdel, A. Mortezaee
- 2015

This paper proposes a DEA model for evaluating arc efficiency in the presence of multiple weights on arcs in a network. Thereafter, a multi-criteria assignment problem is formulated based on the efficiency of the arcs. Appraisal is given to some parts of the proposed DEA-model used for solving multi-criteria network flow problems and provide some examples.… (More)

- G. H. Shirdel, H. Rezapour
- SpringerPlus
- 2016

In this paper, the maximum capacity path problem in time-varying network is presented, where waiting times at vertices are not allowable. Moreover, the capacities are considered the generalized trapezoidal fuzzy number. An exact algorithm is proposed which can find a optimal solution of problem subject to the time of path is at most T, where T is a given… (More)

The length of the stochastic shortest path is defined as the arrival probability from a source node to a destination node. The uncertainty of the network topology causes unstable connections between nodes. A discrete-time Markov chain is devised according to the uniform distribution of existing arcs where the arrival probability is computed as a finite… (More)

- Gholam Hassan Shirdel, Nasrin Kahkeshani
- EJGTA
- 2015

The purpose of the independent set interdiction problem in the weighted graph G is to determine a set of vertices R∗ such that the weight of the maximum independent set in G−R∗ is minimized. We define an approximate solution for this problem. Then, an upper bound for the relative error of this problem is obtained. We show that the limit of the relative… (More)

- Gholam H. Shirdel, Mohsen Abdolhosseinzadeh
- SpringerPlus
- 2016

A genetic algorithm is presented to find the arrival probability in a directed acyclic network with stochastic parameters, that gives more reliability of transmission flow in delay sensitive networks. Some sub-networks are extracted from the original network, and a connection is established between the original source node and the original destination node… (More)

- Gholam H. Shirdel, Mohsen Abdolhosseinzadeh
- SpringerPlus
- 2016

The stochastic shortest path length is defined as the arrival probability from a given source node to a given destination node in the stochastic networks. We consider the topological changes and their effects on the arrival probability in directed acyclic networks. There is a stable topology which shows the physical connections of nodes; however, the… (More)

- ‹
- 1
- ›