C. Oliveira, A. Silva, G. Loch, M. Kleina
The Fixed Charge Transportation Problem (FCTP) is a Linear Programming (LP) class, whereby the total shipping cost of a product, from a source to a destination, consists of a unit transportation cost, proportional to the amount of sent items and a fixed charge associated with the opening of the route. The FCTP is NP-hard and has a characteristic in which, as far as the difference between the value of the unit cost and the fixed charge increases, the computational time changes, worsening the performance. This paper purpose a matheuristic approach to the FCTP which results were good when compared to other methods available in the Literature.
Keywords: Fixed Charge Transportation Problem, Matheuristic, Operations Research.
Diff selection: Mark the radio boxes of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.
Published on 03/03/20Accepted on 14/01/20Submitted on 11/07/19
Volume 36, Issue 1, 2020DOI: 10.23967/j.rimni.2020.01.005Licence: CC BY-NC-SA license
Views 124Recommendations 0