Parallel computational optimization in operations research: A new integrative framework, literature review and research directions
G Schryen - European Journal of Operational Research, 2020 - Elsevier
Solving optimization problems with parallel algorithms has a long tradition in OR. Its future
relevance for solving hard optimization problems in many fields, including finance, logistics …
relevance for solving hard optimization problems in many fields, including finance, logistics …
Systematic literature review on parallel trajectory-based metaheuristics
In the past 35 years, parallel computing has drawn increasing interest from the academic
community, especially in solving complex optimization problems that require large amounts …
community, especially in solving complex optimization problems that require large amounts …
The one-commodity traveling salesman problem with selective pickup and delivery: An ant colony approach
We introduce a novel combinatorial optimization problem: the one-commodity traveling
salesman problem with selective pickup and delivery (1-TSP-SELPD), characterized by the …
salesman problem with selective pickup and delivery (1-TSP-SELPD), characterized by the …
Solving large batches of traveling salesman problems with parallel and distributed computing
In this paper, we describe and compare serial, parallel, and distributed solver
implementations for large batches of Traveling Salesman Problems using the Lin …
implementations for large batches of Traveling Salesman Problems using the Lin …
[BUCH][B] Advanced computational methods for knowledge engineering
Advanced computational methods for knowledge engineering Advances in Intelligent
Systems and Computing 282 Advanced Computational Methods for Knowledge …
Systems and Computing 282 Advanced Computational Methods for Knowledge …
Solving the electricity technician dispatch problem
The Multi-Depot Vehicle Routing Problem (MD-VRP) is a known routing problem whose
goal is to minimize the total cost while visiting a set of routes from their respective depots …
goal is to minimize the total cost while visiting a set of routes from their respective depots …
Optimization of construction site layout using dynamic hybrid bacterial and ant colony algorithm
PVH Son - Journal of Science and Technology in Civil …, 2021 - stce.huce.edu.vn
The efficient plan of site arrangement during the construction phase has been considered a
vital duty to successful project performance due to the productivity enhancement as well as …
vital duty to successful project performance due to the productivity enhancement as well as …
Solving the examination timetabling problem in gpus
The examination timetabling problem belongs to the class of combinatorial optimization
problems and is of great importance for every University. In this paper, a hybrid evolutionary …
problems and is of great importance for every University. In this paper, a hybrid evolutionary …
Parallel Cuckoo Search algorithm on OpenMP for traveling salesman problem
N Tzy-Luen, YT Keat, R Abdullah - 2016 3rd International …, 2016 - ieeexplore.ieee.org
Algorithmic parallelism arises naturally for population-based evolutionary algorithms. In this
paper, a subpopulation-based parallel Cuckoo Search (CS) algorithm on OpenMP (Open …
paper, a subpopulation-based parallel Cuckoo Search (CS) algorithm on OpenMP (Open …
An ant-colony-optimization based approach for determination of parameter significance of scientific workflows
In the process of a scientific experiment a workflow is executed multiple times using various
values of the parameters of activities. For real-world workflows that may contain hundreds of …
values of the parameters of activities. For real-world workflows that may contain hundreds of …