Railway empty container allocation model based on cargo rank
Xinzhu Yang
Abstract
Xinzhu Yang
Abstract
A nonlinear mixed integer programming on railway empty container allocation is modeled based on cargo rank according to railway transportation characteristic.The objective function is minimizing the cost of empty container allocation.Under short of empty container,the higher the cargo demand rank is,the more preferentially satisfied the empty container demand will be.A numerical case is given to demonstrate the validity and feasibility of the proposed model.
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.
A nonlinear mixed integer programming on railway empty container allocation is modeled based on cargo rank according to railway transportation characteristic.The objective function is minimizing the cost of empty container allocation.Under short of empty container,the higher the cargo demand rank is,the more preferentially satisfied the empty container demand will be.A numerical case is given to demonstrate the validity and feasibility of the proposed model.
Key concepts: Container (type theory), Rank (graph theory), Integer programming, Mathematical optimization, Nonlinear programming, Function (biology), Computer science, Nonlinear system