Memetic search for the minmax multiple traveling salesman problem with single and multiple depots
The minmax multiple traveling salesman problem with single depot (the minmax mTSP) or
multiple depots (the minmax multidepot mTSP) aims to minimize the longest tour among a …
multiple depots (the minmax multidepot mTSP) aims to minimize the longest tour among a …
A fast tri-individual memetic search approach for the distance-based critical node problem
The distance-based critical node problem involves identifying a subset of nodes in a graph
such that the removal of these nodes leads to a residual graph with the minimum distance …
such that the removal of these nodes leads to a residual graph with the minimum distance …
An effective memetic algorithm for the close-enough traveling salesman problem
Z Lei, JK Hao - Applied Soft Computing, 2024 - Elsevier
Abstract The Close-Enough Traveling Salesman Problem (CETSP) is a variant of the well-
known Traveling Salesman Problem (TSP). Unlike the TSP, each target in the CETSP has a …
known Traveling Salesman Problem (TSP). Unlike the TSP, each target in the CETSP has a …
An adaptive memetic algorithm for the bidirectional loop layout problem
W Sun, JK Hao, W Li, Q Wu - Knowledge-Based Systems, 2022 - Elsevier
Given a set of facilities, a set of positions arranged in a loop configuration and a flow cost
matrix, the bidirectional loop layout problem (BLLP) is to find a facility-to-position assignment …
matrix, the bidirectional loop layout problem (BLLP) is to find a facility-to-position assignment …
Seat allocation optimization for railways considering social distancing during the post-pandemic period
G Xu, X Liu, L Zhong, K Ren, C Lu, L Deng - Journal of Transport & Health, 2023 - Elsevier
Introduction Ensuring social distance is crucial for protecting public health and reducing the
risk of COVID-19 transmission, particularly in enclosed spaces like public transport …
risk of COVID-19 transmission, particularly in enclosed spaces like public transport …
A hybrid genetic algorithm for the Hamiltonian p‐median problem
The Hamiltonian p‐median problem consists of finding p (pp is given) non‐intersecting
Hamiltonian cycles in a complete edge‐weighted graph such that each cycle visits at least …
Hamiltonian cycles in a complete edge‐weighted graph such that each cycle visits at least …
A reinforcement learning guided hybrid evolutionary algorithm for the latency location routing problem
Y Zou, JK Hao, Q Wu - arXiv preprint arXiv:2403.14405, 2024 - arxiv.org
The latency location routing problem integrates the facility location problem and the multi-
depot cumulative capacitated vehicle routing problem. This problem involves making …
depot cumulative capacitated vehicle routing problem. This problem involves making …
Memetic algorithms
JK Hao, X Lai - Discrete Diversity and Dispersion Maximization: A …, 2023 - Springer
This chapter is dedicated to memetic algorithms for diversity and dispersion problems. It is
organized in two parts. The first part discusses the general design issues of memetic …
organized in two parts. The first part discusses the general design issues of memetic …