We have witnessed recently the development of a fast growing body of research focused on
vehicle routing and scheduling problem structures with time window constraints. It is the aim …

This is the first time in its ten year history that this journal has devoted an entire issue to a
single paper. This does not represent a change in editorial policy, but rather an exercise of …

Although this may seem a paradox, all exact science is dominated by the idea of
approximation. Bertrand Russell (1872-1970) Most natural optimization problems, including …

We give algorithms for finding the k shortest paths (not required to be simple) connecting a
pair of vertices in a digraph. Our algorithms output an implicit representation of these paths …

Unmanned aerial vehicles (UAVs), commonly known as drones, are being increasingly
deployed throughout the globe as a means to streamline monitoring, inspection, map** …

We consider a single Unmanned Aerial Vehicle (UAV) routing problem where there are
multiple depots and the vehicle is allowed to refuel at any depot. The objective of the …

This paper investigates the application of a new class of neighborhood search algorithms—
cyclic transfers—to multivehicle routing and scheduling problems. These algorithms exploit …

This paper addresses the Pickup and Delivery Problem with Time Windows, Profits, and
Reserved Requests (PDPTWPR), a new vehicle routing problem appeared in carrier …

Given an arc-weighted directed graph G=(V, A,/spl lscr/) and a pair of nodes s, t, we seek to
find an st walk of length at most B that maximizes some given function f of the set of nodes …

We present a randomized O (log n/log log n)-approximation algorithm for the asymmetric
traveling salesman problem (ATSP). This provides the first asymptotic improvement over the …