The third comprehensive survey on scheduling problems with setup times/costs
A Allahverdi - European journal of operational research, 2015 - Elsevier
Scheduling involving setup times/costs plays an important role in today's modern
manufacturing and service environments for the delivery of reliable products on time. The …
manufacturing and service environments for the delivery of reliable products on time. The …
Learning to select operators in meta-heuristics: An integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem
M Karimi-Mamaghan, M Mohammadi… - European Journal of …, 2023 - Elsevier
This paper aims at integrating machine learning techniques into meta-heuristics for solving
combinatorial optimization problems. Specifically, our study develops a novel efficient …
combinatorial optimization problems. Specifically, our study develops a novel efficient …
Iterated local search: Framework and applications
The key idea underlying iterated local search is to focus the search not on the full space of
all candidate solutions but on the solutions that are returned by some underlying algorithm …
all candidate solutions but on the solutions that are returned by some underlying algorithm …
An efficient harris hawk optimization algorithm for solving the travelling salesman problem
FS Gharehchopogh, B Abdollahzadeh - Cluster Computing, 2022 - Springer
Abstract Travelling Salesman Problem (TSP) is an Np-Hard problem, for which various
solutions have been offered so far. Using the Harris Hawk Optimization (HHO) algorithm, this …
solutions have been offered so far. Using the Harris Hawk Optimization (HHO) algorithm, this …
A heuristic algorithm for a single vehicle static bike sharing rebalancing problem
The static bike rebalancing problem (SBRP) concerns the task of repositioning bikes among
stations in self-service bike-sharing systems. This problem can be seen as a variant of the …
stations in self-service bike-sharing systems. This problem can be seen as a variant of the …
An artificial bee colony algorithm with a modified choice function for the traveling salesman problem
Abstract The Artificial Bee Colony (ABC) algorithm is a swarm intelligence approach which
has initially been proposed to solve optimisation of mathematical test functions with a unique …
has initially been proposed to solve optimisation of mathematical test functions with a unique …
Metaheuristic algorithms for the hybrid flowshop scheduling problem
The hybrid flowshop scheduling problem (HFSP) has been widely studied in the literature,
as it has many real-life applications in industry. Even though many solution approaches …
as it has many real-life applications in industry. Even though many solution approaches …
An energy-efficient permutation flowshop scheduling problem
The permutation flowshop scheduling problem (PFSP) has been extensively explored in
scheduling literature because it has many real-world industrial implementations. In some …
scheduling literature because it has many real-world industrial implementations. In some …
Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion
The no-idle permutation flowshop scheduling problem (NIPFSP) extends the well-known
permutation flowshop scheduling problem, where idle time is not allowed on the machines …
permutation flowshop scheduling problem, where idle time is not allowed on the machines …
Hybrid metaheuristics for the clustered vehicle routing problem
Abstract The Clustered Vehicle Routing Problem (CluVRP) is a variant of the Capacitated
Vehicle Routing Problem in which customers are grouped into clusters. Each cluster has to …
Vehicle Routing Problem in which customers are grouped into clusters. Each cluster has to …