Particle Swarm Optimization Approach For Vehicle Routing Problem

Abstract

Multi-depot multi-trip Capacitated Vehicle Routing Problem with Time Window (Multi D&T CVRPTW is the reality problem occurs when the e-commerce trade with last-mie delivery is becoming more and more popular. The purpose of this paper is to propose a metaheuristics approach by Particle Swarm Optimization for such problem to contribute to the transportation arrangement of forwarders and distributors, especially of e-commerce companies. Mix integer programming is applied to modeling the problem in order to benchmarking the metaheuristics approach. The result obtains from this study includes the fitness of traveling time and optimal delivery route for each vehicle. In this work, the proposed model is applied for two warehouses in Ho Chi Minh City of Vietnam Trade Alliance Company.