The freight allocation problem with all-units quantity-based discount: A heuristic algorithm
This paper studies a problem encountered by a buying office for one of the largest retail distributors in the world. An important task for the buying office is to plan the distribution of goods from Asia to various destinations across Europe. The goods are transported along shipping lanes by shipping companies, which offer different discount rates depending on the freight quantity. To increase the reliability of transportation, the shipper imposes a quantity limit on each shipping company on each shipping lane. To guarantee a minimum business volume, each shipping company requests a minimum total freight quantity over all lanes if it is contracted. The task involves allocating projected demand of each shipping lane to shipping companies subject to the above conditions such that the total cost is minimized.
Volume (Year): 40 (2012)
Issue (Month): 4 ()
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
When requesting a correction, please mention this item's handle: RePEc:eee:jomega:v:40:y:2012:i:4:p:415-423. See general information about how to correct material in RePEc.
If references are entirely missing, you can add them using this form.