A Simple Heuristic for Basic Vehicle Routing Problem

Authors

  • Nodari Vakhania Centro de Investigación en Ciencias, UAEM
  • Jose Alberto Hernandez Facultad de Contaduría, Administración e Informática UAEM
  • Federico Alonso - Pecina Facultad de Contaduría, Administración e Informática UAEM
  • Crispin Zavala Facultad de Contaduría, Administración e Informática UAEM

Keywords:

Vehicle routing problem, Heuristic algorithm, Euclidean distance, Weighted graph

Abstract

The vehicle routing problem is an important real-life transportation problem. We propose a two-phase construction heuristic for the solution of the classical Euclidean (uncapacitated) vehicle routing problem in which the minimum cost  distinct vehicle tours are to be formed for the given  customer locations. At the first phase we construct a polygon in the 2-dimensional Euclidean space that girds all the given points (customer locations and the depot). The second phase consists of two stages. At the first stage the interior polygon area is partitioned into  triangle areas, and at the second stage the  tours for each of these areas are constructed.

Downloads

Published

2016-12-29

Issue

Vol. 3 No. 2 (2016)

Section

Articles

License

Policy for Journals/Articles with Open Access

Authors who publish with this journal agree to the following terms:
    1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

  1. Authors are permitted and encouraged to post links to their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work

Policy for Journals / Manuscript with Paid Access

Authors who publish with this journal agree to the following terms:
    1. Publisher retain copyright .

  1. Authors are permitted and encouraged to post links to their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work .