The structure of the solution set to network optimisation problems |
| |
Authors: | AD Pearman |
| |
Institution: | School of Economic Studies, University of Leeds, Leeds LS2 9JT, England |
| |
Abstract: | This paper argues that both heuristic and non-heuristic algorithms for the road network optimisation problem would benefit from a greater understanding of the structure of the set of feasible solutions to such problems. In order to provide this, a comparative study of a number of spatial combinatorial problems was undertaken. The results show that the road network optimisation problem is rich in good sub-optimal solutions. The implications of this finding for the development of optimising and heuristic algorithms are discussed, and some suggestions made as to where future research on network optimisation problems could most fruitfully be directed. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|