The Multiple Terminal Delivery Problem with Probabilistic Demands

1 August 1969

journal article
Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science

Vol. 3 (3) , 192-204
https://doi.org/10.1287/trsc.3.3.192

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.

Keywords

OPTIMAL
DELIVERY PROBLEM
PROBABILISTIC
BASICALLY
SOLVING
COMMODITY
HEURISTIC
MULTITERMINAL
CONSTRAINTS

This publication has 0 references indexed in Scilit: