|
|
|
|
|
Nikola Ivkovic, Robert Kudelic and Marin Golub
Ant colony optimization (ACO) is a well-known class of swarm intelligence algorithms suitable for solving many NP-hard problems. An important component of such algorithms is a record of pheromone trails that reflect colonies? experiences with previously ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Bahram Alidaee, Haibo Wang and Lutfu S. Sua
Quadratic unconstrained binary optimization (QUBO) is a classic NP-hard problem with an enormous number of applications. Local search strategy (LSS) is one of the most fundamental algorithmic concepts and has been successfully applied to a wide range of ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Yizheng Zhang, Liuhong Luo and Hongjun Li
Extracting k" role="presentation">??k
k
-order maximal-sum principal submatrix from an n" role="presentation">??n
n
-order real matrix is a typical combinatorial optimization problem and an NP-hard problem. To improve the computational efficiency of solv...
ver más
|
|
|
|
|
|
|
|
|
|
|
Daniela Ambrosino, Carmine Cerrone and Anna Sciomachen
This paper presents a new heuristic algorithm tailored to solve large instances of an NP-hard variant of the shortest path problem, denoted the cost-balanced path problem, recently proposed in the literature. The problem consists in finding the origin?de...
ver más
|
|
|
|
|
|
|
|
|
|
|
Haojian Liang, Shaohua Wang, Huilai Li, Huichun Ye and Yang Zhong
The spatial optimization method between combinatorial optimization problems and GIS has many geographical applications. The p-center problem is a classic NP-hard location modeling problem, which has essential applications in many real-world scenarios, su...
ver más
|
|
|
|
|
|
|
|
|
|
|
Dhidhi Pambudi and Masaki Kawamura
The quadratic unconstrained binary optimization (QUBO) problem is categorized as an NP-hard combinatorial optimization problem. The variable neighborhood search (VNS) algorithm is one of the leading algorithms used to solve QUBO problems. As neighborhood...
ver más
|
|
|
|
|
|
|
|
|
|
|
Geng Chen, Xinzheng Mu, Fei Shen and Qingtian Zeng
With the explosive growth of network traffic and the diversification of service demands, network slicing (NS) and dual connectivity (DC) are considered as promising technologies in wireless networks. In this paper, we propose a novel algorithm that solve...
ver más
|
|
|
|
|
|
|
|
|
|
|
Edwar Lujan, Edmundo Vergara, Jose Rodriguez-Melquiades, Miguel Jiménez-Carrión, Carlos Sabino-Escobar and Flabio Gutierrez
This work introduces a fuzzy optimization model, which solves in an integrated way the berth allocation problem (BAP) and the quay crane allocation problem (QCAP). The problem is solved for multiple quays, considering vessels? imprecise arrival times. Th...
ver más
|
|
|
|
|
|
|
|
|
|
|
Ali Ahmid, Thien-My Dao and Ngan Van Le
Solving of combinatorial optimization problems is a common practice in real-life engineering applications. Trusses, cranes, and composite laminated structures are some good examples that fall under this category of optimization problems. Those examples h...
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
|
|
|
|
|
|