技术直达列车编组计划的阶跃函数模型及同构变换

A Step Function Model of the Train Formation Plan and Its Equivalent Transformation

本文构造了技术直达列车编织计划（ＴＦＰ）问题的阶跃函数模型。通过对该模型做同构变换，获得了该问题的几种典型优化模型形式：线性０—１规划模型，目标函数为线性而约束条件是二次的０—１规划模型。从而为引进各种特定的算法提供了条件。文末以五个支点站为例给出了各种模型的具体形式。

Presents a new formulation called step function model for the train formation plan(TFP)problem between marshalling stations.By its equivalent transformations other typical formulations of TFP are also obtained :linear 0 1 programming and quadratic 0 1 programming whose objoctive function is linear and constraints are qudratic,thus providing facilities for introducing other specific algorithms,As examples,models of the TFP for five marshalling stations,are illustrdted.