### Abstract

Physical distribution plays an imporant role in contemporary logistics management. Both satisfaction level of of customer and competitiveness of company can be enhanced if the distribution problem is solved optimally. The multi-depot vehicle routing problem (MDVRP) belongs to a practical logistics distribution problem, which consists of three critical issues: customer assignment, customer routing, and vehicle sequencing. According to the literatures, the solution approaches for the MDVRP are not satisfactory because some unrealistic assumptions were made on the first sub-problem of the MDVRP, ot the customer assignment problem. To refine the approaches, the focus of this paper is confined to this problem only. This paper formulates the customer assignment problem as a minimax-type integer linear programming model with the objective of minimizing the cycle time of the depots where setup times are explicitly considered. Since the model is proven to be MP-complete, a genetic algorithm is developed for solving the problem. The efficiency and effectiveness of the genetic algorithm are illustrated by a numerical example.

Original language | English |
---|---|

Pages (from-to) | 71-82 |

Number of pages | 12 |

Journal | Industrial Engineering Research |

Volume | 4 |

Issue number | 2 |

Publication status | Published - Sep 2007 |

### Keywords

- logistics management
- physical distribution problem
- mathematical modelling
- genetic algorithm

## Fingerprint Dive into the research topics of 'Optimization of physical distribution problem in logistics management'. Together they form a unique fingerprint.

## Cite this

Ho, W., Ji, P., & Albores, P. (2007). Optimization of physical distribution problem in logistics management.

*Industrial Engineering Research*,*4*(2), 71-82.