This paper proposes a hybrid genetic algorithm for solving the Multiple Traveling Salesman
Problem (mTSP) to minimize the length of the longest tour. The genetic algorithm utilizes a …

Batch scheduling problems are NP-hard and often coupled with logistics optimization
problems in industrial manufacturing scenarios, further increasing the challenge of decision …

The travelling salesman problem (TSP) and its variants have been studied extensively due
to its wide range of real-world applications, yet there are challenges in providing efficient …

Energy consumption, production cost, and efficiency are highly concerned by decision
makers of energy-intensive and high-cost industrial production systems. Intelligent …

It is standard practice in the steel industry to create schedules for different production lines in
a sequential fashion. However, by the nature of this greedy-type optimization, the objective …

The multiple traveling salesman problems (MTSP), which arise from real world problems,
are essential in urban logistics. Variations such as MinMax-MTSP and Bounded-MTSP aim …

The scheduling of prefabricated component production is crucial for production efficiency
and timely delivery in off-site construction (OSC). However, the prevalence of mixed-flow …

Recently, the multimodal last-mile e-mobility concept has been at the center of attention for
cleaner, greener, and more accessible urban deliveries. As part of sustainable …

This chapter aims at comparing two genetic algorithms (GA) designed for steel production
planning. While the first GA attempts to minimize production costs globally by scheduling …

Recently, the multimodal last‐mile e‐mobility concept has been at the center of attention for
cleaner, greener, and more accessible urban deliveries. As part of sustainable …