MENYELESAIKAN PERSOALAN TRANSPORTASI DENGAN KENDALA CAMPURAN
No Thumbnail Available
Date
2013-03-26
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
A new algorithm of transportation that is more-for-less (MFL) algorithm has been
used to solve transportation problems with mixed constraints. The proposed of this
transportation problem is to determine how many product that should shipped from
each sources to each destination. Hence each demand from each destination can be
fulflled with minimum total shipping cost
Description
Keywords
transportation problem, mixed constraint, more-for-less