Model and algorithm for container allocation problem with random freight demands in synchromodal transportation (Q1667146)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Model and algorithm for container allocation problem with random freight demands in synchromodal transportation |
scientific article; zbMATH DE number 6927766
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Model and algorithm for container allocation problem with random freight demands in synchromodal transportation |
scientific article; zbMATH DE number 6927766 |
Statements
Model and algorithm for container allocation problem with random freight demands in synchromodal transportation (English)
0 references
27 August 2018
0 references
Summary: This paper aims to investigate container allocation problem with random freight demands in synchromodal transportation network from container carriers' perspective. Firstly, the problem is formulated as a stochastic integer programming model where the overall objective is to determine a container capacity allocation plan at operational level, so that the expected total transportation profit is maximized. Furthermore, by integrating simulated annealing with genetic algorithm, a problem-oriented hybrid algorithm with a novel gene encode method is designed to solve the optimization model. Some numerical experiments are carried out to demonstrate the effectiveness and efficiency of the proposed model and algorithm.
0 references
0 references
0 references