IDEAS home Printed from
MyIDEAS: Log in (now much improved!) to save this article

More-for-less algorithm for fixed-charge transportation problems

Listed author(s):
  • Adlakha, Veena
  • Kowalski, Krzysztof
  • Vemuganti, R.R.
  • Lev, Benjamin
Registered author(s):

The more-for-less (MFL) phenomenon in distribution problems occurs when it is possible to ship more total goods for less (or equal) total cost, while shipping the same quantity or more from each origin and to each destination. This paradox occurs often in fixed-charge transportation problems (FCTPs), and further analysis could bring significant reduction in costs. The MFL phenomenon for FCTPs has received minimal attention in the literature despite the fact that existing analytical algorithms, such as branch and bound, are limited to small problems due to excessive computational effort. In this paper, we develop a simple heuristic algorithm to identify the demand destinations and the supply points to ship MFL in FCTPs. The proposed method builds upon any existing basic feasible solution. It is easy to implement and can serve as an effective tool for managers for solving the more-for-less paradox for large distribution problems.

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

File URL:
Download Restriction: Full text for ScienceDirect subscribers only

As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

Article provided by Elsevier in its journal Omega.

Volume (Year): 35 (2007)
Issue (Month): 1 (February)
Pages: 116-127

in new window

Handle: RePEc:eee:jomega:v:35:y:2007:i:1:p:116-127
Contact details of provider: Web page:

Order Information: Postal:

References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:

in new window

  1. Adlakha, Veena & Kowalski, Krzysztof, 1999. "On the fixed-charge transportation problem," Omega, Elsevier, vol. 27(3), pages 381-388, June.
  2. Adlakha, Veena & Kowalski, Krzysztof, 2000. "A note on the procedure MFL for a more-for-less solution in transportation problems," Omega, Elsevier, vol. 28(4), pages 481-483, August.
  3. Charnes, A. & Duffuaa, S. & Ryan, M., 1987. "The more-for-less paradox in linear programming," European Journal of Operational Research, Elsevier, vol. 31(2), pages 194-197, August.
Full references (including those not matched with items on IDEAS)

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

When requesting a correction, please mention this item's handle: RePEc:eee:jomega:v:35:y:2007:i:1:p:116-127. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu)

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.

This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.