Access Restriction

Author Bhattacharyya, Malay
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF ♦ HTM / HTML
Language English
Abstract 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.
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2003-03-01
Publisher Place New York
Journal Crossroads (CROS)
Volume Number 15
Issue Number 4
Page Count 4
Starting Page 19
Ending Page 22

Open content in new tab

   Open content in new tab
Source: ACM Digital Library