Show simple item record

dc.contributor.authorSehulster, J.M.
dc.contributor.authorPratt, J.E.
dc.contributor.authorNovakovic, Andrew M.
dc.date.accessioned2019-10-15T18:34:15Z
dc.date.available2019-10-15T18:34:15Z
dc.date.issued1982-05
dc.identifier.urihttps://hdl.handle.net/1813/68294
dc.description.abstractThis paper discusses improved procedures for applying heuristic methods to well-known transportation and routing algorithms for solving a milk assembly problem. Miles traveled to assemble milk are reduced by up to 20 percent in a detailed case study in New York.
dc.language.isoen_US
dc.publisherCharles H. Dyson School of Applied Economics and Management, Cornell University
dc.titleProcedures for Vehicle Routing Problems with An Application to Milk Assembly in New York
dc.typearticle
dcterms.licensehttp://hdl.handle.net/1813/57595


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics