Capacity allocation problem with random demands for the rail container carrier

DOI10.1016/J.EJOR.2011.08.023zbMATH Open1244.90262OpenAlexW2019643982MaRDI QIDQ439359FDOQ439359

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

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

zbMATH Keywords

transportationheuristic algorithmcapacity allocationstochastic integer programmingrail container

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Introduction to Stochastic Programming
• Title not available (Why is that?)
• A Note on Approximation Schemes for Multidimensional Knapsack Problems
• 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
• Models and algorithms for container allocation problems on trains in a rapid transshipment shunting yard
• Opportunities for OR in intermodal freight transport research: A review.
• New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
• 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
• Scheduling direct and indirect trains and containers in an intermodal setting
• Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
• Capacity allocation to sales agents in a decentralized logistics network

Cited In (4)

• Capacity Allocation and Pricing for Take-or-Pay Reservation Contracts
• Title not available (Why is that?)
• Model and algorithm for container allocation problem with random freight demands in synchromodal transportation
• Title not available (Why is that?)

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)