We address the stochastic traveling salesperson problem (TSP) with distances measured by travel time. We study how to select the best tour and due date for the minimization of fundamental safe scheduling objectives. In Model 1 the objective is minimizing the due date subject to a service level constraint. In Model 2 the objective reflects a trade-off between the due date and the expected weight...

The vehicle routing problem with time windows (VRPTW) is the problem of minimizing the total travel distance of a number of vehicles, under capacity and time window constraints, where every customer must be visited exactly once by a vehicle. We consider two generalizations of the VRPTW and propose local search algorithms. The first one treats traveling times as variables and introduce cost func...

When travelling on a train, many people enjoy looking out of the window at the landscape passing by. We present an application that translates the perceived movement of the landscape and other occurring events such as passing trains into music. The continuously changing view outside the window is captured with a camera and translated into midi events that are replayed instantaneously. This allo...

We present a geometric approach to the problem of propagating fronts into an unstable state, valid for an arbitrary continuous-time random walk with a Fisher-Kolmogorov-Petrovski-Piskunov growth/reaction rate. We derive an integral Hamilton-Jacobi type equation for the action functional determining the position of reaction front and its speed. Our method does not rely on the explicit derivation...

Suppose G=(V,A) be an undirected graph with n nodes and a source vertex s Є V. Each node has a problem that must be solved by the repairman that has send. We are given the time required by the repairman to travel among nodes. The objective is to find a tour that minimizes the total waiting time of all the problems that are waiting to be solved. Traveling Repairman problem (TRP) is also known as...

The TSP, VRP and OP problems with time constraints have one common sub-problem – the task of finding the minimum route duration for a given order of customers. While much work has been done on routing and scheduling problems with time windows, to this date only few articles considered problems with multiple time windows. Moreover, since the assumption of constant travel time between two locatio...

Two experiments studied normal humans in an analogue of the time-left procedure of J. Gibbon and R. M. Church (1981). In Experiment 1 the "standard" alternative (S) was always half the length of the "comparison" time-left link (C), and S ranged from 4 to 8 s. Humans showed an increasing preference for the time-left alternative with increasing elapsed time in the interval, and indifference point...