An Algorithm of Logistic Costs Minimization Under Constraints on Supply Volumes

2013/11/05 by Natalia Burlakova, Burlakova, Natalia, В. В. Сервах +1
Engineering · #Advanced Manufacturing and Logistics Optimization #FOS: Mathematics #Optimization and Control (math.OC) #Optimization and Packing Problems #Scheduling and Optimization Algorithms

paper · pdf · doi:10.48550/arxiv.1311.1055

openalex publication_date 2013/11/05 · openalex created_date 2019/07/30 · openalex updated_date 2026/07/28

Abstract

A problem of minimization of delivery and storage costs of a product is considered under constraints on volumes of delivery from each of the suppliers. It is required to determine optimal volumes and times of product shipments. The problem is NP-hard. In this paper, the problem is proved to be pseudo-polynomially solvable and an algorithm for its solution is proposed.

Related

• Algorithms for Shipping Container Delivery Scheduling
• A Heuristic Algorithm for the Capacitated Inventory Grouping Problem
• Sparsity-Constrained Transportation Problem
• Aspects and Views on Mathematical Optimization in Logistics in the Chemical Process Industry
• Warehouse Problem with Bounds, Fixed Costs and Complementarity Constraints