A Nelder and Mead Methodology for Solving Small Fixed-Charge Transportation Problems
P. Sasikumar and
V.P. Vinay Additional contact information G. Kannan: National Institute of Technology, India
P. Senthil: National Institute of Technology, India
P. Sasikumar: National Institute of Technology, India
V.P. Vinay: National Institute of Technology, India
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++.