Capacity allocation problem with random demands for the rail container carrier

Capacity allocation problem with random demands for the rail container carrier

0.00 Avg rating0 Votes
Article ID: iaor201110448
Volume: 217
Issue: 1
Start Page Number: 214
End Page Number: 221
Publication Date: Feb 2012
Journal: European Journal of Operational Research
Authors: , ,
Keywords: allocation: resources, heuristics, programming: integer
Abstract:

In this paper, we consider the formulation and heuristic algorithm for the capacity allocation problem with random demands in the rail container transportation. The problem is formulated as the stochastic integer programming model taking into account matches in supply and demand of rail container transportation. A heuristic algorithm for the stochastic integer programming model is proposed. The solution to the model is found by maximizing the expected total profit over the possible control decisions under the uncertainty of demands. Finally, we give numerical experiments to demonstrate the efficiency of the heuristic algorithm.

Reviews

Required fields are marked *. Your email address will not be published.