نتایج جستجو برای: balancing mixed integer linear programming meta heuristic algorithms
تعداد نتایج: 1448090 فیلتر نتایج به سال:
This paper presents a comprehensive survey on parallelizing computations involved in optimization problem on Graphics Processing Unit (GPU) using CUDA (Compute Unified Design Architecture). GPU have multithread cores with high memory bandwidth which allow for greater ease of use and also more radially support a layer body of applications. Many researchers have reported significant speedups with...
A design problem of cross-docking distribution networks is addressed as a new research area in logistics management. This paper presents a new mathematical model for the location of cross-docking facilities and vehicle routing scheduling problems in distribution networks. For this purpose, a two-phase mixed-integer programming (MIP) is formulated. Then, a new heuristic-based simulated annealing...
In this paper we analyze a continuous version of the maximal covering location problem, in which facilities are required to be linked by means given graph structure (provided that two allowed if distance is not exceed). We propose mathematical programming framework for problem and different resolution strategies. First, provide Mixed Integer Non Linear Programming formulation derive some geomet...
The population haplotype inference problem based on the pure parsimony criterion (HIPP) infers an m genotype matrix for a population by a 2 haplotype matrix with the minimum number of distinct haplotypes. Previous integer programming based HIPP solution methods are time-consuming, and their practical effectiveness remains unevaluated. On the other hand, previous heuristic HIPP algorithms are ef...
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...
We present a linear mixed integer programming model for the time-dependent heterogeneous green vehicle routing and scheduling problem (GVRSP) with the objective of minimizing total carbon dioxide emissions and weighted tardiness. Instead of discrete time intervals, the proposed model takes the traveled distances of arcs in different time periods as decision variables to determine the travel sch...
Nature Inspired Meta-Heuristic algorithms are proved to be beneficial for solving real world combinatorial problems such as minimum spanning tree, knapsack problem, process planning problems, load balancing and many more. In this research work, existing meta-heuristic approaches are discussed. Due to astonishing feature of echolocation, bat algorithm has drawn major attention in recent years an...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید