Learning Heuristics With Different Representations for Stochastic Routing-Reference-Cited by-同舟云学术

Learning Heuristics With Different Representations for Stochastic Routing

Published:2023-05 Issue:5 Volume:53 Page:3205-3219
ISSN:2168-2267
Container-title:IEEE Transactions on Cybernetics
language:
Short-container-title:IEEE Trans. Cybern.

Author:

Jia Ya-Hui¹^ORCID,Mei Yi²^ORCID,Zhang Mengjie²^ORCID

Affiliation:

1. School of Future Technology, South China University of Technology, Guangzhou, China

2. School of Engineering and Computer Science, Victoria University of Wellington, Wellington, New Zealand

Funder

Marsden Fund of New Zealand Government

Science for Technological Innovation Challenge (SfTI) Fund

MBIE SSIF Fund

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Subject

Electrical and Electronic Engineering,Computer Science Applications,Human-Computer Interaction,Information Systems,Control and Systems Engineering,Software

Link

http://xplorestaging.ieee.org/ielx7/6221036/10106628/09771076.pdf?arnumber=9771076

Reference71 articles.

1. Representations for Genetic and Evolutionary Algorithms

2. Automatic design of scheduling policies for dynamic flexible job shop scheduling via surrogate-assisted cooperative co-evolution genetic programming

3. Decision support for vehicle dispatching using genetic programming

4. Dynamic Scheduling with Genetic Programming

5. On the Locality of Representations

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Multi-timescale dispatch technology for islanded energy system in the Gobi Desert;Renewable Energy;2024-11

2. Genetic Programming and Reinforcement Learning on Learning Heuristics for Dynamic Scheduling: A Preliminary Comparison;IEEE Computational Intelligence Magazine;2024-05

3. Towards Scalable Dynamic Traffic Assignment With Streaming Agents: A Decentralized Control Approach Using Genetic Programming;IEEE Transactions on Emerging Topics in Computational Intelligence;2024-02

4. Evolutionary Algorithms for Bin Packing Problem with Maximum Lateness and Waste Minimization;Lecture Notes in Computer Science;2024

5. Evolving ensembles of heuristics for the travelling salesman problem;Natural Computing;2023-10-25