Integration of GIS and Optimization Routines for the Vehicle Routing Problem

  • Tlili T
  • Faiz S
  • Krichen S
N/ACitations
Citations of this article
22Readers
Mendeley users who have this article in their library.

Abstract

This paper evokes the vehicle routing problem (VRP) which aims to determine the minimum total cost pathways for a fleet of heterogeneous vehicles to deliver a set of customers' orders. The inability of optimization algorithms alone to fully satisfy the needs of logistic managers become obvious in transportation field due to the spatial nature of such problems. In this context, we couple a geographical information system (GIS) with a metaheuristic to handle the VRP efficiently then generate a geographical solution instead of the numerical solution. A real-case instance in a Tunisian region is studied in order to test the proposed approach. KEYWORDS Vehicle routing problem; Dijkstra-based approach; Geographical information system.

Cite

CITATION STYLE

APA

Tlili, T., Faiz, S., & Krichen, S. (2013). Integration of GIS and Optimization Routines for the Vehicle Routing Problem. International Journal of Chaos, Control, Modelling and Simulation, 2(2), 9–17. https://doi.org/10.5121/ijccms.2013.2202

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free