Skip to main content

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

  • Conference paper
Book cover Numerical Methods and Applications (NMA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4310))

Included in the following conference series:

Abstract

In this paper, we consider a combined blending and distribution planning problem faced by a company that manages wheat supply chain. The distribution network consists of loading ports, and customers. Products are loaded on bulk vessels of various capacity levels for delivery to overseas customers. The purpose of this model is simultaneous planning of the assignment of an appropriate type and number of vessels to each customer order, the planning of quantities blended at ports, loaded from ports, and transported from loading ports to customers. We develop a mixed integer programming (MIP) model and provide a heuristic solution procedure for this distribution planning problem. An iterative fixing variable heuristic algorithm is used to assure that acceptable solutions are obtained quickly. The effectiveness of the proposed heuristic algorithm is evaluated by computational experiment.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barnhart, C., Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W.P., Vance, P.H.: Branch-and-price: Column generation for solving huge integer programs 46, 316–332 (1998)

    Google Scholar 

  2. Bilgen, B., Ozkarahan, I.: Strategic, tactical and operational production and distribution models: A review. International Journal of Technology Management (Special issue on Supply Chain Management: Integration Strategies based on New Technologies) 28, 151–171 (2004)

    Google Scholar 

  3. Bilgen, B., Ozkarahan, I.: A mixed-integer programming model for bulk grain blending and shipping. International Journal of Production Economics, accepted for publication.

    Google Scholar 

  4. Bredström, D., et al.: Supply chain optimization in the pulp mill industry-IP models, column generation and novel constraint branches. European Journal of Operational Research 156, 2–22 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  5. Christiansen, M., Fagerholt, K., Ronen, D.: Ship routing and scheduling: Status and perspectives. Transportation Science 38, 1–18 (2004)

    Article  Google Scholar 

  6. Fleischmann, B.: Distribution and transport planning. In: Stadler, H., Kilger, C. (eds.) Supply Chain Management and Advanced Planning, pp. 167–181. Springer, Berlin (2002)

    Google Scholar 

  7. Gunnarsson, H., Rönnqvist, M., Lundgren, J.T.: Supply chain modeling of forest fuel. European Journal of Operational Research 158, 103–123 (2004)

    Article  MATH  Google Scholar 

  8. ILOG CPLEX 8.0.: Users Manual. Gentilly, France: ILOG SA (2003)

    Google Scholar 

  9. ILOG OPL Studio 3.7.: Language Manual. Gentilly, France: ILOG SA (2003)

    Google Scholar 

  10. Liu, C.M., Sherali, H.D.: A coal shipping and blending problem for an electric utility company. Omega 28, 433–444 (2000)

    Article  Google Scholar 

  11. Mehrez, A., Hung, M.S., Ahn, B.H.: An industrial ocean-cargo shipping problem. Decision Sciences 26, 395–423 (1995)

    Article  Google Scholar 

  12. Persson Jan, A., Göthe-Lundgren, M.: Shipment planning at oil refineries using column generation and valid inequalities. European Journal of Operational Research 163, 631–652 (2005)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Todor Boyanov Stefka Dimova Krassimir Georgiev Geno Nikolov

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Bilgen, B. (2007). An Iterative Fixing Variable Heuristic for Solving a Combined Blending and Distribution Planning Problem. In: Boyanov, T., Dimova, S., Georgiev, K., Nikolov, G. (eds) Numerical Methods and Applications. NMA 2006. Lecture Notes in Computer Science, vol 4310. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70942-8_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-70942-8_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-70940-4

  • Online ISBN: 978-3-540-70942-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics