# Research on joint vehicle routing optimization considering multiple distribution centers

## TL;DR

This paper develops a model and algorithm to optimize delivery routes from multiple distribution centers to city demand points, aiming to reduce transportation time.

## Contribution

A novel integer programming model and column generation algorithm are proposed for multi-center vehicle routing optimization.

## Key findings

- An integer programming model was constructed to minimize total transportation time.
- A column generation algorithm was developed and verified through CPLEX analysis.
- The model's practicality was demonstrated using real-world data examples.

## Abstract

In order to address the problem of efficiently distributing to multiple demand points within the city and multiple distribution centers on the urban fringes, this paper considers decision-making issues such as the selection of distribution centers and the planning of delivery routes. With the objective of minimizing the total transportation time, an integer programming model for the urban vehicle delivery network is constructed. Moreover, a class of column generation algorithms is designed for the characteristics of the problem. CPLEX is used to compare and analyze the solutions of several examples. The results verify the feasibility of the proposed column generation algorithm, and the practicality of the planning model is demonstrated through the analysis of examples generated from actual data.