Production planning in industrial townships modeled as hub location-allocation problems considering congestion in manufacturing plants

In this paper, we aim to develop optimal production plans in industrial townships modeled as hub location-allocation problems (HLAP) taking congestion into account. In the proposed model, hub nodes are considered as industrial townships where manufacturing plants and a central distribution warehouse are located, and two objectives are targeted. The first is to minimize the total costs, which includes the cost of hub deployment, factories and warehouses, transportation, and so forth. The second is to minimize the total elapsed time of products in manufacturing plants and warehouses modeled as queues. Due to the ambiguity in estimating the model's parameters, they are considered as fuzzy parameters to make model closer to reality. The fuzzy model is then converted into an equivalent crisp model by combining the expected value (EV) and the fuzzy chance constrained programming (FCCP) approaches. Subsequently, the bi-objective crisp model is converted into a single aggregated objective model. In order to validate the proposed model, six numerical examples are solved, and the sensitivity of the proposed model with regard to changes in model's parameters is investigated

A bi˗objective hub location-allocation model considering congestion

In this paper, a new hub location-allocation model is developed considering congestion and production scheduling. This model assumes that manufacturing and distributing goods, including raw materials and semi-finished or finished goods, take place in hubs only (such as industrial township). The main objective of this study is to minimize the total costs and to minimize the sum of waiting times for processing goods in factories and warehouses. In order to solve the bi-objective model, goal attainment and LP metric techniques are combined to develop a more effective multi-objective technique. Due to the exponential complexity of the proposed approach as well as the nonlinearity of the mathematical model, a number of small and medium-sized problems are solved to demonstrate the effectiveness of the solution methodology

Robust and fuzzy goal programming optimization approaches for a novel multi-objective hub location-allocation problem:a supply chain overview

In this paper, a novel multi-objective mathematical model is developed to solve a capacitated single-allocation hub location problem with a supply chain overview. Three mathematical models with various objective functions are developed. The objective functions are to minimize: (a) total transportation and installation costs, (b) weighted sum of service times in the hubs to produce and transfer commodities and the tardiness and earliness times of the flows including raw materials and finished goods, and (c) total greenhouse gas emitted by transportation modes and plants located in the hubs. To come closer to reality, some of the parameters of the proposed mathematical model are regarded as uncertain parameters, and a robust approach is used to solve the given problem. Furthermore, two methods, namely fuzzy multi-objective goal programming (FMOGP) and the Torabi and Hassini's (TH) method are used to solve the multi-objective mathematical model. Finally, the concluding part presents the comparison of the obtained results

Genetic and Improved Shuffled Frog Leaping Algorithms for a 2-Stage Model of a Hub Covering Location Network

Hub covering location problem, Network design,   Single machine scheduling, Genetic algorithm,   Shuffled frog leaping algorithm   Hub location problems (HLP) are synthetic optimization problems that appears in telecommunication and transportation networks where nodes send and receive commodities (i.e., data transmissions, passengers transportation, express packages, postal deliveries, etc.) through special facilities or transshipment points called hubs. In this paper, we consider a central mine and a number of hubs (e.g., factories) connected to a number of nodes (e.g., shops or customers) in a network. First, the hub network is designed, then, a raw materials transportation from a central mine to the hubs (i.e., factories) is scheduled. In this case, we consider only one transportation system regarded as single machine scheduling. Furthermore, we use this hub network to solve the scheduling model. In this paper, we consider the capacitated single allocation hub covering location problem (CSAHCLP) and then present the mixed-integer programming (MIP) model. Due to the computational complexity of the resulted models, we also propose two improved meta-heuristic algorithms, namely a genetic algorithm and a shuffled frog leaping algorithm in order to find a near-optimal solution of the given problem. The performance of the solutions found by the foregoing proposed algorithms is compared with exact solutions of the mathematical programming model

Robot selection by a multiple criteria complex proportional assessment method under an interval-valued fuzzy environment

International audienc