Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks

DOI10.1016/S0377-2217(01)00354-XzbMath1037.90027OpenAlexW2071131715MaRDI QIDQ1869688

Pawan Lingras, Cedric Davies

Publication date: 28 April 2003

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(01)00354-x

zbMATH Keywords

shortest pathgenetic algorithmsRoutingdynamic and stochastic networks

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (12)

A new AATP model with considering supply chain lead-times and resources and scheduling of the orders in flowshop production systems: a graph-theoretic view ⋮ The dynamic shortest path problem with anticipation ⋮ A simulated annealing for multi-criteria network path problems ⋮ Matrix representation and extension of coalition analysis in group decision support ⋮ A class of rough multiple objective programming and its application to solid transportation problem ⋮ Attribute reduction of data with error ranges and test costs ⋮ Dynamic journeying under uncertainty ⋮ Using matrices to link conflict evolution and resolution in a graph model ⋮ A matrix-based approach to searching colored paths in a weighted colored multidigraph ⋮ Fuzzy multi-objective chance-constrained programming model for hazardous materials transportation ⋮ A matrix approach to status quo analysis in the graph model for conflict resolution ⋮ On-Line Vehicle Routing and Scheduling With Time-Varying Travel Speeds

Uses Software

• GALib
• Algorithm 97

Cites Work

• A note on two problems in connexion with graphs
• A finite-time algorithm for shortest path problems with time-varying costs
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• Scene recognition using genetic algorithms with semantic nets
• Time-varying shortest path problems with constraints
• Distributed shortest-path protocols for time-dependent networks
• An Appraisal of Some Shortest-Path Algorithms
• Shortest Paths in Probabilistic Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks