Crossroads The ACM Magazine for Students

Sign In

Association for Computing Machinery

Articles Tagged: Combinatorial algorithms

Articles & Features

Courier problems

Courier problems

Courier problems comprise a set of recently proposed combinatorial optimization problems, which are inspired by some novel requirements in railway wagon scheduling. In these problems, scheduling strategies of some mobile couriers are considered. These mobile couriers initially reside at some fixed location. They are assigned some duties of commodity transfer between different pairs of locations. The scenario may be static or dynamic. The motivation is to optimize the movement of the couriers over the constraint of the traversed path or the associated cost. We discuss here some varieties of the courier problems formalized on graphs and address the potential methods of their solution.

By Malay Bhattacharyya, June 2009

PDF | HTML | In the Digital Library