Sciweavers

599 search results - page 69 / 120
» The traveling salesman problem
Sort
View
SODA
2012
ACM
229views Algorithms» more  SODA 2012»
11 years 10 months ago
Approximation algorithms for stochastic orienteering
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...
Anupam Gupta, Ravishankar Krishnaswamy, Viswanath ...
GECCO
2009
Springer
109views Optimization» more  GECCO 2009»
14 years 2 months ago
Crossover operators for multiobjective k-subset selection
Genetic algorithms are often applied to combinatorial optimization problems, the most popular one probably being the traveling salesperson problem. In contrast to permutations use...
Thorsten Meinl, Michael R. Berthold
ICRA
2010
IEEE
119views Robotics» more  ICRA 2010»
13 years 6 months ago
Evader surveillance under incomplete information
— 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 ...
Israel Becerra, Rafael Murrieta-Cid, Raul Monroy
TRANSCI
2010
80views more  TRANSCI 2010»
13 years 6 months ago
Congestion Pricing for Schedule-Based Transit Networks
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...
Younes Hamdouch, Siriphong Lawphongpanich
OL
2010
128views more  OL 2010»
13 years 6 months ago
A biased random-key genetic algorithm for road congestion minimization
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...