VRP’s can also be classified into two categories as dynamic and static routing problems. In the static VRP’s, the stops/locations that the vehicle will visit are pre-specified and do not change during the distribution/collection process. In dynamic VRP’s, on the other hand, new stops can be added to the planned route during the process or certain stops can be omitted. In similar dynamic problems, some or all of the access points are not known in the beginning. These points are dynamically defined during the route design or planning stages. In the dynamic VRP, using a real- time communication network between the vehicle and decision-making system, the vehicle routes can be re-defined during the operation. This type of problems is defined as online or real-time problems by some scholars (Pillac, Gendreau, Guéret & Medaglia, 2013). Two examples of this can be certain orders getting cancelled or new orders being taken while a water distribution vehicle is on its route, or a school bus being informed on its route that certain students will be absent from school that day. In current conditions, dynamic VRP’s are more frequently needed, and are attributed with a more specific importance. The first study dealing with dynamic VRP was carried out by Wilson and Colvin (Pillac, Gendreau, Guéret & Medaglia, 2013). The enhancements in GPS, traffic sensors, and mobile communication systems caused a further acceleration in studies carried out in this field. Within the context of this study, DSBRP will be investigated. DSBRP is graphically explained in Figure 2. ; https://www.edusoft.ro/brain/index.php/brain/article/view/803/909
Using the Genetic Algorithm for the Optimization of Dynamic School Bus Routing Problem-Figure 2. A dynamic school bus routing case
01.05.2018
BRAIN. Broad Research in Artificial Intelligence and Neuroscience 9(2) 6-21
Sonstige
Elektronische Ressource
Englisch
DDC: | 629 |