Skip to main content
Log in

Application of Multiagent Technologies to Multiple Depot Vehicle Routing Problem with Time Windows

  • Large Scale Systems Control
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

In this paper, a multiagent approach to the Multiple Depot Vehicle Routing Problem with Time Windows (MDVRPTW) is presented. A multiagent system of interacting trucks, depots and orders is considered. For limiting the intensity of negotiations, a Delaunay triangulation-based scene structure is proposed. As demonstrated below, the solutions obtained by the new algorithm vary by 10–30% from the well-known best counterparts; however, the speed of calculations is considerably higher, and hence the new algorithm can be applied in real-time systems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Skvortsov, A.V., Triangulyatsiya Delone i ee primeneniya (Delaunay Triangulation and Its Applications), Tomsk: Tomsk. Univ., 2002.

    Google Scholar 

  2. Applegate, D.L., Bixby, R.M., Chvátal, V., and Cook, W.J., The Traveling Salesman Problem, Princeton: Princeton Univ. Press, 2007.

    MATH  Google Scholar 

  3. Bodin, L., Golden, B., Assad, A., and Ball, M., Routing and Scheduling of Vehicle and Crews: The State of the Art, Comput. Operat. Res., 1983, vol. 10, pp. 63–211.

    Article  MathSciNet  Google Scholar 

  4. Bräysy, O. and Gendreau, M., Tabu Search Heuristics for the Vehicle Routing Problem with Time Windows, Internal Report STF42 A01022, SINTEF Applied Mathematics, Dep. of Optimization, Oslo, Norway, 2001.

    MATH  Google Scholar 

  5. Cordeau, J.-F., Laporte, G., and Mercier, A., A Unified Tabu Search Heuristic for Vehicle Routing Problems with Time Windows, J. Operat. Res. Soc., 2001, vol. 52, pp. 928–936.

    Article  MATH  Google Scholar 

  6. Vehicle Routing Problem, NEO Research Group. neo.lcc.uma.es/vrp/known-best-results/ (Accessed June 15, 2016).

  7. Ramalingan, A. and Vivekanandan, K., Genetic Algorithm Based SolutionModel forMulti-Depot Vehicle Routing Problem with Time Windows, Int. J. Adv. Res. Comput. Commun. Eng., 2014, vol. 3, no. 11, pp. 8433–8439.

    Article  Google Scholar 

  8. Rzevski, G. and Skobelev, P., Managing Complexity, London: WIT Press, 2014.

    Google Scholar 

  9. Toth, P. and Vigo, D., Vehicle Routing Problems, Methods, and Applications, Philadelphia: SIAM, 2014.

    Book  MATH  Google Scholar 

  10. Montoya-Torres, J.R., López, J.F., Isaza, S.N., Jiménez, H.F., and Herazo-Padilla, N., A Literature Review on the Vehicle Routing Problem with Multiple Depots, Comput. Industr. Eng., 2015, vol. 79, pp. 115–129.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to V. V. Sazonov.

Additional information

Original Russian Text © V.V. Sazonov, P.O. Skobelev, A.N. Lada, I.V. Mayorov, 2016, published in Upravlenie Bol’shimi Sistemami, 2016, No. 64, pp. 65–80.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sazonov, V.V., Skobelev, P.O., Lada, A.N. et al. Application of Multiagent Technologies to Multiple Depot Vehicle Routing Problem with Time Windows. Autom Remote Control 79, 1139–1147 (2018). https://doi.org/10.1134/S0005117918060127

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117918060127

Keywords

Navigation