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.
Publisher
Association for Computing Machinery (ACM)
Reference9 articles.
1. Beightler C. S. Phillips D. T. and Wilde D. J. 1979. Foundations of optimization. Englewood Cliffs NJ Prentice Hall Second Edition. Beightler C. S. Phillips D. T. and Wilde D. J. 1979. Foundations of optimization . Englewood Cliffs NJ Prentice Hall Second Edition.
2. Finding an optimal tooth color match
3. Coello C. A. C. Lamont G. B. and Veldhuizen D. A. V. 2007. Evolutionary Algorithms for Solving Multi-objective Problems. Springer Second Edition. Coello C. A. C. Lamont G. B. and Veldhuizen D. A. V. 2007. Evolutionary Algorithms for Solving Multi-objective Problems . Springer Second Edition.
4. Discrete optimization in public rail transport
5. Solving large multiple-depot multiple-vehicle-type bus scheduling problems in practice
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献