Volume 20, Issue 2 (4-2001)                   jame 2001, 20(2): 43-54 | Back to browse issues page

XML Persian Abstract Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

K. Eshghi and S. Pasalar. Application of Tabu Search to a Special Class of Multicommodity Distribution Systems. jame. 2001; 20 (2) :43-54
URL: http://jame.iut.ac.ir/article-1-230-en.html
Abstract:   (3935 Views)
Multicommodity distribution problem is one of the most interesting and useful models in mathematical programming due to its major role in distribution networks. The purpose of this paper is to describe and solve a special class of multicommodity distribution problems in which shipment of a commodity from a plant to a customer would go through different distribution centers. The problem is to determine which distribution centers to use so that all customer demands are satisfied, production capacities are not exceeded, and the total distribution cost is minimized.The proposed problem is formulated as a mixed integer linear program and a solution technique based on tabu search is developed, implemented and successfully applied to the test problems. Keywords: Commodity Distribution Systems, Tabu Search, Mathematical Programming
Full-Text [PDF 257 kb]   (943 Downloads)    
Type of Study: Research | Subject: General
Received: 2014/10/25 | Published: 2001/04/15

Add your comments about this article : Your username or Email:
CAPTCHA

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

© 2021 CC BY-NC 4.0 | Journal of Advanced Materials in Engineering (Esteghlal)

Designed & Developed by : Yektaweb