 The freight allocation problem with all-units quantity-based discount: A heuristic algorithmHu Qin, Meifeng Luo, Xiang Gao and Andrew Lim Omega, 2012, vol. 40, issue 4, 415-423 Abstract: 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. Keywords: Freight allocation; Quantity discount; Heuristic; Filter-and-fan; Tabu search (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:jomega:v:40:y:2012:i:4:p:415-423 Ordering information: This journal article can be ordered from DOI: 10.1016/j.omega.2011.05.005 Access Statistics for this article Omega is currently edited by B. Lev More articles in Omega from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.