Get started
Author

Phạm Đình Thành

Observed names: Pham Dinh Thanh, Thanh Pham Dinh
Institution: Tay Bac University
ORCID: 0000-0002-2550-9546
Observed ORCID: 0000-0002-2550-9546
OpenAlex ID: A5037098654
New approach to solving the clustered shortest-path tree problem based on reducing the search space of evolutionary algorithm
2019 · Huynh Thi Thanh Binh, Pham Dinh Thanh, et al. · Knowledge-Based Systems · 43
PDF
Application of the Bees Algorithm to PCB assembly optimisation
2007 · Phạm Đình Thành, Sameh Otri, et al. · 38
Evolutionary algorithm and multifactorial evolutionary algorithm on clustered shortest-path tree problem
2020 · Phan Thi Hong Hanh, Pham Dinh Thanh, et al. · Information Sciences · 36
PDF
An efficient strategy for using multifactorial optimization to solve the clustered shortest path tree problem
2020 · Pham Dinh Thanh, Huynh Thi Thanh Binh, et al. · Applied Intelligence · 34
Effective Multifactorial Evolutionary Algorithm for Solving the Cluster Shortest Path Tree Problem
2018 · Huynh Thi Thanh Binh, Pham Dinh Thanh, et al. · IEEE Congress on Evolutionary Computation (CEC) · 30
An Effective Representation Scheme in Multifactorial Evolutionary Algorithm for Solving Cluster Shortest-Path Tree Problem
2018 · Pham Dinh Thanh, Dinh Anh Dung, et al. · IEEE Congress on Evolutionary Computation (CEC) · 29
Multifactorial evolutionary algorithm for solving clustered tree problems: competition among Cayley codes
2020 · Thanh Pham Dinh, Binh Huynh Thi Thanh, et al. · Memetic Computing · 25
Multifactorial Evolutionary Algorithm for Inter-Domain Path Computation under Domain Uniqueness Constraint
2020 · Huynh Thi Thanh Binh, Ta Bao Thangy, et al. · IEEE Congress on Evolutionary Computation (CEC) · 23
A bi-level encoding scheme for the clustered shortest-path tree problem in multifactorial optimization
2021 · Huynh Thi Thanh Binh, Ta Bao Thang, et al. · Engineering Applications of Artificial Intelligence · 16
A survey on hybridizing genetic algorithm with dynamic programming for solving the traveling salesman problem
2013 · Pham Dinh Thanh, Huynh Thi Thanh Binh, et al. · International Conference of Soft Computing and Pattern Recognition (SoCPaR) · 16
A Particle Swarm Optimization and Variable Neighborhood Search Based Multipopulation Algorithm for Inter-Domain Path Computation Problem
2022 · Do Tuan Anh, Huynh Thi Thanh Binh, et al. · Applied Soft Computing · 10
Two levels approach based on multifactorial optimization to solve the clustered shortest path tree problem
2020 · Binh Huynh Thi Thanh, Thanh Pham Dinh · Evolutionary Intelligence · 10
Optimization of the Weights of Multi-layered Perceptions Using the Bees Algorithm
2006 · Phạm Đình Thành, Ebubekir Koç, et al. · 4
New migration operator in Biogeography-based optimization for solving traveling salesman problem
2016 · Huynh Thi Thanh Binh, Pham Dinh Thanh · IEEE Region 10 Conference (TENCON) · 2
An Improved Initialization-Based Evolutionary Algorithm for the Top-k 2-Clubs Problem
2026 · Pham Dinh Thanh · Communications in computer and information science
MultiFatorial evolutionary algorithm with nodedepth encoding for inter-domain path computation under node-defined domain uniqueness constraint
2025 · Do Tuan Anh, Ha-Bang Ban, et al. · Knowledge-Based Systems
A Hybrid Multifactorial Evolutionary Algorithm for the Minimum s-Club Cover Problem
2025 · Pham Dinh Thanh, Do Tuan Anh · Communications in computer and information science
Evolutionary multitasking algorithm based on a dynamic solution encoding strategy for the minimum s-club cover problem
2024 · Pham Dinh Thanh, Nguyen Binh Long, et al. · Evolutionary Intelligence
A Multi-start Variable Neighbourhood Search with a New Solution Construction Method for Solving Inter-Domain Path Computation Problem
2024 · Pham Dinh Thanh · Arabian Journal for Science and Engineering
Thuật Toán Gần Đúng Dựa Trên Phương Thức Khởi Tạo Lời Giải Nhiều Lần Giải Bài Toán Minimum S-club Cover
2023 · Phạm Đình Thành · TNU Journal of Science and Technology
Thuật Toán Kết Hợp Giữa Thuật Toán Tiến Hóa Và Thuật Toán Metaheuristic Cho Tìm Kiếm Ưu Tiên Ngẫu Nhiên Giải Bài Toán Tìm Đường Đi Liên Miền Với Ràng Buộc Miền Duy Nhất Trên Nút Mạng
2022 · Phạm Đình Thành · Nghiên cứu cơ bản và ứng dụng Công nghệ thông tin (FAIR)
Thuật Toán Tiến Hóa Đa Nhân Tố Thích Nghi Giải Bài Toán Tìm Đường Đi Liên Miền Với Ràng Buộc Miền Duy Nhất Trên Nút Mạng
2022 · Phạm Đình Thành · TNU Journal of Science and Technology
PDF
巡回セールスマン問題のための生物地理学ベース最適化における移動演算子の改善【Powered by NICT】
2016 · Pham Dinh Thanh, Huỳnh Thị Thanh Bình, et al. · IEEE Conference Proceedings
Works count: 23
Citation count: 316
H-index: 10
I10-index: 12
Year
Topic
Type