Volltextsuche nutzen
- versandkostenfrei ab € 30,–
- 11x in Wien, NÖ und Salzburg
- 6 Mio. Bücher
- facultas
- Detailansicht
Using Genetic Algorithm In Solving Capacitated Vehicle Routing Problem
Taschenbuch
56,50€
inkl. gesetzl. MwSt.
Herstellung bei AnforderungVersandkostenfreibestellen in Österreich
Deutschland: € 10,00
EU & Schweiz: € 20,00
EU & Schweiz: € 20,00
In den Warenkorb
Click & Collect
Artikel online bestellen und in der Filiale abholen.
Derzeit in keiner facultas Filiale lagernd. Jetzt online bestellen!Artikel online bestellen und in der Filiale abholen.
Artikel in den Warenkorb legen, zur Kassa gehen und Wunschfiliale auswählen. Lieferung abholen und bequem vor Ort bezahlen.
Auf die Merkliste
Veröffentlicht 2015, von Mazin Abed Mohammed, Omar Ibrahim Obaid, Mohd Sharifuddin Bin Ahmad bei LAP Lambert Academic Publishing
ISBN: 978-3-659-74963-6
104 Seiten
6 mm x 150 mm
The problem of vehicle routing is one of the many problems that have no perfect solutions yet. Many researchers over the last few decades have established numerous researches and used many methods with different techniques to handle it. But, for all researches, finding the lowest cost is very complex. However, they have managed to come up with approximate solutions that differ in efficiencies ...
Beschreibung
The problem of vehicle routing is one of the many problems that have no perfect solutions yet. Many researchers over the last few decades have established numerous researches and used many methods with different techniques to handle it. But, for all researches, finding the lowest cost is very complex. However, they have managed to come up with approximate solutions that differ in efficiencies depending on the search space. This Book attempts to find the shortest route for vehicle routing problem to help UNITEN reduce student's transportation costs. Genetic Algorithm is used to solve this problem as it is capable of solving many complex problems. The Capacitated Vehicle Routing Problem (CVRP) model is implemented for optimizing UNITEN's shuttle bus services. The algorithms have been adapted to solve the research problem, where its procedure is different than the common algorithm. The structure of the algorithm is designed so that the program does not require a large database to store the population, which speeds up the implementation of the program execution to obtain the solution.
The problem of vehicle routing is one of the many problems that have no perfect solutions yet. Many researchers over the last few decades have established numerous researches and used many methods with different techniques to handle it. But, for all researches, finding the lowest cost is very complex. However, they have managed to come up with approximate solutions that differ in efficiencies depending on the search space. This Book attempts to find the shortest route for vehicle routing problem to help UNITEN reduce student's transportation costs. Genetic Algorithm is used to solve this problem as it is capable of solving many complex problems. The Capacitated Vehicle Routing Problem (CVRP) model is implemented for optimizing UNITEN's shuttle bus services. The algorithms have been adapted to solve the research problem, where its procedure is different than the common algorithm. The structure of the algorithm is designed so that the program does not require a large database to store the population, which speeds up the implementation of the program execution to obtain the solution.