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...
Main Author: | Halder, Shruti |
---|---|
Other Authors: | Justin Dauwels |
Format: | Thesis |
Language: | English |
Published: |
2019
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/78919 |
Similar Items
-
Variable Neighborhood Search Algorithms to Solve the Electric Vehicle Routing Problem with Simultaneous Pickup and Delivery
by: Yusuf Yilmaz, et al.
Published: (2022-08-01) -
Electric Vehicle Routing Problem with Simultaneous Pickup and Delivery: Mathematical Modeling and Adaptive Large Neighborhood Search Heuristic Method
by: Wei Xu, et al.
Published: (2022-12-01) -
Performance optimization of vehicle routing with simultaneous pickup and delivery in logistics operations
by: Gopinath, Maasi.
Published: (2008) -
The Vehicle Routing Problem with Simultaneous Pickup and Delivery and Parcel Lockers
by: Vincent F. Yu, et al.
Published: (2022-03-01) -
Tabu Search for the Vehicle Routing Problem with Multiple Trips, Time Windows, and Simultaneous Delivery-Pickup
by: Suprayogi Suprayogi, et al.
Published: (2017-12-01)