Udom Janjarassuk

Learn More
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget constraint limits the amount of the network that can be destroyed. In this paper, we study a stochastic version of the network interdiction problem in which the successful destruction of(More)
The ant colony optimization (ACO) method has been extensively studied recently for solving many combinatorial optimization problems. In this paper, an ant colony optimization method for solving the vehicle routing problem with stochastic demands is presented. The 2-opt local search is employed within the ACO algorithm to improve the qualities of the(More)
  • 1