A heuristic decomposition method for optimizing the transportation of perishable product mixes.

*(English. Russian original)*Zbl 0683.90052
Sov. Phys., Dokl. 34, No. 4, 299-301 (1989); translation from Dokl. Akad. Nauk SSSR 305, No. 5, 1060-1064 (1989).

Summary: The multidimensional special transportation problem generating an efficient delivery program for a perishable product mix (with over \(10^ 2\) products) shipped from the producer plant to a set of consumer sites (more than \(10^ 3\) sites), subject to an hourly delivery schedule with varying daily demand during the week, is typical of many enterprises in the processing industry. The existing solution methods of the traditional transportation problem for the delivery of a homogeneous product subject to one type of constraints either on distance or on delivery time, such as linear programming methods and transportation network methods, will generate an optimal homogeneous-product delivery program that does not incorporate the specific restrictions relevant for perishable product mixes. We accordingly developed for the first time an informal statement and a formal mathematical model of the problem of optimal transportation of a perishable product mix from the producer plant to a set of consumer sites, subject to an hourly delivery schedule, and proposed a fast heuristic decomposition method for the solution of this problem.

##### MSC:

90C08 | Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) |

90B35 | Deterministic scheduling theory in operations research |

65K05 | Numerical mathematical programming methods |