What is it about?
This paper describes an improved method for finding the shortest path between two points positioned within a space defined by multiple continuous costs. This method works by using a computational procedure that mimics the biological process of evolutionary natural selection to deliver a set of near-optimal solutions to this corridor location problem.
Featured Image
Why is it important?
The corridor location problem is a very generic problem class which appears in a wide range of contexts ranging from planning and engineering to operations research and computer engineering. The method which is described in the paper is useful in the extent to which the user is able to explicitly control the tradeoff between solution quality and computational effort, thus allowing it to be applied to previously untenable problem sizes or to planning situations where rough initial solutions must be generated quickly and with minimal effort.
Perspectives
Read the Original
This page is a summary of: MOGADOR revisited: Improving a genetic approach to multi-objective corridor search, Environment and Planning B Planning and Design, December 2015, SAGE Publications,
DOI: 10.1177/0265813515618562.
You can read the full text:
Contributors
The following have contributed to this page