Pickup and delivery problem in the collaborative city courier service by using genetic algorithm and nearest distance

Purba Daru Kusuma, Meta Kallista

Abstract


One problem in collaborative pickup delivery problem (PDP) was excessive outsourced jobs. It happened in many studies on the collaborative PDP. Besides, the revenue sharing in it was unclear although important. This work aimed to propose a novel collaborative PDP model which minimizes total travel distance while maintains low outsourced jobs. It proposed several contributions. First, it prioritized internal jobs first rather than full collaborative model. Second, it proposed new revenue sharing model. It adopted cluster-first route-second and mixed pickup and delivery. It was developed by combining the genetic algorithm and nearest distance algorithm where the genetic algorithm was used in the clustering process and the nearest distance was used in the routing process. The simulation result shows that the proposed model was better than the comparing models: (1) combined K-means and genetic algorithm model (KMGA) and (2) combined simulated annealing and last-in first-out (SNLIFO) model. When the number of orders was high (300 units), the total travel distance of the proposed model was 37 percent lower than the KMGA model and 30 percent lower than the SNLIFO model. In average, the outsourcing rate of the proposed model was 70 percent lower than the previous models.

Keywords


Courier service; COVID-19; E-commerce; Genetic algorithm; Nearest distance; Vehicle routing problem

Full Text:

PDF


DOI: https://doi.org/10.11591/eei.v11i2.3223

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Bulletin of EEI Stats