Artificial neural networks (ANNs) are one of the artificial intelligence techniques used in real-world problems and applications encountered in almost all industries such as education, health, chemistry, food, informatics, logistics, transportation. ANN is widely used in many techniques such as optimization, modelling, classification and forecasting, and many empirical studies have been carried out in areas such as planning, inventory management, maintenance, quality control, econometrics, supply chain management and logistics related to ANN. The most important and just as hard stage of ANNs is the learning process. This process is about finding optimal values in the search space for different datasets. In this process, the values generated by training algorithms are used as network parameters and are directly effective in the success of the neural network (NN). In classical training techniques, problems such as local optimum and slow convergence are encountered. Meta-heuristic algorithms for the training of ANNs in the face of this negative situation have been used in many studies as an alternative. In this study, a new hybrid algorithm namely MVOSANN is suggested for the training of ANNs, using Simulated annealing (SA) and Multi-verse optimizer (MVO) algorithms. The suggested MVOSANN algorithm has been experimented on 12 prevalently classification datasets. The productivity of MVOSANN has been compared with 12 well-recognized and current meta-heuristic algorithms. Experimental results show that MVOSANN produces very successful and competitive results.

This paper considers simultaneously two areas of facility location and assortment planning in a competitive environment. In fact, a chain store that has competitors in the market locates a new facility. As there are different products in the market that can substitute with each other, it is intended to determine the best product assortment as well. An integer nonlinear programming problem is proposed to model the mentioned subject. For solving the model, the problem is reformulated as a mixed integer linear programming one. Therefore, a MIP solver software can be used for solving the small- and medium-size problems. For large-scale problems, a firefly algorithm is designed for obtaining a satisfactory solution. By using the proposed model, it is numerically shown that, in addition to the optimal location, it is also necessary to determine simultaneously the best product assortment for the new store. Actually, comparison results reveal that the location significantly affects the assortment scenarios for the new store. In other words, the selection of new store locations may lead to loss of large profit if the assortment planning is neglected.

Guided by a real case, this paper efficiently proposes a new metaheuristic algorithm based on Simulated Annealing to solve the Heterogeneous Vehicle Routing Problem with Time Windows to deliver fresh meat in urban environments. Our proposal generates an initial feasible solution using a hybrid heuristic based on the well-known Travelling Salesman Problem (TSP) solution and, subsequently, refining it through a Simulated Annealing (SA). We have tested the efficiency of the proposed approach in a company case study related to the planning of the transportation of a regional distribution center meat company to customers within the urban and rural perimeter of Bogotá, Colombia. The main goal is to reach a service level of 97% while reducing operational costs and several routes (used vehicles). The results show that the proposed approach finds better routes than the current ones regarding costs and service level within short computing times. The proposed scheme promises to solve the refrigerated vehicle routing problem.

Manufacturers today need to optimize their fabrication runtime decision by meeting short customer order due dates externally and managing the potentially unreliable machines and manufacturing processes internally. Outsourcing and overtime are commonly utilized strategies to expedite fabricating time. Additionally, detailed analyses and necessary actions on inevitable product defects (i.e., removal of scraps) and equipment breakdowns (such as machine repairing) are prerequisites to fabrication runtime planning. Motivated by assisting today’s manufacturers decide the best batch runtime plan under the situations mentioned above, this study applies mathematical modeling to a hybrid fabrication problem that incorporates partial overtime and outsourcing, inevitable product defects, and a Poisson-distributed breakdown. We develop a model to accurately represent the problem’s characteristics. Formulations and detailed model analyses allow us to find the cost function first. Differential equations and algorithms help us confirm the gain function’s convexity and find the best runtime decision. Lastly, we use numerical illustrations to show our study’s applicability by revealing in-depth crucial managerial information of the studied problem.

The growing popularity of aggregation platforms has attracted widespread attention in the ride-hailing market in recent years. In order to obtain additional orders by charging commissions and slotting fees, many ride-hailing platforms choose to bundle with aggregation platforms. Unlike traditional reseller electronic channels, the bundle channels may affect pricing of platforms, service levels of drivers, market demands and they may further impact on profits. These different attitudes raise an interesting and key question about the influence of bundle channels in ride-hailing platforms. In this paper, we propose an analytical framework for pricing strategies of ride-hailing and aggregation platforms under bundle mode and analyze their pricing process from the perspective of Nash and Stackelberg games, where the platforms serve as leaders to determine optimal prices through Nash equilibrium and the drivers serve as followers to provide optimal service levels. Through sensitivity analysis of service levels and costs, we capture the distribution trends of profits between the platforms. Based on some numerical examples and results analysis, some interesting managerial insights on pricing of ride-hailing and aggregation platforms are gained.

Social dilemmas describe conflict situations between immediate self-interest and longer-term collective interests. In these situations, it is better that all players work together to attain a common goal, but individuals may threaten the best payoff of the group by free-riding. Human behavior in a pandemic is one example of a social dilemma but wait-and-see games and relying on herd immunity to get a free ride generates a threat of continuing the pandemic. This study aims to use probabilistic incentives given by a third party as a mechanism to inhibit free-riding behavior by promoting cooperation in the volunteer dilemma game. For more realistic human behavior simulation, we use an agent-based model of network topology. When the parameters of the problem change gradually, an abrupt jump in the cooperation rate may happen and lead to a significant shift in the outcome. Catastrophe theory is a valuable approach to survey these nonlinear changes. This study tries to give some managerial insights to the decision-makers to find the minimum level of necessary effort in which the cooperation dominates the defection.

The study examines the combined effect of rework, multiple shipments, postponement, and overtime producing common-component on a multiproduct vendor-client incorporated system. Clients’ product demand trend turns to diversity, quality, and rapid response in the current supply-chain environment. Under such a stiff competitive environment, today’s manufacturers must effectively plan their multi-item fabrication to boost utilization and product quality, minimize total relevant costs, and meet short given order lead time. By considering the commonality of the finished goods, required quality, and completion lead time, this study presents an exact model featuring rework of defects, multiple shipments, postponement, overtime producing the mutual component, and satisfying the market needs. Through the techniques of explicitly modeling, formulating, and system cost minimization, this study simultaneously derives the optimal cycle-time and shipping frequency for the studied problem. A numerical example helps show how our model works for any given parameter values and how the variation in single and multiple factors of the problem affects the crucial system performances (e.g., total uptimes, each relevant cost, utilization, total cost, etc.) A wide variety of today’s industries (e.g., automotive, household goods, etc.) and their related supply chains can utilize our decisional model to reveal in-depth managerial insights for planning their fabrication and shipments.

In this research integrated scheduling of machines and automated guided vehicles (AGVs) in a flexible job shop environment is addressed. The scheduling literature generally ignores the transportation of jobs between the machines and when considered typically assumes an unlimited number of AGVs. In order to comply with Industry 4.0 requirements, today’s manufacturing systems make use of AGVs to transport jobs between the machines. The addressed problem involves simultaneous assignment of operations to one of the alternative machines, determining the sequence of operations on each machine and assignment of transportation operations between machines to an available AGV. We present a Microsoft Excel® spreadsheet-based solution for the problem. Evolver®, a proprietary GA is used for the optimization. The GA routine works as an add-in to the spreadsheet environment. The flexible job shop model is developed in Microsoft Excel® spreadsheet. The assignment of AGV is independent of the GA routine and is done by the spreadsheet model while the GA finds the assignment of operations to the machines and then finds the best sequence of operations on each machine. Computational analysis demonstrates that the proposed method can effectively and efficiently solve a wide range of problems with reasonable accuracy. Benchmark problems from the literature are used to highlight the effectiveness and efficiency of the proposed implementation. In most of the cases the proposed implementation can find the best-known solution found by previous studies.

This paper recommends a new kind of assembly line rebalancing and worker assignment problem, taking ergonomic risks into account. Assembly line rebalancing problem (ALRBP) occurs when a current line must be rebalanced due to conditions such as changes in demand, production processes, product design, or quality issues. Although there are several research attempts on ALRBP in the relevant literature, only a few studies consider workers as unique individuals. This paper aims to solve the double reassignment problem: tasks to workers and workers to stations, considering ergonomic risk factors. This paper is the first study that comprises worker assignment and ergonomic constraints in ALRBP literature to the best of our knowledge. Objectives of our novel problem are to minimize rebalancing cost, which includes transportation of tasks and workers and minimize stations' ergonomic risk factors. A randomized constructive rule-based heuristic approach is developed to cope with the problem. The proposed solution approach is applied to benchmark data, and obtained results are promising. Moreover, the proposed solution approach is implemented in an automotive parts manufacturing plant.

This research proposes a dynamic decision-making framework for a hybrid production system that incorporates manufacturing and remanufacturing procedures into a closed-loop supply chain network with merchandise substitution and shortages within traditional markets (TM) and electronic markets (EM). In particular, we develop models of profit maximization and equilibrium analysis by using calculus with dynamic programming under four business schemes, including a manufacturing-only model within TM/EM and a hybrid remanufacturing model within TM/EM. Dynamic decision-making planning was taken for brand-new and like-new decayed merchandise in hybrid production systems. The results demonstrate that solutions generated within EMs surpass those within TMs in terms of maximizing profits. Further, the hybrid remanufacturing model did not surpass the manufacturing-only model under a general setting, but had better performance under certain conditions, including intense competition, a smaller remanufacturing cost, a larger brand-new merchandise market size, and a smaller like-new merchandise market size.