Model and algorithm for container allocation problem with random freight demands in synchromodal transportation

DOI10.1155/2015/986152zbMath1394.90145OpenAlexW1940492515WikidataQ59120141 ScholiaQ59120141MaRDI QIDQ1667146

Peng Zhang

Publication date: 27 August 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2015/986152

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Related Items (1)

Model predictive control for simultaneous planning of container and vehicle routes

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Multimodal freight transportation planning: a literature review
• Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic
• Capacity allocation problem with random demands for the rail container carrier
• A real coded genetic algorithm for solving integer and mixed integer optimization problems
• Handbook of transportation science.
• A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
• Models and Algorithms for Container Allocation Problems on Trains in a Rapid Transshipment Shunting Yard
• Scheduling Direct and Indirect Trains and Containers in an Intermodal Setting
• Introduction to Stochastic Programming
• Capacity allocation to sales agents in a decentralized logistics network

This page was built for publication: Model and algorithm for container allocation problem with random freight demands in synchromodal transportation