A tabu search heuristic procedure for the fixed charge transportation problem

Sun, Minghe; Aronson, Jay E.; McKeown, Patrick G.; Drinka, Dennis

doi:10.1016/s0377-2217(97)00284-1

Cited by 150 publications

(51 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Diaby (1991) considered a generalised fixed charge transportation problem in which there are resource losses in addition to the fixed charges and developed a heuristic procedure for its solution. Sun et al (1998) developed a tabu search for the FCTP using recency-and frequency-based memories. This is together with two other strategies for each of the intermediate and long-term memory processes, making use of a network-based implementation of the simplex method as a local search method.…”

Section: Literature Reviewmentioning

confidence: 99%

Glowworm swarm optimisation algorithm for nonlinear fixed charge transportation problem in a single stage supply chain network

Manimaran¹,

Selladurai²

2014

IJLEG

View full text Add to dashboard Cite

Abstract:In this paper, Glowworm swarm optimisation (GSO) is proposed to solve nonlinear fixed charge transportation problem (NLFCTP) in a single stage supply chain network. In a fixed charge transportation problem, fixed cost is incurred for every route, along with the variable cost that is proportional to the amount shipped. In some cases, the variable cost is associated with quadratic variables in which the cost function will be nonlinear. This problem is more difficult to solve due to presence of the fixed costs that result in discontinuities in the objective function. The objective of this paper is to determine the least cost transportation plan that minimises the total variable and fixed costs while satisfying the supply and demand requirements of each plant and customer. The performance of GSO is compared in terms of total distribution cost with a spanning tree-based genetic algorithm. The comparison reveals that GSO provides better solutions.Keywords: distribution problem; glowworm swarm optimisation; GSO; fixed cost; NP-hard; supply chain.Reference to this paper should be made as follows: Manimaran, P. and Selladurai, V. (2014) 'Glowworm swarm optimisation algorithm for nonlinear fixed charge transportation problem in a single stage supply chain network', Int.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Glowworm swarm optimisation algorithm for nonlinear fixed charge transportation problem in a single stage supply chain network

Manimaran¹,

Selladurai²

2014

IJLEG

View full text Add to dashboard Cite

show abstract

“…Raidl et al (2003) developed a new edge-set(ES) representation to encode a spanning tree for GA, which is efficient on large instances compared with other representations [12]. The tabu alogrithm developed by Sun et al (1998) is the best one on the capacity of searching for FCTP at present [13]. Taken edge-set to encode antibody (feasible solution) for FCTP for its excellent performance on large instance, its initial population consists of genotypes that represent random spanning trees.…”

Section: Initialization Populationmentioning

confidence: 99%

Immune Genetic Algorithm for the Fixed Charge Transportation Problem

Ma¹

2007

Proceedings on Intelligent Systems and Knowledge Engineering (ISKE2007)

View full text Add to dashboard Cite

An immune genetic algorithm (IGA) for the fixed charge transportation problem is developed based on the immune theory in biology, which constructs an immune operator accomplished by two steps, a vaccination and an immune selection. The methods for selecting vaccines and constructing an immune operator are also proposed. The results of computation demonstrate that IGA can restrain the degenerate phenomenon and improve the search capability compared to genetic algorithm with matrix code and that with edge-set code greatly on large instances.

show abstract

“…Basic feasible solutions to the system (4b)- (4d) define spanning trees of the transportation network. Sun et al (1998) propose a tabu search procedure for the FCTP which replaces a single link of the current spanning tree by a link not contained in the tree such that a new basic feasible Solution is obtained. Göthe-Lundgren and Larsson (1994) consider the pure FCTP.…”

Section: Fixed-charge Transportation Problemmentioning

confidence: 99%

Combinatorial Optimisation Problems of the Assignment Type and a Partitioning Approach

Klose

Drexl

2002

Lecture Notes in Economics and Mathematical Systems

View full text Add to dashboard Cite

Standard-Nutzungsbedingungen:Die Dokumente auf EconStor dürfen zu eigenen wissenschaftlichen Zwecken und zum Privatgebrauch gespeichert und kopiert werden.Sie dürfen die Dokumente nicht für öffentliche oder kommerzielle Zwecke vervielfältigen, öffentlich ausstellen, öffentlich zugänglich machen, vertreiben oder anderweitig nutzen.Sofern die Verfasser die Dokumente unter Open-Content-Lizenzen (insbesondere CC-Lizenzen) zur Verfügung gestellt haben sollten, gelten abweichend von diesen Nutzungsbedingungen die in der dort genannten Lizenz gewährten Nutzungsrechte. Abstract Assignment type problems consist in optimally assigning or allocating a given set of "activities" to a given set of "resources". Optimisation problems of the assignment type have numerous applications in production planning and logistics. A populär approach to solve such problems or to compute lower b ounds on the optimal Solution value (in case of a minimisation problem) is to employ column generation. By means of co nsidering subsets of "activities" which can feasibly be assigned to a Single resource, the problem is reformulated as some kind of set-partitioning problem. Column generation is then used in order to solve the linear relaxation of the reformulation. The lower bound obtainable from this approach may, however, be improved by partitioning the set of resources into subsets and by considering subsets of activities which can feasibly be assigned to subsets of resources. This paper outlines the application of this partitioning method to a number of important combinatorial optimisation problems of the assignment type. Terms of use: Documents in EconStor may

show abstract

A tabu search heuristic procedure for the fixed charge transportation problem

Cited by 150 publications

References 36 publications

Glowworm swarm optimisation algorithm for nonlinear fixed charge transportation problem in a single stage supply chain network

Glowworm swarm optimisation algorithm for nonlinear fixed charge transportation problem in a single stage supply chain network

Immune Genetic Algorithm for the Fixed Charge Transportation Problem

Combinatorial Optimisation Problems of the Assignment Type and a Partitioning Approach

Contact Info

Product

Resources

About