Comparison heuristics method for solving two echelon vehicle routing problem

Abstract

Today, almost everyone has done online shopping activities. The presence of e-commerce makes it easier for humans to do shopping. E-commerce companies compete to provide the best service to the community. One of them is in the delivery within the city. In terms of city delivery, the 2E-VRP model has been discussed a lot lately in terms of consolidating shipments. This study aims to present the 2E-VRP mathematical model and work in two stages to find a solution. In this article, the author also compares solutions with several heuristic models including 2-opt, repetitive nearest neighbor, nearest neighbor, farthest insertion, cheapest insertion, arbitrary insertion, and nearest insertion. From the results of research conducted by the 2-opt method, farthest insertion, cheapest insertion, and nearest insertion, the total distance is the best, all three get the same distance, then followed by the nearest insertion, arbitrary insertion, and nearest insertion methods.