A hybrid dynamic programming for solving fixed cost transportation with discounted mechanism

DOI10.1155/2016/8518921MaRDI QIDQ1659226zbMATH OpenOpenAlexWikidataFDO

Authors Farhad Ghassemi-Tari

Publication date 15 August 2018

Published in Journal of Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2016/8518921

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27) Dynamic programming (90C39) Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• scientific article; zbMATH DE number 6897337
• Dynamic multi-period transportation model for vehicle composition with transshipment points
• Optimal fleet composition via dynamic programming and golden section search
• Algorithms for solving the single-sink fixed-charge transportation problem
• scientific article; zbMATH DE number 2154249

Cites work

• scientific article; zbMATH DE number 3934777 (Why is no real title available?)
• A branch and search algorithm for a class of nonlinear knapsack problems
• A column-and-cut generation algorithm for planning of Canadian armed forces tactical logistics distribution
• A dynamic programming algorithm for the knapsack problem with setup
• An alternative solution algorithm for certain transportation problems
• An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems
• Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
• Development of a hybrid dynamic programming approach for solving discrete nonlinear Knapsack problems
• Internet shopping with price sensitive discounts
• Sourcing strategies in supply risk management: an approximate dynamic programming approach
• Surrogate Constraint Duality in Mathematical Programming
• The Generalized Penalty-Function/Surrogate Model
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• The bottleneck transportation problem with auxiliary resources
• The fixed charge problem
• The imbedded state approach to reducing dimensionality in dynamic programs of higher dimensions
• The transportation problem with exclusionary side constraints

This page was built for publication: A hybrid dynamic programming for solving fixed cost transportation with discounted mechanism

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