Welcome to the InfoSci Platform
Reference Hub2
A Genetic Algorithms Approach for Inverse Shortest Path Length Problems

A Genetic Algorithms Approach for Inverse Shortest Path Length Problems

António Leitão, Adriano Vinhas, Penousal Machado, Francisco Câmara Pereira
Copyright: © 2014 |Volume: 4 |Issue: 4 |Pages: 19
ISSN: 1947-928X|EISSN: 1947-9298|EISBN13: 9781466655843|DOI: 10.4018/ijncr.2014100103
Cite Article Cite Article

MLA

Leitão, António, et al. "A Genetic Algorithms Approach for Inverse Shortest Path Length Problems." IJNCR vol.4, no.4 2014: pp.36-54. http://doi.org/10.4018/ijncr.2014100103

APA

Leitão, A., Vinhas, A., Machado, P., & Pereira, F. C. (2014). A Genetic Algorithms Approach for Inverse Shortest Path Length Problems. International Journal of Natural Computing Research (IJNCR), 4(4), 36-54. http://doi.org/10.4018/ijncr.2014100103

Chicago

Leitão, António, et al. "A Genetic Algorithms Approach for Inverse Shortest Path Length Problems," International Journal of Natural Computing Research (IJNCR) 4, no.4: 36-54. http://doi.org/10.4018/ijncr.2014100103

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Inverse Combinatorial Optimization has become a relevant research subject over the past decades. In graph theory, the Inverse Shortest Path Length problem becomes relevant when people don't have access to the real cost of the arcs and want to infer their value so that the system has a specific outcome, such as one or more shortest paths between nodes. Several approaches have been proposed to tackle this problem, relying on different methods, and several applications have been suggested. This study explores an innovative evolutionary approach relying on a genetic algorithm. Two scenarios and corresponding representations are presented and experiments are conducted to test how they react to different graph characteristics and parameters. Their behaviour and differences are thoroughly discussed. The outcome supports that evolutionary algorithms may be a viable venue to tackle Inverse Shortest Path problems.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.