[PDF] Top 20 A Heuristic Approach for Solving the Fixed Charge Transportation Problems

... the fixed costs and finding a direction to improve the value of the objective function of the linear formulation has been proposed in (Adlakha, Kowalski, & Lev, ... See full document

... various heuristic algorithms like Clarke and wright algorithm, Holmes and Parker algorithm and Fisher and Jaikukumar algorithm and compared the results among them and concluded that Clarke and wright algorithm ... See full document

... a heuristic based approach in finding the ...a heuristic approach which was the genetic algorithm in finding the solution to the problem in order to get over this ... See full document

... scheduling problems in manufacturing system. Scheduling problems vary widely according to specific production tasks but most are NP-hard ...Scheduling problems are usually solved using heuristics to ... See full document

... the fixed charge transportation problem under uncertainty, particularly when parameters are given in interval ...costs, fixed charges, supply and demand parameters) are in interval ...interval ... See full document

... e Fixed-Charge Transportation Problem portation problem ...a fixed cost and a transportation cost per unit ...Since problems with fixed charge are usually NP- hard ... See full document

... distribution problems (MPDP) in the literature [2, 3, 5-12] involving considerations of production and transportation, possibly together with other ...period problems reveals the following: most of ... See full document

... to heuristic algorithms for solving FCTP because the methods are constrained by limits on computer ...simple heuristic algorithm for solving a small FCTP, which was more time consuming than ... See full document

... Despite the EM approach has been designed for continuous optimization problems, here we adapt it to utilize in the discrete space. As mentioned in the most works which used metaheuristic algorithms to solve ... See full document

... The transportation problem (TP) is one of the best optimization methods that can be applied to different areas of human being ...the transportation of the product from the origins to the destinations is ... See full document

... of transportation algorithm with volume discount on distribution cost using Nigerian Bottling Company Plc Owerri ...minimize transportation cost and maximize ...Nonlinear Transportation Problem ... See full document

... linear transportation problems (MOLTP) have been made by several ...bicriteria transportation problem ...of transportation problems with ... See full document

... In its general form, problem of scheduling exists in most manufacturing and production systems, information processing environments, transportation distribution systems and in many service situations. Production ... See full document

... for problems with a large number of variables. Most problems have a large number of variables; thus, support of scalability is a valuable characteristic for any optimization ... See full document

... Neural networks: Ant colonies, being composed of numerous concurrently and locally interacting units, can be seen as "connectionist" systems.[13] From a structural point of view, the parallel between the ACO ... See full document

... They are also able to see where their neighbors have had success. Movements through the search space are guided by these successes, with the population usually converging, by the end of a trial, on a problem solution ... See full document

... In this paper, an improved algorithm for solving MOTP was presented. Our approach has two characteristic fea- tures. Firstly, the algorithm is an iterative multiobjective genetic algorithm with an external ... See full document

... different approach OFSTF (Origin, First, Second, Third, and Fourth quadrants) Method was applied for obtaining a feasible solution for transportation problems ... See full document

... Tables 2-4 show the experimental results of the proposed method and the one-hour-truncated branch and bound algorithm [5] for L = 2, 3, 5, respectively. In these tables, “LSQ” denotes the proposed method and “B & B” ... See full document

... Differential Evolution (DE) is a parallel direct search method developed by Storn and Price in 1997. It uses a real-coded representation. This approach for numerical optimization is simple to implement and ... See full document