• Home
  • Search
  • Methodology for Stochastic Graph Completion-Time Problems
  • Cite Icon4
  • https://doi.org/10.1287/ijoc.8.4.331Copy DOI Icon

Methodology for Stochastic Graph Completion-Time Problems

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Assume a completion time T0 and a graph having edges with randomly chosen weights are specified. Each time an edge is traversed, the weight is selected at random, according to a fixed probability law indexed by that edge. Successive observations are independent, and independent of realizations at other edges. We consider the stochastic shortest path and traveling salesman problems of finding paths which maximize the probability of completion by the specified time. The methodology combines techniques of machine learning with the “k-opt” heuristic. The algorithm is supported by convergence analysis, and is also shown in computational experiments to be successful for randomized versions of TSP problems already in the literature and having from 10 to 57 vertices. To our knowledge, this success is well beyond other computational stochastic traveling salesman studies reported elsewhere. A feature of the algorithm is that the distributions of the random edge weights need not be specified, and so the technique is suited to on-line operation.

Similar Papers
  • PDF
  • Research Article
  • Citations37

Reinforcement Learning Based Stochastic Shortest Path Finding in Wireless Sensor Networks

  • Jan 01, 2019
  • IEEE Access
  • Wenwen Xia +3
  • Research Article
  • Citations13

On scenario construction for stochastic shortest path problems in real road networks

  • Jul 03, 2021
  • Transportation Research Part E: Logistics and Transportation Review
  • Dongqing Zhang +4
  • Research Article
  • Citations1

Explaining the Space of SSP Policies via Policy-Property Dependencies: Complexity, Algorithms, and Relation to Multi-Objective Planning

  • May 30, 2024
  • Proceedings of the International Conference on Automated Planning and Scheduling
  • Marcel Steinmetz +3
  • Conference Article
  • Citations14

On step sizes, stochastic shortest paths, and survival probabilities in reinforcement learning

  • Dec 07, 2008
  • Abhijit Gosavi
  • Conference Article
  • Citations18

Stochastic motion planning with path constraints and application to optimal agent, resource, and route planning

  • May 01, 2012
  • Sejoon Lim +1
  • Research Article
  • Citations23

On Boundedness of Q-Learning Iterates for Stochastic Shortest Path Problems

  • May 01, 2013
  • Mathematics of Operations Research
  • Huizhen Yu +1
  • Research Article
  • Citations1

The co-occurrence between depressive symptoms and smartphone addiction: a network analysis

  • Jul 02, 2025
  • Behaviour & Information Technology
  • Tingting Gao +5
  • Research Article
  • Citations230

Learning Algorithms for Markov Decision Processes with Average Cost

  • Jan 01, 2001
  • SIAM Journal on Control and Optimization
  • J Abounadi +2
  • Research Article
  • Citations35

Traveling salesman problem with drone under recharging policy

  • Jul 20, 2021
  • Computer Communications
  • Emine Es Yurek +1
  • Conference Article
  • Citations20

Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems

  • Oct 01, 2011
  • Jian Li +1
  • Research Article
  • Citations16

Short-Sighted Stochastic Shortest Path Problems

  • May 14, 2012
  • Proceedings of the International Conference on Automated Planning and Scheduling
  • Felipe Trevizan +1
  • Research Article
  • Citations22

Instantly Decodable Network Coding for Completion Time or Decoding Delay Reduction in Cooperative Data Exchange Systems

  • Mar 01, 2016
  • IEEE Transactions on Vehicular Technology
  • Neda Aboutorab +1
  • Conference Article
  • Citations13

Maximizing Cumulative User Engagement in Sequential Recommendation

  • Aug 20, 2020
  • Yifei Zhao +4
  • Book Chapter
  • Citations8

Solving the Probabilistic Travelling Salesman Problem Based on Genetic Algorithm with Queen Selection Scheme

  • Sep 01, 2008
  • Yu-Hsin Liu
  • Conference Article
  • Citations3

Finding objects through stochastic shortest path problems

  • May 06, 2013
  • Felipe W Trevizan +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.