In order to efficiently solve the binary optimization problems by using differential evolution
(DE), a class of new transfer functions, Taper-shaped transfer function, is firstly proposed by …

The artificial bee colony (ABC) algorithm is a new branch of evolutionary algorithms (EAs)
that is inspired by the collective foraging behavior of real honey bee colonies. Due to its …

This paper studies the location selection strategy of emergency rescue facilities in the
multimodal transport network to improve the resilience of the network. Based on the overall …

In recent years, the researchers have witnessed the changes or transformations driven by
the existence of the big data on the definitions, complexities and future directions of the real …

This paper addresses a newly introduced variant of traveling salesman problem, viz. k-
Interconnected Multi-Depot Multi-Traveling Salesman Problem (k-IMDMTSP). This problem …

Abstract The Maximal Covering Location Problem (MCLP) is concerned with the optimal
placement of a fixed number of facilities to cover the maximum number of customers. This …

This paper investigates the multi-objective problem of deploying wireless sensor networks
with cooperative distance-based sensing coverage. This problem considers deploying a …

This paper addresses the recently introduced colored traveling salesman problem (CTSP),
which is a variant of the multiple traveling salesman problem (MTSP). In the MTSP, given a …

A tree t-spanner is a spanning tree T in which the ratio of distance between every pair of
vertices is at most t times their shortest distance in a connected graph, where t is a value …

Cover scheduling problem in wireless sensor networks (WSN-CSP) aims to find a schedule
of covers which minimizes the longest continuous duration of time for which no sensor in the …