Skip to main content

An evolutionary algorithm for multicriteria path optimization problems

Buy Article:

$55.00 plus tax (Refund Policy)

For many years researchers and decision makers (DMs) faced with multicriteria shortest path problems (MSPPs) have resorted to reductions to the classical shortest path problem (SPP) by means of weighted linear combinations of the criteria. Algorithmic and approximation schemes are available to solve MSPPs but these approaches often display complexities prohibitive to their implementation on real‐world applications. This paper describes the development of an Evolutionary Algorithm (EA) approach to MSPPs on networks with multiple independent criteria. The EA approach is shown to sufficiently explore the underlying network space, generate large candidate path sets, and evolve high quality approximations to the optimal MSPP solution(s). Opportunities for early termination of the EA in time‐critical applications are also offered. Among the issues for further work is the integration of the EA as a tool within a GIS for path optimization.
No Reference information available - sign in for access.
No Citation information available - sign in for access.
No Supplementary Data.
No Article Media
No Metrics

Document Type: Research Article

Affiliations: National Center for Geocomputation, National University of Ireland Maynooth, Co. Kildare, Ireland

Publication date: 2006-04-01

More about this publication?
  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content
Cookie Policy
Cookie Policy
Ingenta Connect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more