Efficient neural neighborhood search for pickup and delivery problems
We present an efficient Neural Neighborhood Search (N2S) approach for pickup and delivery problems (PDPs). In specific, we design a powerful Synthesis Attention that allows the vanilla self-attention to synthesize various types of features regarding a route solution. We also exploit two customized d...
Saved in:
Main Authors: | MA, Yining, LI, Jingwen, CAO, Zhiguang, SONG, Wen, GUO, Hongliang, GONG, Yuejiao, CHEE, Meng Chee |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2022
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/8137 https://ink.library.smu.edu.sg/context/sis_research/article/9140/viewcontent/pdp_n2s_update.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Efficient neural collaborative search for pickup and delivery problems
by: KONG, Detian, et al.
Published: (2024) -
Learning to search feasible and infeasible regions of routing problems with flexible neural k-opt
by: MA, Yining, et al.
Published: (2023) -
Performance analysis of large neighborhood search algorithm applied on vehicle routing problem with pickup and delivery
by: Halder, Shruti
Published: (2019) -
Heterogeneous attentions for solving pickup and delivery problem via deep reinforcement learning
by: LI, Jingwen, et al.
Published: (2022) -
Learning large neighborhood search policy for integer programming
by: WU, Yaoxin, et al.
Published: (2021)