A reinforcement learning approach to convoy scheduling on a contested transportation network

DOI10.1007/S11590-015-0875-6zbMATH Open1329.90070OpenAlexW1999955898MaRDI QIDQ895789FDOQ895789

Authors: Daniel Stimpson, Rajesh Ganesan 

Publication date: 4 December 2015

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-015-0875-6

Recommendations

• Opportunities for reinforcement learning in stochastic dynamic vehicle routing
• A reinforcement learning scheme for the equilibrium of the in-vehicle route choice problem based on congestion game
• Analyzing and exploiting the competitiveness of scenarios for negotiating convoy formation under time constraints
• scientific article; zbMATH DE number 2214471
• A biased-randomized discrete-event heuristic for coordinated multi-vehicle container transport across interconnected networks
• Learning vehicle dispatching with linear programming models
• Deep policy dynamic programming for vehicle routing problems

zbMATH Keywords

dynamic programmingvehicle routingreinforcement learningattacker-defenderimprovised explosive deviceroute clearance

Mathematics Subject Classification ID

Dynamic programming (90C39) Traffic problems in operations research (90B20) Stochastic scheduling theory in operations research (90B36)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Approximate Dynamic Programming
• Shortest-path network interdiction
• Reinforcement learning: a tutorial survey and recent advances
• A simple model of optimal clearance of improvised explosive devices

Cited In (1)

• Analyzing and exploiting the competitiveness of scenarios for negotiating convoy formation under time constraints

This page was built for publication: A reinforcement learning approach to convoy scheduling on a contested transportation network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q895789)