Abstract
In this paper, a multi-depot vehicle routing problem with weight-relatedcost (MDVRPWRC) is discussed. It is an extension of the classical multi-depotvehicle routing problem (MDVRP) by treating the vehicle load, i.e. the totalweight of freight in a vehicle, as a variable in the objective of model. Thecorresponding costs incurred by the vehicle load are considered in the objectivefunction when determining vehicle routes in order to minimize the total costs.A scatter search framework is proposed to solve the MDVRPWRC. The heuristicmethod of arc selection and combination is used to generate new solutions.Several local search methods are integrated to construct an iterative descendingalgorithm for improving the solutions. Computational experiments were carriedout on typical MDVRP benchmark problems. The results show that MDVRPWRC canformulate the vehicle routing problem more explicitly and reduce the total costscompared with the general MDVRP model. ©2009 IEEE.
| Original language | English |
|---|---|
| Title of host publication | 2009 International Conference on Computers and Industrial Engineering, CIE 2009 |
| Pages | 1028-1033 |
| Publication status | Published - 2009 |
| Event | 2009 International Conference on Computers and Industrial Engineering (CIE 2009) - University of Technology of Troyes, Troyes, France Duration: 6 Jul 2009 → 8 Jul 2009 |
Conference
| Conference | 2009 International Conference on Computers and Industrial Engineering (CIE 2009) |
|---|---|
| Place | France |
| City | Troyes |
| Period | 6/07/09 → 8/07/09 |
Research Keywords
- Multi-depot vehicle routing problem
- Scatter search
- Weight-related cost