Abstract
PurposeThe purpose of this paper is to present a model to determine which roads to be built in each stage with limited budget.Design/methodology/approachA multistage network discrete expansion model with budget restriction is formulated and a heuristic algorithm is developed by the technique of comparing the original shortest paths and the sum of crossed shortest paths to avoid computing the shortest paths matrix repeatedly.FindingsThe optimal approach has a very significant effect in finding which roads to be built by the largest net benefit.Research limitations/implicationsThe paper discusses a new multistage network discrete expansion problem is the main research implications.Practical implicationsThe optimal choice for road building schedule of new urban district when budgets were limited.Originality/valueThe paper presents a model and an algorithm for the optimization of road building schedule based on budget restriction.
Subject
Computer Science (miscellaneous),Social Sciences (miscellaneous),Theoretical Computer Science,Control and Systems Engineering,Engineering (miscellaneous)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献