6 Papers
Chang Lv is an academic researcher from Huazhong University of Science and Technology. The author has contributed to research in topics: Computer science & Variable neighborhood search. The author has an hindex of 2, co-authored 4 publications.
Chat about Author
Papers
Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problem
TL;DR: The results show that the sequence-based MILP model is the most efficient one, and the proposed CP model is effective in finding good quality solutions for the both the small-sized and large-sized instances.
214
A hybrid algorithm for the static bike-sharing re-positioning problem based on an effective clustering strategy
TL;DR: An effective clustering strategy is proposed to put bike-sharing stations into self-sufficient groups, which is shown to be able to greatly decompose the problem complexity for large-scale instances, and an adaptive variable neighborhood search algorithm is developed to improve the clusters.
43
Constraint programing for solving four complex flexible shop scheduling problems
Leilei Meng,Chao Lu,Biao Zhang,Yaping Ren,Chang Lv,Hongyan Sang,Junqing Li,Chaoyong Zhang +7 more
- 01 Jun 2021
TL;DR: Experimental results show that the proposed CP models outperform existing algorithms; in particular, several best‐known solutions of benchmark instances are improved by the CP method.
12
A feature correlation reinforce clustering and evolutionary algorithm for the green bike-sharing reposition problem
Chang Lv,Qiong Liu,Chaoyong Zhang,Yaping Ren,Hao Zhou +4 more
- 01 Mar 2024
TL;DR: This paper proposes a feature correlation reinforce clustering strategy and a multi-objective evolutionary algorithm to minimize carbon emission and improve reposition quality in bike-sharing systems, demonstrating competitiveness and providing strategies for BSS managers.
A fuzzy correlation based heuristic for Dual-mode integrated Location routing problem
TL;DR: In this paper , a fuzzy correlation arc based adaptive neighborhood search (FCA-AVNS) algorithm is designed for path planning in a two-echelon structure where products are transported from the plant to the distribution centers (DCs) in the first echelon, and from the DCs to retailers and customers in the second echelan.