Performance analysis of large neighborhood search algorithm applied on vehicle routing problem with pickup and delivery
The Pickup and Drop Problem with Time Window constraint or PDPTW is a hard combinatorial optimization problem. In this problem, requests are generated for goods or load to be carried from their respective pickup point to a designated delivery location. A certain number of vehicles are assigned...
Saved in:
Main Author: | Halder, Shruti |
---|---|
Other Authors: | Justin Dauwels |
Format: | Theses and Dissertations |
Language: | English |
Published: |
2019
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/78919 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Efficient neural neighborhood search for pickup and delivery problems
by: MA, Yining, et al.
Published: (2022) -
The vehicle routing problem with simultaneous pickup and delivery and occasional drivers
by: YU, Vincent F., et al.
Published: (2023) -
Vehicle routing problem with reverse cross-docking: An adaptive large neighborhood search algorithm
by: GUNAWAN, Aldy, et al.
Published: (2020) -
Performance optimization of vehicle routing with simultaneous pickup and delivery in logistics operations
by: Gopinath, Maasi.
Published: (2008) -
Adaptive large neighborhood search for vehicle routing problem with cross-docking
by: GUNAWAN, Aldy, et al.
Published: (2020)