With the rapid growth of e-commerce, platform-based financing in electronic business (EB) has emerged as an innovative solution for online retailers facing capital constraints. This study develops a Stackelberg game-theoretic framework to analyze strategic financing decisions in a two-tier e-commerce supply chain, where an electronic business platform (EBP) , as the leader, assumes leadership by setting financing interest rates, while a capital-constrained, loss-averse online retailer (LOR), as the follower, optimizes order quantities and financing participation under behavioral risk preferences. A hierarchical game-theoretic framework is established to examine strategic interactions between an EBP and a LOR, and the equilibrium outcomes are given. The model derives optimal decisions for both financing rates and ordering strategies. Results demonstrate that when the retailer's initial capital grows, their necessity for external financing diminishes correspondingly, leading to smaller order quantities due to reduced bankruptcy risk. Moreover, higher levels of loss aversion cause retailers to order less and avoid financing, reflecting risk-sensitive behavior. The study also presents comprehensive numerical analyses to explore additional managerial implications, offering insights into how capital availability and behavioral factors like loss aversion shape decision-making in EB financing environments.

The integrated energy system in the park faces challenges in producing and consuming renewable energy on a large scale as well as in achieving equilibrium between supply and demand for energy, making it a novel form in the study of integrated energy systems. The study takes the integrated energy system of the park as an example, and constructs a real-time rolling regulation model of two-layer optimal dispatch with multiple time scales. The model includes an upper-layer rolling economic optimization scheduling model and a lower-layer dynamic performance optimization control model, which takes economy and real-time as the objectives and realizes dynamic rolling optimization through model predictive control theory. The electric chillers are producing power to give cold energy during the whole dispatching cycle, while the absorption chillers produce power to supply cold energy only during the peak cold load period. The cold storage tank lowers the system’s operational costs by storing cold energy during low hours and releasing it during portions of the system’s high cold load hours. For the park's integrated energy system's primary energy exchange nodes 1 and 2, the micro gas turbine, and the gas boiler. The dynamic response process of the output power of the equipment takes a long time in model 2, with a value of about 10 min, while the time for the output value to reach the desired value is greatly reduced in model 1, with a value of about 4 min, and at the same time, it can foresee the change of the output power in advance, and make adjustments accordingly. The model constructed in the study has a more rapid calculation process and higher calculation accuracy in a short period of time, which has obvious advantages in online real-time prediction operation.

This paper addresses the challenge of rising operational costs in last-mile delivery caused by end-customer no-shows. The study proposes a collaborative operational framework for last-mile delivery that accommodates roaming customers, enabling them to be serviced by multiple depots as they transition between different locations. A mixed-integer programming (MIP) model is formulated to minimize the operational costs of last-mile delivery under the proposed framework. To improve the model’s practicality and computational efficiency, an adaptive large neighborhood search (ALNS) algorithm is developed, incorporating tailored neighborhood structures. Furthermore, a late acceptance strategy is embedded within the algorithm to mitigate the risk of premature convergence to local optima. The experimental results demonstrate that, in the absence of depot collaboration, the multi-depot model achieves a 16.9% reduction in operational costs compared to the single-depot model. Moreover, when depot collaboration is enabled, the average cost reduction percentage significantly increases to 40.37%. Notably, under the multi-depot collaborative framework, considering customers' roaming behavior—as opposed to fixed single-location assumptions—leads to a substantial 54.6% reduction in operational costs.

Based on complex networks, the innovation strategies of enterprises or governments are analyzed by using asymmetric evolutionary games. The evolutionary game model is considered to be a better way to promote collaborative innovation between large and small enterprises. First, a model is established based on the replicator dynamic equations. Then, based on complex network and computer simulation technology, a network evolutionary game model with improved strategy update rules including environmental preference utility is designed. The results show that the conclusions of the mathematical and network models of evolutionary stable strategies (ESS) are the same. The complex network model can provide more detailed information on the evolutionary processes of enterprises, and the parameter values can be adjusted to analyze the evolution sensitivity. In a uniform or non-uniform environment, the effect of environmental preference on evolution is weak, indicating that the effect of collaborative innovation on asymmetric enterprises is weak. The initial probability of enterprise collaborative innovation is the key to ESS. A dynamic model of asymmetric replication factor and an evolutionary game model composed of two participants of large technology enterprises and SMEs are established. Complex networks and environmental preferences are involved in evolutionary games to better analyze the ESS.

Collaboration and innovation among entities within high-tech industrial clusters are fundamental for establishing and augmenting their competitiveness, as well as ensuring the resilience and security of their supply chains. The article examines the adaptive evolution of value co-creation behavior among cluster enterprises by considering the interplay of various network attributes. It develops a stochastic evolution game model to analyze the interactive value co-creation behavior and performs a dynamic evolution simulation analysis. The study's findings indicate a critical threshold for the enhancement of knowledge complementarity and specialization superposition, which fosters the interactive coupling value co-creation behavior among cluster enterprises. This phenomenon exhibits an “inverted U-shaped” evolutionary pattern, initially promoting and subsequently suppressing such behavior. Notably, the critical threshold for specialization superposition is significantly lower than that for knowledge complementarity. Additionally, an increase in relationship strength can enhance the high interactive coupling value co-creation behavior of cluster enterprises. The enhancement of relational strength can result in significant interactive coupling and value co-creation among cluster enterprises; however, environmental random interference factors will not influence the final outcomes but will complicate the interactive coupling process among these enterprises. The government, in formulating adaptive policies for cluster innovation, should emphasize the enhancement of knowledge ecological niches within cluster enterprises, bolster specialization in industry segments, facilitate the establishment of interconnected industrial value chains, and foster trusting networks among cluster enterprises. This approach aims to mitigate the impact of environmental random interference factors, thereby promoting efficient interactive coupling and value co-creation among cluster enterprises. The interactive coupling value of co-creative activity among cluster firms can be effectively and continually developed.

In this paper, we study the problem of lot streaming scheduling in a remanufacturing shop with consistent sublots, where mixed production is not allowed between sublots possessing different types of remanufacturable parts. The problem is formulated as a multi-objective optimization problem with optimization objectives of recall cost and completion time. Such problems are NP-hard and need to be solved using an improved non-dominated sorting genetic algorithm. Two vectors regarding sublot size allocation and sublot processing order determination together form a solution. In order to improve the quality of the solution, the algorithm uses a randomization strategy and two heuristics to initialize the population and introduces dynamic genetic operations to advance the population diversity. On the one hand, the designed four types of genetic operators are dynamically selected according to the number of iterations. On the other hand, the elite retention strategy is improved, i.e., based on the probability that one of the individuals performing the crossover operation can come from the memory bank. Both numerical experiments and real case solving verify the effectiveness of the developed algorithms.

This article aims to develop the zero-inflated negative binomial-Lindley regression model to address the complexity of count data with zero excess and over-dispersion. The proposed compound distribution combines the zero generation mechanism with the Lindley distribution process, and the Bayesian hierarchical framework with MCMC sampling is adopted for parameter estimation, overcoming the limitations of traditional count models in handling complex data structures. The model is applied to two real datasets, one of which is characterized by a large number of zero observations. Its performance is compared with that of the NB-L and NB model. The results show that when the dataset presents the large number of zero values and the long tail feature, the ZINB-L GLM describes the dataset better than the other models.

Currently, multi-robot cooperative algorithms are widely used in the field of agriculture, which greatly improves the efficiency of agricultural production. However, the multi-robot cooperative operation of agricultural machinery is mostly limited to the efficiency and accuracy of scheduling. To address the mentioned shortcomings, a novel multi-task scheduling method based on improved particle swarm optimization algorithm is proposed, which is applied to the efficient collaborative scheduling problem of tomato picking robots and transfer vehicles in greenhouse cultivation of different scales. Firstly, the scene of collaborative scheduling between tomato automatic picking and transshipment is described, and the mathematical model of multi-machine collaborative scheduling is established with the shortest waiting time of picking robots and the minimum number of transshipment vehicles as the optimization objectives. Secondly, an improved particle swarm optimization algorithm is expounded in detail, which customizes the fitness function and enhances the particle update strategy. Finally, the experimental results show that the improved particle swarm optimization algorithm can not only determine the optimal number and execution order of cooperative robots, but also reduce the task execution time by 47% compared with the unimproved method.

We examine a two-tier supply chain of manufacturers and retailers distributing new and refurbished products through conventional channels. Manufacturers encroach on the refurbished product market by establishing new direct sales channels and enhancing service levels to maximize profits. Employing a game theory model, we investigate the optimal equilibrium scenarios, including the basic, partial, and full encroachment scenarios. We analyze the impact of manufacturer encroachment on sales quantity and profits for both manufacturers and retailers. Our findings reveal that partial encroachment has a lower threshold than full encroachment, and manufacturer encroachment consistently expands the market for refurbished products. Under certain conditions, manufacturer encroachment boosts their profits and benefits retailers, thereby alleviating channel conflicts. Surprisingly, retailers help manufacturers swiftly achieve the optimal range for direct selling costs. Once this range is attained, retailers and manufacturers actively compete in the refurbished product market, maintaining their optimal profit levels.

We consider the optimization problem related to the sugar beet transportation when supplying sugar mills in the sugar production. The sugar beet transportation comprises of loading the beet collected at storage piles and then delivering it to sugar mills. An essential prerequisite to guarantee a viability of the considered sugar mill, is to transport the required quantities of sugar beet while maximizing technological quality and minimizing transportation costs. Some growers may be privileged to conduct collection activities in days of a planning period when sugar beet is fresh and contains larger amount of sucrose, while others do not. This unfair collect scheduling plan should be avoided to provide equal treatment of growers. We propose an Integer Linear Programming (ILP) model with the aim of simultaneously maximizing the amount of collected sucrose during the planning period while minimizing the number of vehicles of a homogenous vehicle fleet, including constraints that provide equal opportunities for growers in sugar beet collection. The problem is denoted by the Sugar Beet Transportation Problem under Growers’ Equity Regulations (SBT-GER). By applying the weighted sum method, the two objective functions are combined to transform the bi-objective problem into a single-objective one. Equity regulations are expressed through the requirement that the minimum percentage of the quantity of sugar beet is guaranteed to be collected from each grower on the day of harvest. For real-sized instances, we propose two metaheuristic algorithms, based on Variable Neighborhood Search (VNS) and Greedy Randomized Adaptive Search Procedure (GRASP), respectively. The developed mathematical model and the proposed metaheuristic approaches are evaluated on a set of randomly generated test instances. The obtained results show that VNS outperforms exact solver and GRASP for the majority of examples.