| |
| Field |
Value |
| |
| Title |
Using Node Combination Method in Time-expanded Networks
|
| |
| Creator |
abbasi, sahar; Department of Industrial Engineering, Najafabad Branch, Islamic Azad University, Esfahan, Iran
|
| |
| Description |
This study concerns the problem of finding shortest paths in time-expanded networks by repeatedly combining the source node’s 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.
|
| |
| Publisher |
International Journal of Supply Chain Management
|
| |
| Contributor |
—
|
| |
| Date |
2012-07-19
|
| |
| Type |
Peer-reviewed Article
|
| |
| Format |
application/pdf
|
| |
| Identifier |
http://ojs.excelingtech.co.uk/index.php/IJSCM/article/view/535
|
| |
| Source |
International Journal of Supply Chain Management; Vol 1, No 1 (2012): International Journal of Supply Chain Management (IJSCM)
|
| |
| Language |
en
|
| |
| Rights |
The copyright of the contribution is transferred to IJSCM in case of acceptance. The copyright transfer covers the exclusive right to reproduce and distribute the contribution, including reprints, translations, photographic reproductions, microform, electronic form, or any other reproductions of similar nature.The Author may publish his/her contribution on his/her personal Web page provided that he/she creates a link to the mentioned volume of IJSCM.The Author may not publish his/her contribution anywhere else without the prior written permission of the publisher unless it has been changed substantially. The Author warrants that his/her contribution is original, except for such excerpts from copyrighted works as may be included with the permission of the copyright holder and author thereof, that it contains no libellous statements, and does not infringe on any copyright, trademark, patent, statutory right, or propriety right of others.The Author also agrees for and accepts responsibility for releasing this material on behalf of any and all co-authors.
|
| |
Since 2014