What is it about?

The problem is to decide on when and how much to produce and stock at the plant, when and how much to serve and stock at each retailer, and vehicle routes for shipments such that the sum of fixed production setup cost, variable production cost, distribution cost, and inventory carrying cost at the plant and retailers are minimized.

Featured Image

Why is it important?

A multi-phase heuristic is proposed for the problem. The computational experiments on benchmark instances show favourable results with regard to the quality of the solutions found at the expense of higher computing times on large instances. In particular, the heuristic managed to find new best solutions for the 65% of benchmark instances.

Perspectives

The proposed heuristic is a mathematical programming-based heuristic that relies on formulating and solving restricted versions of the problem as mixed integer programs.

Prof. Haldun Sural
Middle East Technical University

Read the Original

This page is a summary of: A multi-phase heuristic for the production routing problem, Computers & Operations Research, November 2017, Elsevier,
DOI: 10.1016/j.cor.2017.06.007.
You can read the full text:

Read

Contributors

The following have contributed to this page