no code implementations • 20 May 2024 • Fei Liu, Xi Lin, Weiduo Liao, Zhenkun Wang, Qingfu Zhang, Xialiang Tong, Mingxuan Yuan
To be concrete, we propose a novel prompt learning method to facilitate fast zero-shot adaptation of a pre-trained model to solve routing problem instances from different distributions.
no code implementations • 12 Apr 2024 • Rongguang Ye, Lei Chen, Weiduo Liao, Jinyuan Zhang, Hisao Ishibuchi
In this manner, the proposed method can sample preference vectors from the location of the Pareto front with a high probability.
no code implementations • 4 Mar 2022 • Ke Shang, WeiYu Chen, Weiduo Liao, Hisao Ishibuchi
In this letter, we propose HV-Net, a new method for hypervolume approximation in evolutionary multi-objective optimization.
no code implementations • 20 Apr 2021 • Ke Shang, Hisao Ishibuchi, WeiYu Chen, Yang Nan, Weiduo Liao
Then, we show that a uniform solution set on the plane-based Pareto front is not always optimal for hypervolume maximization.
