There are many sub-tour elimination constraint (SEC) formulations for the traveling salesman problem (TSP). Among the different methods found in articles, usually three apply more than others. This study examines the Danzig–Fulkerson–Johnson (DFJ), M...
Sea transportation such as that by container ships has an essential role in the economy both locally and internationally. Ships are a major commodity in distributing goods over long distances due to their relatively low price compared to air shipping...
Ant colony optimization (ACO) is a well-known class of swarm intelligence algorithms suitable for solving many NP-hard problems. An important component of such algorithms is a record of pheromone trails that reflect colonies’ experiences with p...
Reinforcement learning is an important technique in various fields, particularly in automated machine learning for reinforcement learning (AutoRL). The integration of transfer learning (TL) with AutoRL in combinatorial optimization is an area that re...
The No-wait Flowshop Scheduling Problem (NWFSP) has always been a research hotspot because of its importance in various industries. This paper uses a matheuristic approach that combines exact and heuristic algorithms to solve it with the objective to...
This study adopts the flow shop concept used in industrial production to schedule repetitive non-linear construction projects, where specialized groups of workers execute processes in work zones (buildings) in a predefined order common to all groups....