Forward and reverse logistics vehicle routing problems with time horizons in B2C e-commerce logistics

This research addresses a vehicle routing problem with simultaneous pickup and delivery with time windows from multiple depots (MVRPSPDTW) over a time horizon in the B2C e-commerce logistics system. We consider an e-commerce logistics system with a multi-period, which consists of customers, logistics service providers (LSPs), suppliers, and a decision-making platform. A mixed-integer non-linear programming (MINLP) model is developed and tested on small- and large-scale instances. To handle more realistic large-scale problems, we have used two approaches (i) exact optimisation approach using (i.e. CPLEX tool) and metaheuristic algorithms (i.e. Differential Evolutionary Algorithm (DE), Parallel Differential Evolutionary Algorithm (Par-DE), Genetic Algorithm (GA), and Block-based Genetic Algorithm (BBGA)) to minimise the total transportation cost and penalty due to the delay by logistics service providers. The computation experiment is conducted on the real practical scenario data and the comparative result is demonstrated.