Evaluation of the Simulated Annealing and the Discrete Artificial Bee Colony in the Weight Tardiness Problem with Taguchi Experiments Parameterization [PDF]
, 2017 Meta-Heuristics (MH) are the most used optimization techniques to approach Complex Combinatorial Problems (COPs). Their ability to move beyond the local optimums make them an especially attractive choice to solve complex computational problems, such as ...
Madureira, Ana M. +2 more
core +1 more source
Solving the Mask Data Preparation Scheduling Problem Using Meta-Heuristics
IEEE Access, 2019 Mask data preparation (MDP) is a part of the mask data process for fabricating semiconductors, and its importance has commonly been neglected. This paper proposes an integer linear programming model and two meta-heuristics, a genetic algorithm (GA) and ...
Kuo-Ching Ying +4 more
doaj +1 more source
A New Approach for Solving the Disruption in Vehicle Routing Problem during Delivery
Современные информационные технологии и IT-образование, 2020 The purpose of this paper is to describe a new approach for solving the disruption in vehicle routing problem (DVRP) which deals with the disruptions that occur abruptly when executing the original plan.
Julia Sidorova, Sai Chandana Kaja
doaj +1 more source
Applying Learning and Self-Adaptation to Dynamic Scheduling
Applied Sciences, 2023 Real-world production scheduling scenarios are often not discrete, separable, iterative tasks but rather dynamic processes where both external (e.g., new orders, delivery shortages) and internal (e.g., machine breakdown, timing uncertainties, human ...
Bernhard Werth +4 more
doaj +1 more source
The Project Scheduling Problem with Non-Deterministic Activities Duration: A Literature Review [PDF]
, 2018 Purpose: The goal of this article is to provide an extensive literature review of the models and solution procedures proposed by many researchers interested on the Project Scheduling Problem with nondeterministic activities duration.
Diaz-Serna, F. Javier +1 more
core +4 more sources
On the prediction of pseudo relative permeability curves: meta-heuristics versus Quasi-Monte Carlo
Oil & Gas Science and Technology, 2019 This article reports the first application of the Quasi-Monte Carlo (QMC) method for estimation of the pseudo relative permeability curves. In this regards, the performance of several meta-heuristics algorithms have also been compared versus QMC ...
Fazelabdolabadi Babak +3 more
doaj +1 more source
MathematicsThis study focuses on the scheduling problem of heterogeneous unmanned surface vehicles (USVs) with obstacle avoidance pretreatment. The goal is to minimize the overall maximum completion time of USVs.
Zhenfang Ma +3 more
doaj +1 more source
Ant colony system (ACS) with hybrid local search to solve vehicle routing problems
KKU Engineering Journal, 2016 This research applied an Ant Colony System algorithm with a Hybrid Local Search to solve Vehicle Routing Problems (VRP) from a single depot when the customers’ requirements are known.
Suphan Sodsoon +2 more
doaj +1 more source
Applying Modern Meta-Heuristics in Intelligent Systems
Applied Sciences, 2022 Engineering and business problems are increasingly impenetrable due to the new economics triggered by big data, artificial intelligence, and the Internet of things [...]
Peng-Yeng Yin
doaj +1 more source
Case-based reasoning for meta-heuristics self-parameterization in a multi-agent scheduling system [PDF]
, 2013 A novel agent-based approach to Meta-Heuristics self-configuration is proposed in this work. Meta-heuristics are examples of algorithms where parameters need to be set up as efficient as possible in order to unsure its performance.
Madureira, Ana Maria +2 more
core