Comments on the Postal Route Planning and Vehicle Schedule Problem of Postal Transportation Network
Chengjin Zhang
Abstract
Chengjin Zhang
Abstract
The practical background is described for the problem D in the Mathematical Contest in Modeling for the graduate students of China in 2007,and the contents of the problem are also explained in detail.The ideas of systematical analysis,the modeling methods and the optimization algorithms which are concerned with the problem are reviewed.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The practical background is described for the problem D in the Mathematical Contest in Modeling for the graduate students of China in 2007,and the contents of the problem are also explained in detail.The ideas of systematical analysis,the modeling methods and the optimization algorithms which are concerned with the problem are reviewed.
Key concepts: CONTEST, Computer science, Operations research, Schedule, Flow network, Transportation theory, Transportation planning, Mathematical model