The Multiple Terminal Delivery Problem with Probabilistic Demands

Abstract

A heuristic approach is presented for solving the multiterminal delivery problem with constraints on the system and probabilistic demands. The algorithm is basically the same whether a commodity is being collected or delivered. This is a practical method that results in “near optimal” solutions to a difficult problem.