Skip to content
/ MC-VRP Public

Online supplement to "An Iterated Tabu Search for the Multi-compartment Vehicle Routing Problem"

Notifications You must be signed in to change notification settings

mrpritt/MC-VRP

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 
 
 

Repository files navigation

An Iterated Tabu Search for the Multi-compartment Vehicle Routing Problem

This respository contains the instances and supplementary data used in Silvestrin, Ritt, An Iterated Tabu Search for the Multi-compartment Vehicle Routing Problem, Comp. Oper. Res., 81, 192-202, 2017.

Abstract

We study a variant of the vehicle routing problem that allows vehicles with multiple compartments. The need for multiple compartments frequently arises in practical applications when there are several products of different quality or type, that must be kept or handled separately. The resulting problem is called the multi-compartment vehicle routing problem (MCVRP). We propose a tabu search heuristic and embed it into a iterated local search to solve the MCVRP. In several experiments we analyze the performance of the iterated tabu search and compare it to results from the literature. We find that it consistently produces solutions that are better than existing heuristic algorithms.

Supplementary material

  • Table 5: Results of the ITS with 103, 104 , 105 and 106 iterations on instances with two compartments and division strategy S1. Split demands are allowed: 10³ iterations, 10⁴ iterations, 10⁵ iterations, 10⁶ iterations.
  • Table 6: Results of the ITS with 105 iterations and two to five compartments and division strategy S1. Split demands are allowed: m=2, m=3, m=4, m=5.
  • Table 7: Comparison to the results of El Fallahi et al. (2008), Muyldermans & Pang (2010) and Derigs et al. (2010): the data is the same as in Table 5.
  • Table 8: Comparison to the results of El Fallahi et al. (2008) on instances with division strategy S2: ITS/Single, ITS/Mult.
  • Table 9: Comparison of the results of Abdulkader et al. (2015) on instances with division strategy S3 to ITS with single and multiple visits and 104 iterations.: ITS/Single, ITS/Multiple.
  • Table 10: Comparison of the results of Abdulkader et al. (2015) on instances with division strategy S4 to ITS with single and multiple visits and 104 iterations: ITS/Single, ITS/Multiple.

How to cite

@Article{Silvestrin.Ritt/2017,
  author =   {Paulo Vitor Silvestrin and Marcus Ritt},
  title =    {An Iterated Tabu Search for the Multi-compartment Vehicle Routing Problem},
  journal =  {Comp. Oper. Res.}
  year =     {2017},
  volume =   {81},
  pages =    {192--202},
  month =    may,
  doi =      {10.1016/j.cor.2016.12.023}
}

About

Online supplement to "An Iterated Tabu Search for the Multi-compartment Vehicle Routing Problem"

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published