Article Per Year (5 Year)
p-Index From 2021 - 2026
0
P-Index
This Author published in this journals
All Journal International Journal of Supply Chain Management
sahar abbasi
Department of Industrial Engineering, Najafabad Branch, Islamic Azad University, Esfahan, Iran
Decision Sciences, Operations Research & Management Engineering Environmental Science Industrial & Manufacturing Engineering Transportation

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Using Node Combination Method in Time-expanded Networks sahar abbasi
International Journal of Supply Chain Management Vol 1, No 1 (2012): International Journal of Supply Chain Management (IJSCM)
Publisher : International Journal of Supply Chain Management

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

This study concerns the problem of finding shortest paths in time-expanded networks by repeatedly combining the source nodes nearest neighbor, time-expanded network is derived from dynamic network G= (V,A,T) and contains one copy of the node set of the underlying static network for each discrete time step (building a time layer). we use node combination (NC) method in networks which arc costs can vary with time, each arc has a transit time and parking with a corresponding time-varying cost is allowed at the nodes. The NC algorithm finds the shortest paths with three simple iterative steps: find the nearest neighbor of the source node, combine that node with the source node, and modify the costs on arcs that connect to the nearest neighbor. The NC algorithm is more comprehensible and convenient for programming as there is no need to maintain a set with the nodes distances.
Co-Authors