scholarly journals Fuzzy Reliability Optimization for 2-Hub Center Problem with Cluster-Based Policy and Application in Cross-Border Supply Chain Network Design Using TS Algorithm

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-12
Author(s):  
Chenyi Yan ◽  
Xifu Wang ◽  
Kai Yang
Keyword(s):  
Supply Chain ◽  
Large Scale ◽  
Mixed Integer ◽  
Optimization Approach ◽  
Reliability Optimization ◽  
Supply Chain Network ◽  
Center Problem ◽  
Fuzzy Reliability ◽  
Hub Location Problem ◽  
Cross Border

As information and communication technology evolves and expands, business and markets are linked to form a complex international network, thus generating plenty of cross-border trading activities in the supply chain network. Through the observations from a typical cross-border supply chain network, this paper introduces the fuzzy reliability-oriented 2-hub center problem with cluster-based policy, which is a special case of the well-studied hub location problem (HLP). This problem differs from the classical HLP in the sense that (i) the hub-and-spoke (H&S) network is grouped into two clusters in advance based on their cross-border geographic features, and (ii) a fuzzy reliability optimization approach based on the possibility measure is developed. The proposed problem is first modeled through a mixed-integer nonlinear programming (MINLP) formulation that maximizes the reliability of the entire cross-border supply chain network. Then, some linearization techniques are implemented to derive a linear model, which can be efficiently solved by exact algorithms run by CPLEX for only small instances. To counteract the difficulty for solving the proposed problem in realistic-sized instances, a tabu search (TS) algorithm with two types of move operators (called “Swap I” and “Swap II”) is further developed. Finally, a series of numerical experiments based on the Turkish network and randomly generated large-scale datasets are set up to verify the applicability of the proposed model as well as the superiority of the TS algorithm compared to the CPLEX.

A Novel Approach for Two-Stage UAV Path Planning in Pipeline Network Inspection

2020 ◽  
Author(s):  
Rui Qiu ◽  
Yongtu Liang
Keyword(s):  
Path Planning ◽  
Large Scale ◽  
Flight Path ◽  
Mixed Integer ◽  
Optimization Approach ◽  
Two Stage ◽  
Calculation Time ◽  
Pipeline Network ◽  
Second Stage ◽  
Computational Performance

Abstract Currently, unmanned aerial vehicle (UAV) provides the possibility of comprehensive coverage and multi-dimensional visualization of pipeline monitoring. Encouraged by industry policy, research on UAV path planning in pipeline network inspection has emerged. The difficulties of this issue lie in strict operational requirements, variable flight missions, as well as unified optimization for UAV deployment and real-time path planning. Meanwhile, the intricate structure and large scale of the pipeline network further complicate this issue. At present, there is still room to improve the practicality and applicability of the mathematical model and solution strategy. Aiming at this problem, this paper proposes a novel two-stage optimization approach for UAV path planning in pipeline network inspection. The first stage is conventional pre-flight planning, where the requirement for optimality is higher than calculation time. Therefore, a mixed integer linear programming (MILP) model is established and solved by the commercial solver to obtain the optimal UAV number, take-off location and detailed flight path. The second stage is re-planning during the flight, taking into account frequent pipeline accidents (e.g. leaks and cracks). In this stage, the flight path must be timely rescheduled to identify specific hazardous locations. Thus, the requirement for calculation time is higher than optimality and the genetic algorithm is used for solution to satisfy the timeliness of decision-making. Finally, the proposed method is applied to the UAV inspection of a branched oil and gas transmission pipeline network with 36 nodes and the results are analyzed in detail in terms of computational performance. In the first stage, compared to manpower inspection, the total cost and time of UAV inspection is decreased by 54% and 56% respectively. In the second stage, it takes less than 1 minute to obtain a suboptimal solution, verifying the applicability and superiority of the method.

scholarly journals A multi-objective approach under uncertainty for designing a green meat supply chain network

2021 ◽  
Author(s):  
Fatemeh Mohebalizadehgashti
Keyword(s):  
Linear Programming ◽  
Supply Chain ◽  
Integer Linear Programming ◽  
Mixed Integer Linear Programming ◽  
Mixed Integer ◽  
Environmental Concerns ◽  
Supply Chain Network ◽  
Food Supply Chain ◽  
Multi Objective ◽  
Proposed Model

Traditional logistics management has not focused on environmental concerns when designing and optimizing food supply chain networks. However, the protection of the environment is one of the main factors that should be considered based on environmental protection regulations of countries. In this thesis, environmental concerns with a mathematical model are investigated to design and configure a multi-period, multi-product, multi-echelon green meat supply chain network. A multi-objective mixed-integer linear programming formulation is developed to optimize three objectives simultaneously: minimization of the total cost, minimization of the total CO2 emissions released from transportation, and maximization of the total capacity utilization. To demonstrate the efficiency of the proposed optimization model, a green meat supply chain network for Southern Ontario, Canada is designed. A solution approach based on augmented εε-constraint method is developed for solving the proposed model. As a result, a set of Pareto-optimal solutions is obtained. Finally, the impacts of uncertainty on the proposed model are investigated using several decision trees. Optimization of a food supply chain, particularly a meat supply chain, based on multiple objectives under uncertainty using decision trees is a new approach in the literature. Keywords: Meat supply chain; Decision tree; Multi-objective programming; Mixed-integer linear programming; Augmented εε-constraint.

scholarly journals Determining nodal capacities for military distribution problems

2019 ◽  
Vol 3 (2) ◽  
pp. 110-130 ◽  
Author(s):  
Dave C. Longhorn ◽  
Joshua R. Muckensturm
Keyword(s):  
Supply Chain ◽  
Network Design ◽  
The United States ◽  
Network Design Problem ◽  
Mixed Integer ◽  
Multiple Time ◽  
Supply Chain Network Design ◽  
Supply Chain Network ◽  
Content Type ◽  
Distribution Problems

Purpose This paper aims to introduce a new mixed integer programming formulation and associated heuristic algorithm to solve the Military Nodal Capacity Problem, which is a type of supply chain network design problem that involves determining the amount of capacity expansion required at theater nodes to ensure the on-time delivery of military cargo. Design/methodology/approach Supply chain network design, mixed integer programs, heuristics and regression are used in this paper. Findings This work helps analysts at the United States Transportation Command identify what levels of throughput capacities, such as daily processing rates of trucks and railcars, are needed at theater distribution nodes to meet warfighter cargo delivery requirements. Research limitations/implications This research assumes all problem data are deterministic, and so it does not capture the variations in cargo requirements, transit times or asset payloads. Practical implications This work gives military analysts and decision makers prescriptive details about nodal capacities needed to meet demands. Prior to this work, insights for this type of problem were generated using multiple time-consuming simulations often involving trial-and-error to explore the trade space. Originality/value This work merges research of supply chain network design with military theater distribution problems to prescribe the optimal, or near-optimal, throughput capacities at theater nodes. The capacity levels must meet delivery requirements while adhering to constraints on the proportion of cargo transported by mode and the expected payloads for assets.

scholarly journals Supply chain optimization with variable demand by considering financial criteria and scenarios

2017 ◽  
Vol 26 (44) ◽  
pp. 21 ◽  
Author(s):  
John Willmer Escobar
Keyword(s):  
Supply Chain ◽  
Large Scale ◽  
Net Present Value ◽  
Programming Model ◽  
Supply Chain Design ◽  
Mixed Integer ◽  
Supply Network ◽  
Distribution Centers ◽  
Supply Chain Optimization ◽  
Starting Point

This paper contemplates the supply chain design problem of a large-scale company by considering the maximization of the Net Present Value. In particular, the variability of the demand for each type of product at each customer zone has been estimated. As starting point, this paper considers an established supply chain for which the main problem is to determine the decisions regarding expansion of distribution centers. The problem is solved by using a mixed-integer linear programming model, which optimizes the different demand scenarios. The proposed methodology uses a scheme of optimization based on the generation of multiple demand scenarios of the supply network. The model is based on a real case taken from a multinational food company, which supplies to the Colombian and some international markets. The obtained results were compared with the equivalent present costs minimization scheme of the supply network, and showed the importance and efficiency of the proposed approach as an alternative for the supply chain design with stochastic parameters.

scholarly journals Combined Use of Mathematical Optimization and Design of Experiments for the Maximization of Profit in a Four-Echelon Supply Chain

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-25 ◽  
Author(s):  
Daniel Arturo Olivares Vera ◽  
Elias Olivares-Benitez ◽  
Eleazar Puente Rivera ◽  
Mónica López-Campos ◽  
Pablo A. Miranda
Keyword(s):  
Supply Chain ◽  
Design Of Experiments ◽  
Mathematical Optimization ◽  
Fractional Factorial ◽  
Mixed Integer ◽  
Supply Chain Network ◽  
Distribution Centers ◽  
Cost Component ◽  
Allocation Model

This paper develops a location-allocation model to optimize a four-echelon supply chain network, addressing manufacturing and distribution centers location, supplier selection and flow allocation for raw materials from suppliers to manufacturers, and finished products for end customers, while searching for system profit maximization. A fractional-factorial design of experiments is performed to analyze the effects of capacity, quality, delivery time, and interest rate on profit and system performance. The model is formulated as a mixed-integer linear programming problem and solved by using well-known commercial software. The usage of factorial experiments combined with mathematical optimization is a novel approach to address supply chain network design problems. The application of the proposed model to a case study shows that this combination of techniques yields satisfying results in terms of both its behavior and the obtained managerial insights. An ANOVA analysis is executed to quantify the effects of each factor and their interactions. In the analyzed case study, the transportation cost is the most relevant cost component, and the most relevant opportunity for profit improvement is found in the factor of quality. The proposed combination of methods can be adapted to different problems and industries.

Sign in / Sign up

Export Citation Format

Share Document