A comprehensive analysis of nature-inspired meta-heuristic techniques for feature selection problem
M Sharma, P Kaur - Archives of Computational Methods in Engineering, 2021 - Springer
Meta-heuristics are problem-independent optimization techniques which provide an optimal
solution by exploring and exploiting the entire search space iteratively. These techniques …
solution by exploring and exploiting the entire search space iteratively. These techniques …
Levy flights in metaheuristics optimization algorithms–a review
M Chawla, M Duhan - Applied Artificial Intelligence, 2018 - Taylor & Francis
In recent years, Levy flight (LF) is increasingly being employed as search mechanism in
metaheuristics optimization algorithms (MOA) to solve complex real world problems. LF …
metaheuristics optimization algorithms (MOA) to solve complex real world problems. LF …
[HTML][HTML] Approaches for BIM-based multi-objective optimization in construction scheduling
Construction scheduling is a complex process due to the interdependence and contradiction
of project activities. This requires applying population-based optimization algorithms like …
of project activities. This requires applying population-based optimization algorithms like …
On solving periodic re-optimization dynamic vehicle routing problems
Abstract The Vehicle Routing Problem (VRP) is a complex and high-level set of routing
problems. One of its important variants is the Dynamic Vehicle Routing Problem (DVRP) in …
problems. One of its important variants is the Dynamic Vehicle Routing Problem (DVRP) in …
Dynamic vehicle routing problems with enhanced ant colony optimization
H Xu, P Pu, F Duan - Discrete Dynamics in Nature and Society, 2018 - Wiley Online Library
As we all know, there are a great number of optimization problems in the world. One of the
relatively complicated and high‐level problems is the vehicle routing problem (VRP) …
relatively complicated and high‐level problems is the vehicle routing problem (VRP) …
An optimization algorithm for a capacitated vehicle routing problem with time windows
P Kirci - Sādhanā, 2016 - Springer
In this paper, vehicle routing problem (VRP) with time windows and real world constraints
are considered as a real-world application on google maps. Also, tabu search is used and …
are considered as a real-world application on google maps. Also, tabu search is used and …
[HTML][HTML] Constructing initial solutions for the multiple vehicle pickup and delivery problem with time windows
Abstract The Multiple Vehicle Pickup and Delivery Problem with Time Windows (MV-
PDPTWs) is an important problem in logistics and transportation. However, this problem is …
PDPTWs) is an important problem in logistics and transportation. However, this problem is …
Heuristic and metaheuristic solutions of pickup and delivery problem for self-driving taxi routing
Self-driving car automated control problem includes automated routing problem. This paper
addresses the self-driving taxi routing problem formalized as the Pickup and Delivery …
addresses the self-driving taxi routing problem formalized as the Pickup and Delivery …
Parameter adaptation and criticality in particle swarm optimization
CG Cordero - arxiv preprint arxiv:1705.06966, 2017 - arxiv.org
Generality is one of the main advantages of heuristic algorithms, as such, multiple
parameters are exposed to the user with the objective of allowing them to shape the …
parameters are exposed to the user with the objective of allowing them to shape the …
Relative performance of certain meta heuristics on vehicle routing problem with time windows
V Katiyar - International Journal of Information Technology and …, 2015 - mecs-press.org
Abstract Solving Vehicle Routing Problem (VRP) and its variants arise in many real life
distribution systems. Classical VRP can be described as the problem of finding minimum …
distribution systems. Classical VRP can be described as the problem of finding minimum …