Development of Multi-Depot vehicle routing problem in returned products from customer and solving with Bat Algorithm

Articles in Press

Document Type : Original Article

Authors

1 Industrial Engineering, Payamnoor University, Tehran, Iran

2 Industrial Engineering, Payamnoor University, Asaloieh, Iran

Abstract

One of the most important issues in recent decades then are widely used to increase performance and efficiency of the transport system have been proposed to solve is the vehicle routing problem (VRP). The Multi-Depot Vehicle Routing Problem (MDVRP) is a variant of the classical VRP in which more than one depot is considered. In this study, we intend with present a MDVRP model at returned products. In the model addition to reducing transportation costs, variable costs are also minimized. Since the obtained model is NP-HARD, so we used a bat algorithm to solve it. The quality of obtained solutions is surveyed with different sized instances.One of the most important issues in recent decades then are widely used to increase performance and efficiency of the transport system have been proposed to solve is the vehicle routing problem (VRP). The Multi-Depot Vehicle Routing Problem (MDVRP) is a variant of the classical VRP in which more than one depot is considered. In this study, we intend with present a MDVRP model at returned products. In the model addition to reducing transportation costs, variable costs are also minimized. Since the obtained model is NP-HARD, so we used a bat algorithm to solve it. The quality of obtained solutions is surveyed with different sized instances.

Keywords

Files

Share

How to cite

Statistics