|
|
|
|
|
Fakhar Uddin, Naveed Riaz, Abdul Manan, Imran Mahmood, Oh-Young Song, Arif Jamal Malik and Aaqif Afzaal Abbasi
The travelling salesman problem (TSP) is perhaps the most researched problem in the field of Computer Science and Operations. It is a known NP-hard problem and has significant practical applications in a variety of areas, such as logistics, planning, and...
ver más
|
|
|
|
|
|
|
|
|
|
|
Panagiotis Farmakis, Athanasios Chassiakos and Stylianos Karatzas
Hub-and-Spoke (H&S) network modeling is a form of transport topology optimization in which network joins are connected through intermediate hub nodes. The Short Sea Shipping (SSS) problem aims to efficiently disperse passenger flows involving multipl...
ver más
|
|
|
|
|
|
|
|
|
|
|
Felipe Martins Müller and Iaê Santos Bonilha
Hyper-heuristics comprise a set of approaches that are motivated (at least in part) by the objective of intelligently combining heuristic methods to solve hard optimization problems. Ant colony optimization (ACO) algorithms have been proven to deal with ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Shuzhen Yang, Bocai Jia, Tao Yu and Jin Yuan
In view of the difficulties of fruit cluster identification, the specific harvesting sequence constraints of aggregated fruits, and the balanced harvesting task assignment for the multiple arms with a series-increasing symmetric shared (SISS) region, thi...
ver más
|
|
|
|
|
|
|
|
|
|
|
Jalal Al-Afandi and András Horváth
Genetic Algorithms are stochastic optimization methods where solution candidates, complying to a specific problem representation, are evaluated according to a predefined fitness function. These approaches can provide solutions in various tasks even, wher...
ver más
|
|
|
|
|
|
|
|
|
|
|
Gianpaolo Ghiani, Tommaso Adamo, Pierpaolo Greco and Emanuela Guerriero
In recent years, there have been several attempts to use machine learning techniques to improve the performance of exact and approximate optimization algorithms. Along this line of research, the present paper shows how supervised and unsupervised techniq...
ver más
|
|
|
|
|
|
|
|
|
|
|
A Boonperm,A Pansuwan,W Sintunavarat
In this paper, we apply the mixed?integer programming model for solving the modified school bus routing problem under the given list of bus stops and the distances between each pair of bus stops without the number of students in each bus stop. From this ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Md. Sabir Hossain, Ahsan Sadee Tanim, Sadman Sakib Choudhury, S. M. Afif Ibne Hayat, Muhammad Nomani Kabir, Mohammad Mainul Islam
The traveling salesman problem (TSP) is a famous NP-hard problem in the area of combinatorial optimization. It is utilized to locate the shortest possible route that visits every city precisely once and comes back to the beginning point from a given set ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Abdul Majeed and Sungchang Lee
This paper presents a new coverage flight path planning algorithm that finds collision-free, minimum length and flyable paths for unmanned aerial vehicle (UAV) navigation in three-dimensional (3D) urban environments with fixed obstacles for coverage miss...
ver más
|
|
|
|
|
|
|
|
|
|
|
Erna Budhiarti Nababan, Opim Salim Sitompul, Yuni Cancer
Pág. 87 - 100
Population size of classical genetic algorithm is determined constantly. Its size remains constant over the run. For more complex problems, larger population sizes need to be avoided from early convergence to produce local optimum. Objective of this rese...
ver más
|
|
|
|
|
|