Qinghua Wu
YOU?
Author Swipe
View article: Blockchain Adoption Dilemma Under Brands Competition
Blockchain Adoption Dilemma Under Brands Competition Open
View article: A reinforcement learning guided hybrid evolutionary algorithm for the latency location routing problem
A reinforcement learning guided hybrid evolutionary algorithm for the latency location routing problem Open
The latency location routing problem integrates the facility location problem and the multi-depot cumulative capacitated vehicle routing problem. This problem involves making simultaneous decisions about depot locations and vehicle routes …
View article: A knowledge-based iterated local search for the weighted total domination problem
A knowledge-based iterated local search for the weighted total domination problem Open
For a simple undirected weighted graph G=(V,E,w,c), the weighted total domination problem is to find a total dominating set S with the minimum weight cost. A total dominating set S is a vertex subset satisfying that for each vertex in V th…
View article: An Efficient Iterated Local Search for the Minimum Quasi-Clique Partitioning Problem
An Efficient Iterated Local Search for the Minimum Quasi-Clique Partitioning Problem Open
View article: Solving Soft and Hard-Clustered Vehicle Routing Problems: A Bi-Population Collaborative Memetic Search Approach
Solving Soft and Hard-Clustered Vehicle Routing Problems: A Bi-Population Collaborative Memetic Search Approach Open
View article: A hybrid genetic algorithm for the Hamiltonian <i>p</i>‐median problem
A hybrid genetic algorithm for the Hamiltonian <i>p</i>‐median problem Open
The Hamiltonian p ‐median problem consists of finding p ( is given) non‐intersecting Hamiltonian cycles in a complete edge‐weighted graph such that each cycle visits at least three vertices and each vertex belongs to exactly one cycle, whi…
View article: Hybrid genetic algorithm for undirected traveling salesman problems with profits
Hybrid genetic algorithm for undirected traveling salesman problems with profits Open
The orienteering problem (OP) and prize‐collecting traveling salesman problem (PCTSP) are two typical TSPs with profits, in which each vertex has a profit and the goal is to visit several vertices to optimize the collected profit and trave…
View article: Two-phase tabu search algorithm for solving Chinese high school timetabling problems under the new college entrance examination reform
Two-phase tabu search algorithm for solving Chinese high school timetabling problems under the new college entrance examination reform Open
Upon the latest reform to the college entrance examination in China (i.e., Gaokao), high schools began implementing an optional class system. Under this scheme, students’ time slots become complex, thereby increasing the difficulty in form…
View article: Dynamic thresholding search for the feedback vertex set problem
Dynamic thresholding search for the feedback vertex set problem Open
Given a directed graph G = ( V, E ), a feedback vertex set is a vertex subset C whose removal makes the graph G acyclic. The feedback vertex set problem is to find the subset C * whose cardinality is the minimum. As a general model, this p…
View article: Peer Review #1 of "Dynamic thresholding search for the feedback vertex set problem (v0.1)"
Peer Review #1 of "Dynamic thresholding search for the feedback vertex set problem (v0.1)" Open
Given a directed graph G = (V,E), a feedback vertex set is a vertex subset C whose removal makes the graph G acyclic.The feedback vertex set problem is to find the subset C* whose cardinality is the minimum.As a general model, this problem…
View article: Peer Review #2 of "Dynamic thresholding search for the feedback vertex set problem (v0.2)"
Peer Review #2 of "Dynamic thresholding search for the feedback vertex set problem (v0.2)" Open
Given a directed graph G = (V,E), a feedback vertex set is a vertex subset C whose removal makes the graph G acyclic.The feedback vertex set problem is to find the subset C* whose cardinality is the minimum.As a general model, this problem…
View article: Peer Review #2 of "Dynamic thresholding search for the feedback vertex set problem (v0.1)"
Peer Review #2 of "Dynamic thresholding search for the feedback vertex set problem (v0.1)" Open
Given a directed graph G = (V,E), a feedback vertex set is a vertex subset C whose removal makes the graph G acyclic.The feedback vertex set problem is to find the subset C* whose cardinality is the minimum.As a general model, this problem…
View article: Exact and Heuristic Solution Approaches for the Generalized Independent Set Problem
Exact and Heuristic Solution Approaches for the Generalized Independent Set Problem Open
View article: Learning-Based Multi-Start Iterated Local Search for the Profit Maximization Set Covering Problem
Learning-Based Multi-Start Iterated Local Search for the Profit Maximization Set Covering Problem Open
View article: Solving the clustered traveling salesman problem <i>via</i> traveling salesman problem methods
Solving the clustered traveling salesman problem <i>via</i> traveling salesman problem methods Open
The Clustered Traveling Salesman Problem (CTSP) is a variant of the popular Traveling Salesman Problem (TSP) arising from a number of real-life applications. In this work, we explore a transformation approach that solves the CTSP by conver…
View article: Peer Review #2 of "Solving the clustered traveling salesman problem via traveling salesman problem methods (v0.2)"
Peer Review #2 of "Solving the clustered traveling salesman problem via traveling salesman problem methods (v0.2)" Open
The Clustered Traveling Salesman Problem (CTSP) is a variant of the popular Traveling Salesman Problem (TSP) arising from a number of real-life applications.In this work, we explore a transformation approach that solves the CTSP by convert…
View article: Peer Review #2 of "Solving the clustered traveling salesman problem via traveling salesman problem methods (v0.1)"
Peer Review #2 of "Solving the clustered traveling salesman problem via traveling salesman problem methods (v0.1)" Open
The Clustered Traveling Salesman Problem (CTSP) is a variant of the popular Traveling Salesman Problem (TSP) arising from a number of real-life applications.In this work, we explore a transformation approach that solves the CTSP by convert…
View article: Breakout Local Search for the Traveling Salesman Problem with Job-Times
Breakout Local Search for the Traveling Salesman Problem with Job-Times Open
View article: Adaptive Feasible and Infeasible Evolutionary Search for the Knapsack Problem with Forfeits
Adaptive Feasible and Infeasible Evolutionary Search for the Knapsack Problem with Forfeits Open
View article: Grouping memetic search for the colored traveling salesmen problem
Grouping memetic search for the colored traveling salesmen problem Open
View article: A hybrid evolutionary search for the generalized quadratic multiple knapsack problem
A hybrid evolutionary search for the generalized quadratic multiple knapsack problem Open
View article: Supplementary materials: "Improved NEH based heuristic for the blocking flow shop problem with bicriteria of the makespan and machine utilisation"
Supplementary materials: "Improved NEH based heuristic for the blocking flow shop problem with bicriteria of the makespan and machine utilisation" Open
The content of this document is supplementary materials of "Improved NEH based heuristic for the blocking flow shop problem with bicriteria of the makespan and machine utilisation". The document presents detailed data of comparative experi…
View article: Supplementary materials: "Improved NEH based heuristic for the blocking flow shop problem with bicriteria of the makespan and machine utilisation".xlsx
Supplementary materials: "Improved NEH based heuristic for the blocking flow shop problem with bicriteria of the makespan and machine utilisation".xlsx Open
The content of this document is supplementary materials of "Improved NEH based heuristic for the blocking flow shop problem with bicriteria of the makespan and machine utilisation". The document presents detailed data of comparative experi…
View article: Supplementary materials: "Improved NEH based heuristic for the blocking flow shop problem with bicriteria of the makespan and machine utilisation"
Supplementary materials: "Improved NEH based heuristic for the blocking flow shop problem with bicriteria of the makespan and machine utilisation" Open
The content of this document is supplementary materials of "Improved NEH based heuristic for the blocking flow shop problem with bicriteria of the makespan and machine utilisation". The document presents detailed data of comparative experi…
View article: Supplementary materials: "Improved NEH based heuristic for the blocking flow shop problem with bicriteria of the makespan and machine utilisation"
Supplementary materials: "Improved NEH based heuristic for the blocking flow shop problem with bicriteria of the makespan and machine utilisation" Open
The content of this document is supplementary materials of "Improved NEH based heuristic for the blocking flow shop problem with bicriteria of the makespan and machine utilisation". The document presents detailed data of comparative experi…
View article: Supplementary materials: "Improved NEH based heuristic for the blocking flow shop problem with bicriteria of the makespan and machine utilisation"
Supplementary materials: "Improved NEH based heuristic for the blocking flow shop problem with bicriteria of the makespan and machine utilisation" Open
The content of this document is supplementary materials of "Improved NEH based heuristic for the blocking flow shop problem with bicriteria of the makespan and machine utilisation". The document presents detailed data of comparative experi…
View article: Solving the Clustered Traveling Salesman Problem via TSP methods
Solving the Clustered Traveling Salesman Problem via TSP methods Open
The Clustered Traveling Salesman Problem (CTSP) is a variant of the popular Traveling Salesman Problem (TSP) arising from a number of real-life applications. In this work, we explore a transformation approach that solves the CTSP by conver…
View article: Production and joint emission reduction decisions based on two-way cost-sharing contract under cap-and-trade regulation
Production and joint emission reduction decisions based on two-way cost-sharing contract under cap-and-trade regulation Open
View article: A hybrid evolutionary algorithm for finding low conductance of large graphs
A hybrid evolutionary algorithm for finding low conductance of large graphs Open
View article: Effect of the manufacturer quality inspection policy on the supply chain decision-making and profits
Effect of the manufacturer quality inspection policy on the supply chain decision-making and profits Open
Due to competitive pressure and information asymmetry, manufacturers will produce quality inspection avoidance behaviour to gain short-term economic benefits, but this behaviour affects the ultimate quality and safety of the product.This p…