A heuristic solution technique to attain the minimal total cost bounds of transporting a homogeneous product with varying demands and supplies

DOI10.1016/J.EJOR.2014.05.004zbMATH Open1339.90030OpenAlexW2085548803MaRDI QIDQ297085FDOQ297085

Authors: Z. A. M. S. Juman, M. A. Hoque 

Publication date: 24 June 2016

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

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

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

zbMATH Keywords

heuristicsinventory costtotal cost boundtransportation cost

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05) Transportation, logistics and supply chain management (90B06)

Cites Work

• Network flows. Theory, algorithms, and applications.
• Vendor managed inventory model for single-vendor multi-retailer supply chains
• Stock replenishment and shipment scheduling for vendor-managed inventory systems
• Stochastic Transportation-Inventory Network Design Problem
• A one-vendor multi-buyer integrated inventory model
• Multiobjective transportation problem with interval cost, source and destination parameters
• On the use of tree indexing methods in transportation algorithms
• A new dual based procedure for the transportation problem
• Solving fixed charge transportation problem with interval parameters
• A single-vendor and multiple-buyers production-inventory policy for a deteriorating item
• Obtaining a good primal solution to the uncapacitated transportation problem
• A new cost allocation rule for inventory transportation systems
• Synchronization in the single-manufacturer multi-buyer integrated inventory supply chain
• Formulations for a problem of petroleum transportation
• The stepping stone method of explaining linear programming calculations in transportation problems
• The Red-Blue transportation problem
• Effective zero-inventory-ordering policies for the single-warehouse multiretailer problem with piecewise linear cost structures
• Distribution Strategies that Minimize Transportation and Inventory Costs
• Cost operator algorithms for the transportation problem
• An optimal solution technique to the single-vendor multi-buyer integrated inventory supply chain by incorporating some realistic factors
• The Multi-Item Joint Replenishment Problem with Transportation and Container Effects
• The optimal production and shipment policy for the single-vendor singlebuyer integrated production-inventory problem
• Another look at the single-vendor single-buyer integrated production-inventory problem
• Production and shipment lot sizing in a vendor--buyer supply chain with transportation cost
• Optimal production and shipment models for a single-vendor--single-buyer integrated system

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)