Carpooling has gained considerable importance in developed as well as in developing countries as an effective solution for controlling vehicular pollution, both sound and air. As carpooling decreases the number of vehicles used by commuters, it results in multiple benefits like mitigation of traffic and congestion on the roads, reduced demand for parking facilities, lesser energy or fuel consumption and most importantly, reduction in carbon emission, thus improving the quality of life in cities. This work presents a hybrid GA-A* algorithm to obtain optimal routes for the carpooling problem in the domain of multi-objective optimization having multiple conflicting objectives. Though Genetic algorithm provides optimal solutions, A* algorithm because of its efficiency in providing the shortest route between any two points based on heuristics, enhances the optimal routes obtained using Genetic algorithm. The refined routes, obtained using the GA-A* algorithm, are further subjected to dominance test to obtain non-dominating solutions based on Pareto-Optimality. The routes obtained maximize the profit of the service provider by minimizing the travel and detour distance as well as pick-up/drop costs while maximizing the utilization of the car. The proposed algorithm has been implemented over the Salt Lake area of Kolkata. Route distance and detour distance for the optimal routes obtained using the proposed algorithm are consistently lesser for the same number of passengers when compared with the corresponding data obtained using the existing algorithm. Various statistical analyses like boxplots have also confirmed that the proposed algorithm regularly performed better than the existing algorithm using only Genetic Algorithm.
Hybrid Genetic Search for the CVRP: Open-Source Implementation and SWAP* Neighborhood
车辆路径问题是组合优化研究的热点问题之一,具有重要的实用价值和方法论意义。然而,尽管方法学取得了广泛的进展,但最近的许多研究都受到了简单有效的开源解决方案方法的限制。考虑到当前算法的复杂性,重新实现正在成为一项困难而耗时的工作,需要对细节进行广泛的关注才能真正成功。在此背景下,我们利用这篇短文的机会,介绍了一个简单的-开源-实现的混合遗传搜索(HGS)专门的能力限制车辆路径问题(CVRP)。这种最先进的算法使用与Vidal等人(2012)相同的一般方法,但也包括过去十年研究中的其他方法改进和经验教训。特别是,它包括一个称为SWAP* 的额外邻域,该邻域包括在不同路由之间交换两个客户,而无需插入到位。正如我们的研究所强调的,有效地探索SWAP* 移动对本地搜索的性能有很大的贡献。此外,正如在Uchoa et al.(2017)的经典实例上与其他最近方法的实验比较中所观察到的那样,HGS仍然是解决方案质量,收敛速度和概念简单性方面的领先元启发式算法。