Extending the solid step fixed-charge transportation problem to consider two-stage networks and multi-item shipments

This paper develops a new mathematical model for a capacitated solid step fixed-charge transportation problem. The problem is formulated as a two-stage transportation network and considers the option of shipping multiple items from the plants to the distribution centers (DC) and afterwards from DCs to customers. In order to tackle such an NP-hard problem, we propose two meta-heuristic algorithms; namely, Simulated Annealing (SA) and Imperialist Competitive Algorithm (ICA). Contrary to the previous studies, new neighborhood strategies maintaining the feasibility of the problem are developed. Additionally, the Taguchi method is used to tune the parameters of the algorithms. In order to validate and evaluate the performances of the model and algorithms, the results of the proposed SA and ICA are compared. The computational results show that the proposed algorithms provide relatively good solutions in a reasonable amount of time. Furthermore, the related comparison reveals that the ICA generates superior solutions compared to the ones obtained by the SA algorithm

Shrimp closed-loop supply chain network design

Recent developments in food industries have attracted both academic and industrial practitioners. Shrimp as a well-known, rich, and sought-after seafood, is generally obtained from either marine environments or aquaculture. Central prominence of Shrimp Supply Chain (SSC) is brought about by numerous factors such as high demand, market price, and diverse fisheries or aquaculture locations. In this respect, this paper considers SSC as a set of distribution centers, wholesalers, shrimp processing factories, markets, shrimp waste powder factory, and shrimp waste powder market. Subsequently, a mathematical model is proposed for the SSC, whose aim is to minimize the total cost through the supply chain. The SSC model is NP-hard and is not able to solve large-size problems. Therefore, three well-known metaheuristics accompanied by two hybrid ones are exerted. Moreover, a real-world application with 15 test problems are established to validate the model. Finally, the results confirm that the SSC model and the solution methods are effective and useful to achieve cost savings

Solving the Fixed Charge Transportation Problem by New Heuristic Approach

The fixed charge transportation problem (FCTP) is a deployment of the classical transportation problem in which a fixed cost is incurred, independent of the amount transported, along with a variable cost that is proportional to the amount shipped. Since the problem is considered as an NP-hard, the computational time grows exponentially as the size of the problem increases. In this paper, we propose a new heuristic along with well-known metaheuristic like Genetic algorithm (GA), simulated annealing (SA) and recently developed one, Keshtel algorithm (KA) to solve the FCTP. Contrary to previous works, we develop a simple and strong heuristic according to the nature of the problem and compare the result with metaheuristics. In addition, since the researchers recently used the priority-based representation to encode the transportation graphs and achieved very good results, we consider this representation in metaheuristics and compare the results with the proposed heuristic. Furthermore, we apply the Taguchi experimental design method to set the proper values of algorithms in order to improve their performances. Finally, computational results of heuristic and metaheuristics with different encoding approaches, both in terms of the solution quality and computation time, are studied in different problem sizes

An Allocation-Routing Optimization Model for Integrated Solid Waste Management

Integrated smart waste management (ISWM) is an innovative and technologically advanced approach to managing and collecting waste. It is based on the Internet of Things (IoT) technology, a network of interconnected devices that communicate and exchange data. The data collected from IoT devices helps municipalities to optimize their waste management operations. They can use the information to schedule waste collections more efficiently and plan their routes accordingly. In this study, we consider an ISWM framework for the collection, recycling, and recovery steps to improve the performance of the waste system. Since ISWM typically involves the collaboration of various stakeholders and is affected by different sources of uncertainty, a novel multi-objective model is proposed to maximize the probabilistic profit of the network while minimizing the total travel time and transportation costs. In the proposed model, the chance-constrained programming approach is applied to deal with the profit uncertainty gained from waste recycling and recovery activities. Furthermore, some of the most proficient multi-objective meta-heuristic algorithms are applied to address the complexity of the problem. For optimal adjustment of parameter values, the Taguchi parameter design method is utilized to improve the performance of the proposed optimization algorithm. Finally, the most reliable algorithm is determined based on the Best Worst Method (BWM)

Creating Shared Value and Strategic Corporate Social Responsibility through Outsourcing within Supply Chain Management

One way to develop local clusters is to strengthen those clusters by using outsourcing to conduct strategic social responsibility, or in other words, to create shared value, which is a win-win strategy for the buyer, supplier, and society and the best and most viable alternative to traditional corporate social responsibilities. In the leading research, a model for decision-making within the supply chain has been developed for purchasing based on shared value creation, long-term relationship management, and purchasing strategies. The research consists of two strategic mathematical models, using goal programming, and then is solved by a meta-heuristic algorithm. Potential outsourcing companies are assessed and then clustered according to their geographic locations in the decision-making process. One (or several) cluster(s) was selected among clusters based on knowledge and relationship criteria. Besides, in the primary mathematical model, the orders in different periods and the selection of suppliers are determined. In this model, in addition to optimizing the cost, the dispersion of purchases from suppliers is maximized to increase relationships and strengthen all members of the cluster. Maximizing the distribution by converting a secondary objective function to goal-programming variables transforms the multi-objective model into a single-objective model. In addition to economic benefits for buyers and suppliers, this purchasing plan concentrates on strengthening the local industrial cluster, fostering employment and ease of recruitment for human resources, accessing more infrastructures and technical support facilities, developing an education system in the region, and assisting knowledge-based enterprises with development

A fuzzy optimization approach for procurement transport operational planning in an automobile supply chain

We consider a real-world automobile supply chain in which a first-tier supplier serves an assembler and determines its procurement transport planning for a second-tier supplier by using the automobile assembler's demand information, the available capacity of trucks and inventory levels. The proposed fuzzy multi-objective integer linear programming model (FMOILP) improves the transport planning process for material procurement at the first-tier supplier level, which is subject to product groups composed of items that must be ordered together, order lot sizes, fuzzy aspiration levels for inventory and used trucks and uncertain truck maximum available capacities and minimum percentages of demand in stock. Regarding the defuzzification process, we apply two existing methods based on the weighted average method to convert the FMOILP into a crisp MOILP to then apply two different aggregation functions, which we compare, to transform this crisp MOILP into a single objective MILP model. A sensitivity analysis is included to show the impact of the objectives weight vector on the final solutions. The model, based on the full truck load material pick method, provides the quantity of products and number of containers to be loaded per truck and period. An industrial automobile supply chain case study demonstrates the feasibility of applying the proposed model and the solution methodology to a realistic procurement transport planning problem. The results provide lower stock levels and higher occupation of the trucks used to fulfill both demand and minimum inventory requirements than those obtained by the manual spreadsheet-based method. (C) 2014 Elsevier Inc. All rights reserved.This work has been funded partly by the Spanish Ministry of Science and Technology project: Production technology based on the feedback from production, transport and unload planning and the redesign of warehouses decisions in the supply chain (Ref. DPI2010-19977) and by the Universitat Politecnica de Valencia project 'Material Requirement Planning Fourth Generation (MRPIV) (Ref. PAID-05-12)'.Díaz-Madroñero Boluda, FM.; Peidro Payá, D.; Mula, J. (2014). A fuzzy optimization approach for procurement transport operational planning in an automobile supply chain. Applied Mathematical Modelling. 38(23):5705-5725. https://doi.org/10.1016/j.apm.2014.04.053S57055725382

Multi-Objective Closed-loop Supply Chain Considering Vehicles and Solving by New Approaches in Metaheuristics

Recently, concerns have been raised about the environmental and social impacts of commercial activities. Also, most papers on the design of the supply chain network, focus on economic performance. Recently, some studies have considered environmental and social dimensions. There are still some gaps in modelling social impacts along with environmental and economic impacts. In this study, a multi-objective probabilistic model for designing a sustainable closed-loop logistics network is presented under uncertainty. The goals of this model consist of cost reduction, increasing social impact and decreasing environmental impacts. Then the model was solved not only using well-known Metaheuristic algorithms including genetic algorithm and Simulated Annealing (SA) algorithm, but also new whale optimization algorithm along with its improved combination method was used. Performance of algorithms was compared through examining different experiments and designed test problems. They compared in different situations and some important criteria. The results show the superiority of the whale optimization algorithm

Integrated Air Transportation and Production Scheduling Problem with Fuzzy Consideration

Nowadays, several methods in production management mainly focus on the different partners of supply chain management. In real world, the capacity of planes is limited. In addition, the recent decade has seen the rapid development of controlling the uncertainty in the production scheduling configurations along with proposing novel solution approaches. This paper proposes a new mathematical model via strong recent meta-heuristics planning. This study firstly develops and coordinates the integrated air transportation and production scheduling problem with time windows and due date time in Fuzzy environment to minimize the total cost. Since the problem is NP-hard, we use four meta-heuristics along with some new procedures and operators to solve the problem. The algorithms are divided into two groups: traditional and recent ones. Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) as traditional algorithms, also Keshtel Algorithm (KA) and Virus Colony Search (VCS) as the recent ones are utilized in this study. In addition, by using Taguchi experimental design, the algorithm parameters are tuned. Besides, to study the behavior of the algorithms, different problem sizes are generated and the results are compared and discussed