Wire rod and bar rolling is an important batch production process in steel production
systems. A scheduling problem originated from this process is studied in this work by …

The distributed permutation flowshop scheduling problem (DPFSP) has been a hot issue in
recent years. Due to the practical relevance of sequence-dependent setup time (SDST), we …

The distributed permutation flowshop scheduling problem (DPFSP) has attracted much
attention in recent years. In this paper, we extend the DPFSP by considering the sequence …

A new initial population strategy has been developed to improve the genetic algorithm for
solving the well‐known combinatorial optimization problem, traveling salesman problem …

This paper proposes a total of nine algorithms to minimize the makespan for the hybrid
flowshop scheduling problem with sequence-dependent setup times. The first six algorithms …

Abstract The Traveling Salesman Problem (TSP) is a classical NP-hard combinatorial
optimization problem with many practical variants. The Lin–Kernighan–Helsgaun (LKH) …

To minimize greenhouse gas emissions, the logistic field has seen an increasing usage of
electric vehicles. The resulting distribution planning problems present new computational …

With the advent of e-commerce and its fast-delivery expectations, efficiently routing pickers
in warehouses and distribution centers has received renewed interest. The processes and …

Over the last few decades, many nature-inspired algorithms have been proposed for solving
complex and difficult problems. Each algorithm has its own merits and drawbacks. One of …

The electric travelling salesman problem with time windows (ETSPTW) is an extension of the
well-known travelling salesman problem with time windows (TSPTW). The ETSPTW …