نتایج جستجو برای: fixed charge solid transportation problems

تعداد نتایج: 1120768  

In most real world application and problems, a homogeneous product is carried from an origin to a destination by using different transportation modes (e.g., road, air, rail and water). This paper investigates a fixed charge transportation problem (FCTP), in which there are different routes with different capacities between suppliers and customers. To solve such a NP-hard problem, four meta-heur...

Journal: :Computers, materials & continua 2022

This paper presents a novel application of metaheuristic algorithms for solving stochastic programming problems using recently developed gaining sharing knowledge based optimization (GSK) algorithm. The algorithm is on human behavior in which people gain and share their with others. Different types fractional are considered this study. augmented Lagrangian method (ALM) used to handle these cons...

Journal: :Revista Internacional de Métodos Numéricos para Cálculo y Diseño en Ingeniería 2020

2007
Tim H. Hultberg Domingos M. Cardoso

A basic model of the task of assigning classes to professors, in such a way that the average number of distinct subjects assigned to each professor is minimized, is formulated as a mixed integer program. It turns out that the problem is a special case of the fixed charge transportation problem which in some cases corresponds to finding a basic solution of a transportation problem which is as de...

Journal: :Applied Mathematics & Information Sciences 2013

2012
P. Pandian

A new method namely, bound technique is proposed for finding Type I and Type II cost sensitivity ranges of solid transportation problems. The procedure of the bound technique is illustrated by numerical examples. Mathematics Subject Classification : 90B06, 90C08, 90C31

N. Balaji N. Jawahar

This paper deals with a multi-period fixed charge production-distribution problem associated with backorder and inventories. The objective is to determine the size of the shipments from each supplier and backorder and inventories at each period, so that the total cost incurred during the entire period towards production, transportation, backorder and inventories is minimised. A 0-1 mixed intege...

Journal: :J. Heuristics 2009
Simon Görtz Andreas Klose

The single-sink fixed-charge transportation problem (SSFCTP) consists in finding a minimum cost flow from a number of nodes to a single sink. Beside a cost proportional to the amount shipped, the flow cost encompass a fixed charge. The SSFCTP is an important subproblem of the well-known fixed-charge transportation problem. Nevertheless, just a few methods for solving this problem have been prop...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید