{"id":31,"date":"2022-01-19T08:56:08","date_gmt":"2022-01-19T08:56:08","guid":{"rendered":"https:\/\/devasol.com\/?post_type=rara-portfolio&#038;p=31"},"modified":"2023-01-27T13:05:12","modified_gmt":"2023-01-27T13:05:12","slug":"vehicle-routing-system-using-any-colony-optimization","status":"publish","type":"rara-portfolio","link":"https:\/\/devasol.com\/?rara-portfolio=vehicle-routing-system-using-any-colony-optimization","title":{"rendered":"Vehicle Routing System using Ant Colony Optimization"},"content":{"rendered":"\n<figure class=\"wp-block-image size-full\"><img loading=\"lazy\" decoding=\"async\" width=\"448\" height=\"294\" src=\"https:\/\/devasol.com\/wp-content\/uploads\/2022\/01\/header-img.png\" alt=\"\" class=\"wp-image-32\" srcset=\"https:\/\/devasol.com\/wp-content\/uploads\/2022\/01\/header-img.png 448w, https:\/\/devasol.com\/wp-content\/uploads\/2022\/01\/header-img-300x197.png 300w, https:\/\/devasol.com\/wp-content\/uploads\/2022\/01\/header-img-91x60.png 91w\" sizes=\"auto, (max-width: 448px) 100vw, 448px\" \/><\/figure>\n\n\n\n<h3 class=\"wp-block-heading\"><strong><br><\/strong><canvas width=\"31\" height=\"37\"><\/canvas><canvas width=\"122\" height=\"37\"><\/canvas><canvas width=\"132\" height=\"37\"><\/canvas><canvas width=\"97\" height=\"37\"><\/canvas><\/h3>\n\n\n\n<p>This web application solves the Capacitated Vehicle Routing Problem using Ant Colony Optimization<img decoding=\"async\" src=\"https:\/\/devasol.com\/vrs\/images\/1page-img.jpg\" alt=\"\"><\/p>\n\n\n\n<p>A CVRP consists of one warehouse and several nodes each of which has a demand to be fulfilled by delivery trucks based in the warehouse. These trucks will have a maximum capacity. The objective of solving this problem is to find the minimum number of routes which will add up to having the minimum total distance which will also maximize the utilization of truck capacity. This in turn would ensure the least distribution cost for the company.<\/p>\n\n\n\n<div class=\"wp-block-buttons is-layout-flex wp-block-buttons-is-layout-flex\">\n<div class=\"wp-block-button\"><a class=\"wp-block-button__link wp-element-button\" href=\"https:\/\/devasol.finpledge.com\/vrs\" target=\"_blank\" rel=\"noreferrer noopener\">View this Project<\/a><\/div>\n<\/div>\n","protected":false},"excerpt":{"rendered":"<p>This web application solves the Capacitated Vehicle Routing Problem using Ant Colony Optimization algorithm.<\/p>\n","protected":false},"author":1,"featured_media":32,"comment_status":"open","ping_status":"closed","template":"","rara_portfolio_categories":[4,5],"class_list":["post-31","rara-portfolio","type-rara-portfolio","status-publish","has-post-thumbnail","hentry","rara_portfolio_categories-web-application","rara_portfolio_categories-web-service"],"_links":{"self":[{"href":"https:\/\/devasol.com\/index.php?rest_route=\/wp\/v2\/rara-portfolio\/31","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/devasol.com\/index.php?rest_route=\/wp\/v2\/rara-portfolio"}],"about":[{"href":"https:\/\/devasol.com\/index.php?rest_route=\/wp\/v2\/types\/rara-portfolio"}],"author":[{"embeddable":true,"href":"https:\/\/devasol.com\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/devasol.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=31"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/devasol.com\/index.php?rest_route=\/wp\/v2\/media\/32"}],"wp:attachment":[{"href":"https:\/\/devasol.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=31"}],"wp:term":[{"taxonomy":"rara_portfolio_categories","embeddable":true,"href":"https:\/\/devasol.com\/index.php?rest_route=%2Fwp%2Fv2%2Frara_portfolio_categories&post=31"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}