Capacity allocation problem with random demands for the rail container carrier

DOI10.1016/J.EJOR.2011.08.023MaRDI QIDQ439359zbMATH OpenOpenAlexFDO

Authors Chengxuan Cao, Ke-Ping Li, Ziyou Gao

Publication date 16 August 2012

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2011.08.023

zbMATH Keywords

capacity allocationheuristic algorithmrail containerstochastic integer programmingtransportation

Mathematics Subject Classification ID

Integer programming (90C10) Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59) Applications of mathematical programming (90C90)

Recommendations

• Model and algorithm for container allocation problem with random freight demands in synchromodal transportation
• A Successive Linear Approximation Procedure for Stochastic, Dynamic Vehicle Allocation Problems
• scientific article; zbMATH DE number 5685026
• Solving a multi periodic stochastic model of the rail-car fleet sizing by two-stage optimization formulation
• Stochastic and dynamic shipper carrier network design problem

Cites work

• A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
• A multi-level search strategy for the 0-1 multidimensional knapsack problem
• A Note on Approximation Schemes for Multidimensional Knapsack Problems
• A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
• An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem
• Capacity allocation to sales agents in a decentralized logistics network
• Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3249566 (Why is no real title available?)
• Introduction to Stochastic Programming
• Models and algorithms for container allocation problems on trains in a rapid transshipment shunting yard
• New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
• Opportunities for OR in intermodal freight transport research: A review.
• Scheduling direct and indirect trains and containers in an intermodal setting

Cited in

(6)

• Model and algorithm for container allocation problem with random freight demands in synchromodal transportation
• A revenue management approach for network capacity allocation of an intermodal barge transportation system
• Order acceptance for motorail transportation with uncertain parameters
• scientific article; zbMATH DE number 1594566 (Why is no real title available?)
• Capacity Allocation and Pricing for Take-or-Pay Reservation Contracts
• scientific article; zbMATH DE number 2221469 (Why is no real title available?)

This page was built for publication: Capacity allocation problem with random demands for the rail container carrier

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q439359)