=Paper=
{{Paper
|id=Vol-1784/a3
|storemode=property
|title=None
|pdfUrl=https://ceur-ws.org/Vol-1784/a3.pdf
|volume=Vol-1784
}}
==None==
<pdf width="1500px">https://ceur-ws.org/Vol-1784/a3.pdf</pdf>
<pre>
Implementation of CVRP in a Metropolitan
Area with a High Density of Vehicular Fleet

     Edgar Gonzalo Cossio Franco2 and Alberto Ochoa-Zezatti1
                1
                Institute for Engineering and Technology
                   Autonomous University of Juarez
                             Juarez, Mexico
              2
                Doctorado en Sistemas Computacionales
    Universidad da Vinci, UDV / Universidad Enrique Dı́az de León
                     UNEDL Guadalajara, Mexico



 Abstract. The problem of routing of vehicles (VRP) is the approach
 from which faces the problem of logistics, management, management and
 distribution of goods from one point to a destination. When is required
 to distribute loads to the classic problem, then it is considered the VRP
 with the capacity extension or (CVRP). The present work focuses on
 using an instance with the purpose of implementing an improvement to
 public transportation in the Metropolitan Area of Guadalajara (MAoG).
 It uses the language for technical calculation called (MATLAB). The
 algorithm used in this work is described below: a) Start from the depot,
 b) Examine the outputs that have not been served, outputs may be
 feasible and infeasiblec) For choose the best feasible outputs, for example
 having the shortest distance, insert it into the route and position before
 the last exit on that route, d) If there are more feasible outputs, repeat
 from point b), but to create a new route and start the flow from the point
 a), e) If all exits were covered, but finish initiate flow from the point a).
 The results show that the route can be optimized by distributing and
 reordering of units so that all points are covered.

</pre>