Open shop scheduling problems (OSSP) are highly significant in engineering and industry, involving critical scheduling challenges. The job type determines the duration required for material transfer between machines and remains unaffected by distance, eliminating any waiting time for transfers....

The flexible job shop scheduling problem (FJSSP) is a complex optimization challenge that plays a crucial role in enhancing productivity and efficiency in modern manufacturing systems, aimed at optimizing the allocation of jobs to a variable set of machines. This paper introduces an algorithm to...

Purpose - This study aims to examine the impact of the decision makers' risk preference on logistics routing problem, contributing to logistics behavior analysis and route integration optimization under uncertain environment. Due to the unexpected events and complex environment in modern...

Algorithms play an increasingly important role in economic situations. Often these situations are strategic, where the artificial intelligence may or may not be cooperative. We study the determinants and forms of algorithmic cooperation in the infinitely repeated prisoner's dilemma. We run a...

The quadratic assignment problem (QAP) is one of the most important combinatorial optimization problems in theory and practice. In this paper, we are proposing a hierarchical data-driven parallel memetic algorithm to solve the problem. A component-based hierarchical system architecture with a...

This paper tackles the green bike-sharing reposition problem (GBSRP) considering the reposition quality and carbon emission during the reposition simultaneously. With the expanding scale of today’s bikesharing system (BSS), the environmental pollution during the reposition becomes obvious....