A heuristic solution technique to attain the minimal total cost bounds of transporting a homogeneous product with varying demands and supplies
From MaRDI portal
(Redirected from Publication:297085)
Recommendations
- A hybrid simulated annealing algorithm to estimate a better upper bound of the minimal total cost of a transportation problem with varying demands and supplies
- Linear fractional transportation problem with varying demand and supply
- scientific article; zbMATH DE number 2065143
- Transportation problems with two sided constraints on supplies and demands
- Transportation problem with multi-choice cost and demand and stochastic supply
Cites work
- A new cost allocation rule for inventory transportation systems
- A new dual based procedure for the transportation problem
- A one-vendor multi-buyer integrated inventory model
- A single-vendor and multiple-buyers production-inventory policy for a deteriorating item
- An optimal solution technique to the single-vendor multi-buyer integrated inventory supply chain by incorporating some realistic factors
- Another look at the single-vendor single-buyer integrated production-inventory problem
- Cost operator algorithms for the transportation problem
- Distribution Strategies that Minimize Transportation and Inventory Costs
- Effective zero-inventory-ordering policies for the single-warehouse multiretailer problem with piecewise linear cost structures
- Formulations for a problem of petroleum transportation
- Multiobjective transportation problem with interval cost, source and destination parameters
- Network flows. Theory, algorithms, and applications.
- Obtaining a good primal solution to the uncapacitated transportation problem
- On the use of tree indexing methods in transportation algorithms
- Optimal production and shipment models for a single-vendor--single-buyer integrated system
- Production and shipment lot sizing in a vendor--buyer supply chain with transportation cost
- Solving fixed charge transportation problem with interval parameters
- Stochastic Transportation-Inventory Network Design Problem
- Stock replenishment and shipment scheduling for vendor-managed inventory systems
- Synchronization in the single-manufacturer multi-buyer integrated inventory supply chain
- The Multi-Item Joint Replenishment Problem with Transportation and Container Effects
- The Red-Blue transportation problem
- The optimal production and shipment policy for the single-vendor singlebuyer integrated production-inventory problem
- The stepping stone method of explaining linear programming calculations in transportation problems
- Vendor managed inventory model for single-vendor multi-retailer supply chains
Cited in
(9)- Quantifying outcome functions of linear programs: an approach based on interval-valued right-hand sides
- Interval transportation problem: feasibility, optimality and the worst optimal value
- A hybrid simulated annealing algorithm to estimate a better upper bound of the minimal total cost of a transportation problem with varying demands and supplies
- A heuristic for obtaining better initial feasible solution to the transportation problem
- An iterative solution technique to minimize the average transportation cost of capacitated transportation problem with bounds on rim conditions
- The outcome range problem in interval linear programming
- Bounds on the worst optimal value in interval linear programming
- A feasible flow-based iterative algorithm for the two-level hierarchical time minimization transportation problem
- Checking weak optimality and strong boundedness in interval linear programming
This page was built for publication: A heuristic solution technique to attain the minimal total cost bounds of transporting a homogeneous product with varying demands and supplies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q297085)
