An Iterative Fixing Variable Heuristic for Solving a Combined Blending and Distribution Planning Problem

DOI10.1007/978-3-540-70942-8_27MaRDI QIDQ5756191zbMATH OpenOpenAlexFDO

Authors Bilge Bilgen

Publication date 3 September 2007

Published in Numerical Methods and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70942-8_27

zbMATH Keywords

blending and distribution planning problemcomputational experimentdistribution networkheuristic algorithmmixed integer programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Transportation, logistics and supply chain management (90B06) Theory of organizations, manpower planning in operations research (90B70) Mixed integer programming (90C11)

Recommendations

• scientific article; zbMATH DE number 2144501
• Integrated lot sizing and blending problems
• Hybrid heuristics for a short sea inventory routing problem
• scientific article; zbMATH DE number 711782
• Planning and consolidating shipments from a warehouse

Cited in

(2)

• The blockwise coordinate descent method for integer programs
• Ship routing and scheduling in the new millennium

This page was built for publication: An Iterative Fixing Variable Heuristic for Solving a Combined Blending and Distribution Planning Problem

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