More-for-less algorithm for fixed-charge transportation problems
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.
Volume (Year): 35 (2007)
Issue (Month): 1 (February)
|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|
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.:
- 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.
- 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.
- Adlakha, Veena & Kowalski, Krzysztof, 1999. "On the fixed-charge transportation problem," Omega, Elsevier, vol. 27(3), pages 381-388, June.
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: (Zhang, Lei)
If references are entirely missing, you can add them using this form.