In the Stochastic Orienteering problem, we are given a metric, where each node also has a job located there with some deterministic reward and a random size. (Think of the jobs as...
Genetic algorithms are often applied to combinatorial optimization problems, the most popular one probably being the traveling salesperson problem. In contrast to permutations use...
— This paper is concerned with determining whether a mobile robot, called the pursuer, is up to maintaining visibility of an antagonist agent, called the evader. This problem, a ...
In this paper, we develop models for adjusting or setting fares on a transit system to encourage passengers to choose travel strategies that lead to the least travel delay for the...
One of the main goals in transportation planning is to achieve solutions for two classical problems, the traffic assignment and toll pricing problems. The traffic assignment proble...
Luciana S. Buriol, Michael J. Hirsch, Panos M. Par...