As an integral part of production planning control, order release management is critical to enhance the competitiveness and production efficiency of companies. Previous literature shows limited application of optimization-based models in assembly job shops, primarily due to the intricate nature of product structures and assembly operations. Therefore, based on the idea of the allocated clearing function (ACF) model, we introduce material flow constraints and complex assembly structure constraints during the assembly stage, proposing the assembly job shop allocated clearing function (AACF) model. The performance of the AACF model and the rule-based mechanisms in terms of cost and timing measures are compared through experiments containing 6 factors and 96 scenarios. The results show that the AACF model performs better in terms of cost management, service level and order due date deviation. In addition, a sensitivity analysis of the objective function parameters is performed to confirm the robustness of the AACF model. Finally, a case application in a real assembly shop illustrates the feasibility and validity of the proposed AACF model.

Assembly buildings, in the context of the low-carbon transformation of the construction industry, achieve superior outcomes in terms of carbon emission reduction, enhancement of building uniformity, and optimization of resource utilization as compared to traditional buildings. However, the supply chain for assembly building is marked by a significant susceptibility to risk and a need for timely fulfillment of requirements. This paper examines the risk of disruption and capacity limitations in the assembly building supply chain resulting from supply disruptions. It establishes a three-tier supply chain for assembly buildings, including primary component suppliers, backup suppliers, assembly manufacturers, and retailers. The study compares the optimal decision-making and coordination strategies of the supply chain members under centralized, decentralized, and joint agreements. The supply chain dual-source procurement decision coordination model is constructed by incorporating capacity constraints and analyzing the effects of supply disruption probability, repurchase coefficient, revenue sharing coefficient, cost, and other parameters on the expected profits of the supply chain members using arithmetic simulation. Research has indicated that when the likelihood of a disturbance occurring rises, the anticipated financial gain for the main provider decreases, while the predicted financial gain for the secondary supplier increases. The implementation of a collaborative agreement between the assembly maker and the parts backup provider would result in much greater anticipated profits compared to the decentralized decision-making approach. The impact of the revenue sharing coefficient on the predicted earnings of retailers and assembly manufacturers is more significant compared to the repurchase coefficient. The selection bias between NA and NB techniques under capacity constraints mostly arises from the assertiveness of the wholesale asking prices of inexpensive component suppliers, leading assembly manufacturers to increasingly prefer the NA option. This paper's research successfully achieves the contractual coordination of the assembly building supply chain, enhances the resilience of the assembly building supply chain, and promotes the long-term sustainable development of the assembly building supply chain.

With the organic integration of the Internet and remanufacturing industry, traditional manufacturers can recycle used products and sell products (including new and remanufactured products) through e-commerce retail platforms. A recycling and remanufacturing supply chain with three members (manufacturer, e-commerce retail platform, third-party recycler) is constructed in this paper. Manufacturer has remanufacturing capabilities, and the e-commerce retail platform can provide logistics service. In response to the organic integration of the Internet and remanufacturing industry, we mainly consider the pricing decisions of consumer preferences for online sales models and recycled products’ quality. Based on the impact of consumer used product recycling promotion activities on supply chain, a pricing game model was constructed for three recycling channels: manufacturer, e-commerce retail platform, and third-party recycler. Optimal pricing decision, logistics service level, used product recycling promotion intensity index, and recycling rate were obtained. Research has shown that consumer preferences can significantly improve supply chain logistics service level, pricing, market demand, and profits; Strengthening consumer awareness of remanufacturing used products and improving recycled products’ quality can not only lower consumer purchase prices and expand consumer demand, but also increase profits of supply chain members.

The stochastic contextual bandit problem, recognized for its effectiveness in navigating the classic exploration-exploitation dilemma through ongoing player-environment interactions, has found broad applications across various industries. This utility largely stems from the algorithms’ ability to accurately forecast reward functions and maintain an optimal balance between exploration and exploitation, contingent upon the precise selection and calibration of hyperparameters. However, the inherently dynamic and real-time nature of bandit environments significantly complicates hyperparameter tuning, rendering traditional offline methods inadequate. While specialized methods have been developed to overcome these challenges, they often face three primary issues: difficulty in adaptively learning hyperparameters in ever-changing environments, inability to simultaneously optimize multiple hyperparameters for complex models, and inefficiencies in data utilization and knowledge transfer from analogous tasks. To tackle these hurdles, this paper introduces an innovative transfer learning-based approach designed to harness past task knowledge for accelerated optimization and dynamically optimize multiple hyperparameters, making it well-suited for fluctuating environments. The method employs a dual Gaussian meta-model strategy—one for transfer learning and the other for assessing hyperparameters’ performance within the current task —enabling it to leverage insights from previous tasks while quickly adapting to new environmental changes. Furthermore, the framework’s meta-model-centric architecture enables simultaneous optimization of multiple hyperparameters. Experimental evaluations demonstrate that this approach markedly outperforms competing methods in scenarios with perturbations and exhibits superior performance in 70% of stationary cases while matching performance in the remaining 30%. This superiority in performance, coupled with its computational efficiency on par with existing alternatives, positions it as a superior and practical solution for optimizing hyperparameters in contextual bandit settings.

Increasing customer apprehensions regarding the security and nutritional value of agricultural goods are compelling governments and industries to implement traceable, transparent, and reputable logistics management systems. Blockchain-based agricultural logistics management systems guarantee the permanence of data once it is uploaded but cannot cope with the risk of data being falsified before uploading to the blockchain. In this work, we developed a collaborative game model between government bodies and agricultural enterprises based on the evolutionary game theory and explored the influencing factors of enterprises following the rules to share the real traceability information through numerical simulation using MATLAB. The findings show that government incentives and penalties promote positive behavior, and consumer and media supervision contribute to supply chain transparency, but firms tend to share truthful information only when it benefits them. This study builds upon existing research on the impact of social variables on both members' decision-making behavior. It highlights the positive roles of consumers and the media in the supervision of agricultural product traceability, which can help to raise public awareness of social responsibility and thus promote positive interaction in the market.

The Covid-19 pandemic has significantly impacted consumer behavior and commerce, prompting a shift towards online goods and services. The surge in demand has led to inefficiencies and disruptions, especially in the last-mile delivery (LMD) process. Because of the LMD, the final stage of the supply chain, plays a crucial role in transporting goods from businesses to consumers, challenges such as the cost inefficiencies of direct home delivery have underscored the need for innovative solutions. In this study, the collection delivery points (CDPs) approach was adopted instead of direct home delivery. It focuses on addressing these challenges by adopting service points as dynamic CDPs and handling the problem as a dynamic location routing problem (DLRP). Two solutions approaches are proposed, to select candidate depots strategically and determine efficient route configurations, to aim to minimize travel distance. One of them is a two-phased hierarchical method that starts with clustering and continues with an Ant Colony Optimization (ACO) based-hybrid algorithm, and the other one is based solely on an ACO-based hybrid algorithm. The performance of these approaches is evaluated on modified benchmark instances from the literature. It has been observed that the ACO based-hybrid algorithm is more successful in terms of total travel distance, and if an evaluation is made in terms of the number of routes, it is recommended that the results of the two-phased hierarchical method should also be considered. Furthermore, a real word case study was conducted with the proposed methods and the results were compared from different perspectives. The results corroborate the findings regarding benchmark instances, thereby providing additional validation to the results obtained.

With the development of a new generation of information technology, smart elderly care plays an important role in promoting the construction of elderly care services. The emerging application tools provide door-to-door meal service for urban elderly groups, solving meal problems for special and ordinary elderly with different priority levels and penalty costs of violating time windows. Based on this, considering the personalized needs of the elderly group, this study examines the route optimization problem of cooperative delivery of elderly meals by trucks and robots, and builds a mixed integer programming model to minimize the total cost of the system. For large-scale problems, this study designs an improved adaptive large neighbourhood search algorithm that incorporates simulated annealing algorithm and artificial bee colony algorithm to avoid falling into local optimality. Experiments have proved feasibility and effectiveness of the algorithm and proposed the corresponding management insights from the aspects of delivery efficiency and service quality.

Here, we consider the generalized travelling salesman problem (GTSP), which is a generalization of the travelling salesman problem (TSP). This problem has several real-life applications. Since the problem is complex and NP-hard, solving this problem by exact methods is very difficult. Therefore, researchers have applied several heuristic algorithms to solve this problem. We propose the application of genetic algorithms (GAs) to obtain a solution. In the GA, three operators—selection, crossover, and mutation—are successively applied to a group of chromosomes to obtain a solution to an optimization problem. The crossover operator is applied to create better offspring and thus to converge the population, and the mutation operator is applied to explore the areas that cannot be explored by the crossover operator and thus to diversify the search space. All the crossover and mutation operators developed for the TSP can be used for the GTSP with some modifications. A better combination of these two operators can create a very good GA to obtain optimal solutions to the GTSP instances. Therefore, four crossover and three mutation operators are used here to develop GAs for solving the GTSP. Then, GAs is compared on several benchmark GTSPLIB instances. Our experiment shows the effectiveness of the sequential constructive crossover operator combined with the insertion mutation operator for this problem.

On the production side, blockchain is being widely applied to agricultural product supply chains (APSCs), which can effectively improve circulation efficiency and reduce transportation losses. On the sales side, many companies are utilizing key opinion leaders (KOLs) to promote and sell agricultural products. The combination of the two enhances the farm-to-fork transparency of agricultural products and stimulates consumer purchases. Based on these, we construct four theoretical models to study blockchain investment and livestreaming mode strategies in the APSC. The results show that investing in blockchain always stimulates consumer purchases of agricultural products, while KOL livestreaming increases consumer purchases only when the increase-traffic power is greater than a certain threshold. There is a win-win situation where the fresh product supplier (FPS) and the e-retailer can benefit from investing in blockchain and introducing KOL livestreaming, respectively. Investing in blockchain is always beneficial for the KOL, and there is free-riding behavior in the APSC. Interestingly, the enhanced increase-traffic power within a certain interval may become a negative driving force, seriously harming the FPS. In addition, we find that investing in blockchain and introducing KOL livestreaming does not always benefit consumer surplus and social welfare, which depend on the KOL’s increase-traffic power, commission rate, and unit cost.

This paper addresses the problem of activity scheduling and operator assignment in workstations of aerospace assembly lines. The problem is modelled as a new variant of the Multi-Mode Resource Constrained Project Scheduling Problem (MRCPSP), which incorporates practical features from aerospace workstations in assembly lines. These workstations have a substantial number of activities to be scheduled within a given assembly cycle time. It introduces particularities which are not usually addressed such as considering additional workers for performing activities, different workers’ proficiency, and spatial limitations in work zones. The objective is to schedule the activities of an aerospace workstation, minimising the total labour cost, while satisfying the cycle time and the zone’s limitations. The problem is initially formulated by employing mixed-integer linear programming methods with mathematical modelling and solved using two different algorithms: an Ant Colony System (ACS) and a memetic ACS. Given the novelty of the problem presented, new sets of benchmark cases of different sizes for this problem are also proposed and solved. To assess the performance of the algorithms, the solutions for the small-sized instances are compared in terms of deviation with the results obtained by an optimisation modelling software. Further experimentation with the algorithms is carried out with medium and large instances, showing good performance and providing reasonably good results in realistic problems.