A memetic algorithm to schedule planned maintenance for the national grid
From MaRDI portal
Publication:5463391
DOI10.1145/347792.347801zbMath1073.68887OpenAlexW1984844818WikidataQ60568796 ScholiaQ60568796MaRDI QIDQ5463391
Kai Nagel, Riko Jacob, Madhav V. Marathe
Publication date: 4 August 2005
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: http://www.jea.acm.org/1999/JacobRouting/
network designtransportation planningexperimental analysisdesign and analysis of algorithmsshortest paths algorithms
Nonnumerical algorithms (68W05) Transportation, logistics and supply chain management (90B06) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
A new approach for solving the network problems, Large-scale multi-agent transportation simulations, Heuristic shortest path algorithms for transportation applications: state of the art, Multiple UAVs path planning algorithms: a comparative study
Uses Software
