The geographical dispersion of collaborative factories may provide the cost-saving potential for manufacturers and lead them to easier fit the global markets. On the other hand, in such networks of factories, coordination is very important for the just-in-time delivery of orders. This study...

When dynamic production capacity is considered in production lot-sizing plans, it becomes very challenging to efficiently determine the optimal production plan. Many papers apply “at most one fractional production period” to develop efficient algorithms, but those algorithms are still...

Artificial intelligence (AI) and machine learning (ML) algorithms have transformed various industries, including healthcare. Healthcare organizations are now using AI and ML algorithms to drive strategic leadership and decision-making, as they provide insights that help organizations manage...

Harmony search algorithm (HS) cannot always avoid being trapped in local optima, and several local search algorithms have recently been used to overcome this limitation by searching the neighborhood of some solution for improved ones. However, how local search affects the performance of HS has...

Aiming at the problems of sharp path turning points, weak search directionality, and excessive number of calculation nodes in the traditional star algorithm when planning paths, the angle constraint, the way guide strategy, and the path search step size of the A star algorithm are improved....

We define the \emph{adjacent vertex distinguishing sum edge coloring problem}. This problem consists in finding an assignment of colors to the edges of a graph with the following constraints: every pair of adjacent edges must have a different color, and every pair of adjacent vertices must not...

This paper studies an extension of the rural postman problem with multiple depots and rechargeable and reusable vehicles capable of multiple trips with capacity constraints. This paper presents a new Mixed Integer Linear Programming (MILP) formulation to find optimal solutions to the problem....

This paper presents two heuristic algorithms for the distance-based critical node problem (DCNP) that finds k nodes whose removalminimizes the pairwise connection within D hops in the remaining network. The structural properties of complex networks havenot yet been extensively addressed in the...

The necessity for extensive historical data, variables, and weight determination still presents challenges and complexity, notwithstanding the growth in research on socio-ecological vulnerability to climate change. In order to fill in these gaps, this study uses China’s Fujian Province as a...

We consider a competitive facility location model with uncertain customers’ parameters. The model is built on the base of a Stackelberg game framework where competing parties (the Leader and the Follower) sequentially decide on opening their facilities. In the model, the Leader does not have a...