A Nelder and Mead Methodology for Solving Small Fixed-Charge Transportation Problems

A Nelder and Mead Methodology for Solving Small Fixed-Charge Transportation Problems

G. Kannan (National Institute of Technology, India), P. Senthil (National Institute of Technology, India), P. Sasikumar (National Institute of Technology, India) and V.P. Vinay (National Institute of Technology, India)
Copyright: © 2008 |Pages: 13
DOI: 10.4018/jisscm.2008100104
OnDemand PDF Download:
Available
$37.50
Current Special Offers
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

The term ‘supply chain management’ has become common in the business world, which can be understood from the positive results of research in the area, particularly in supply chain optimization. Transportation is a frontier in achieving the objectives of the supply chain. Thrust is also given to optimization problems in transportation. The fixed-charge transportation problem is an extension of the transportation problem that includes a fixed cost, along with a variable cost that is proportional to the amount shipped. This article approaches the problem with another meta-heuristics known as the Nelder and Mead methodology to save the computational time with little iteration and obtain better results with the help of a program in C++.

Complete Article List

Search this Journal:
Reset
Open Access Articles
Volume 14: 4 Issues (2021): 2 Released, 2 Forthcoming
Volume 13: 4 Issues (2020)
Volume 12: 4 Issues (2019)
Volume 11: 4 Issues (2018)
Volume 10: 4 Issues (2017)
Volume 9: 4 Issues (2016)
Volume 8: 4 Issues (2015)
Volume 7: 4 Issues (2014)
Volume 6: 4 Issues (2013)
Volume 5: 4 Issues (2012)
Volume 4: 4 Issues (2011)
Volume 3: 4 Issues (2010)
Volume 2: 4 Issues (2009)
Volume 1: 4 Issues (2008)
View Complete Journal Contents Listing