General variable neighborhood search algorithm to minimize makespan of the distributed no-wait flow shop scheduling problem
M Komaki, B Malakooti - Production Engineering, 2017 - Springer
This paper addresses minimizing makespan of the distributed no-wait flow shop scheduling
problem where there are several identical factories that work in parallel. There are jobs with …
problem where there are several identical factories that work in parallel. There are jobs with …
A general evolutionary framework for different classes of critical node problems
R Aringhieri, A Grosso, P Hosteins… - … Applications of Artificial …, 2016 - Elsevier
We design a flexible Evolutionary Framework for solving several classes of the Critical Node
Problem (CNP), ie the maximal fragmentation of a graph through node deletion, given a …
Problem (CNP), ie the maximal fragmentation of a graph through node deletion, given a …
Parallel variable neighborhood search for the min–max order batching problem
B Menendez, EG Pardo… - International …, 2017 - Wiley Online Library
Warehousing is a key part of supply chain management. It primarily focuses on controlling
the movement and storage of materials within a warehouse and processing the associated …
the movement and storage of materials within a warehouse and processing the associated …
Robust total energy demand estimation with a hybrid Variable Neighborhood Search–Extreme Learning Machine algorithm
Energy demand prediction is an important problem whose solution is evaluated by policy
makers in order to take key decisions affecting the economy of a country. A number of …
makers in order to take key decisions affecting the economy of a country. A number of …
A hybrid algorithm combining genetic algorithm and variable neighborhood search for process sequencing optimization of large-size problem
Y Luo, Y Pan, C Li, H Tang - International Journal of Computer …, 2020 - Taylor & Francis
On the premise of satisfying the process priority relationship, there are many kinds of
feasible sequencing schemes. How to obtain the optimal process sequencing meeting the …
feasible sequencing schemes. How to obtain the optimal process sequencing meeting the …
[HTML][HTML] A hybrid breakout local search and reinforcement learning approach to the vertex separator problem
Abstract The Vertex Separator Problem (VSP) is an NP-hard problem which emerges from a
variety of important domains and applications. In this paper, we present an improved …
variety of important domains and applications. In this paper, we present an improved …
A decomposition structure learning algorithm in Bayesian network based on a two-stage combination method
H Guo, H Li - Complex & Intelligent Systems, 2022 - Springer
Decomposition hybrid algorithms with the recursive framework which recursively
decompose the structural task into structural subtasks to reduce computational complexity …
decompose the structural task into structural subtasks to reduce computational complexity …
A variable neighborhood search approach for the vertex bisection problem
Abstract The Vertex Bisection Problem (VBP) belongs to the family of well-known graph
partitioning problems, where the main goal is to find a partition of the vertices maximizing or …
partitioning problems, where the main goal is to find a partition of the vertices maximizing or …
A Multi-Objective Parallel Iterated Greedy for Solving the p-Center and p-Dispersion Problem
This paper generalizes the iterated greedy algorithm to solve a multi-objective facility
location problem known as the Bi-objective p-Center and p-Dispersion problem (B p CD) …
location problem known as the Bi-objective p-Center and p-Dispersion problem (B p CD) …
A variable neighborhood search approach for the Hamiltonian p-median problem
Abstract The Hamiltonian p-Median Problem (HpMP) is a generalization of the well-known
Traveling Salesman Problem (TSP), where the goal is to find p non-intersecting cycles in an …
Traveling Salesman Problem (TSP), where the goal is to find p non-intersecting cycles in an …