On trade-off solution pairs in a special type of transportation problem (Q792881)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3854810
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On trade-off solution pairs in a special type of transportation problem |
scientific article; zbMATH DE number 3854810 |
Statements
On trade-off solution pairs in a special type of transportation problem (English)
0 references
1983
0 references
The authors give an algorithm to generate efficient (trade-off) solutions for a bicriteria transportation problem in which a criterion is the usual linear cost objective and the other is the time of transportation. It is assumed that the time of transportation from an origin to a destination depends on the transported quantity. The time objective is a piecewise constant increasing function. A small numerical example, to illustrate the algorithm, is also given.
0 references
trade-off solution pairs
0 references
time objective
0 references
bicriteria transportation
0 references
piecewise constant increasing function
0 references
0 references
0 references
0 references
0.8635134696960449
0 references
0.8628028631210327
0 references
0.8587775230407715
0 references
