A Fast Randomized Algorithm for the Heterogeneous Vehicle Routing Problem with Simultaneous Pickup and Delivery
In the vehicle routing problem with simultaneous pickup and delivery (VRPSPD), customers demanding both delivery and pickup operations have to be visited once by a single vehicle. In this work, we propose a fast randomized algorithm using a nearest neighbor strategy to tackle an extension of the VRP...
Main Authors: | Napoleão Nepomuceno, Ricardo Barboza Saboia, Plácido Rogério Pinheiro |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2019-08-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | https://www.mdpi.com/1999-4893/12/8/158 |
Similar Items
-
The Vehicle Routing Problem with Simultaneous Pickup and Delivery Considering the Total Number of Collected Goods
by: Qinge Guo, et al.
Published: (2023-01-01) -
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) -
An Improved Genetic Algorithm for the Granularity-Based Split Vehicle Routing Problem with Simultaneous Delivery and Pickup
by: Yuxin Liu, et al.
Published: (2023-07-01) -
A two-stage uncertain model to arrange and locate vehicle routing with simultaneous pickup and delivery
by: Mohammad Khodashenas, et al.
Published: (2022-09-01) -
Optimizing the Implementation of the Greedy Algorithm to Achieve Efficiency in Garbage Transportation Routes
by: Hanif Hidayatulloh, et al.
Published: (2023-10-01)