Magazine:
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.
Courier problems
Full text also available in the ACM Digital Library as PDF | HTML | Digital Edition
Thank you for your interest in this article. This content is protected. You may log in with your ACM account or subscribe to access the full text.