Abstract
Vehicle routing problem (VRP) is real-world combinatorial optimization problem which determine the optimal route of a vehicle. Generally, toprovide the efficientvehicle serving to the customer through different services by visiting the number of cities or stops. The VRP follows the Travelling Salesman Problem (TSP), in which each of vehicle visiting a set of cities such that every city is visited by exactly one vehicle only once. This work proposes the Ant Colony Optimization (ACO)-TSP algorithm to eliminate the tour loop for Open Vehicle routing Problem (OVRP). A key aspect of this algorithm is to plan the routes of buses that must pick up and deliver the school students from various bus stops on time, especially in the case of far distance covered by the vehicle in a rural area and find out the efficient and safe vehicle route.
Highlights
The School Bus Routing Problem (SBRP) is a common real-life problem, proposed in the literature by Newton and Thomas (1969), but has not been tackled that often in the field of computer science
The Open Vehicle routing Problem (OVRP) differs from the well-known vehicle routing problem (VRP) in that the vehicles do not necessarily return to their original locations after serving to the customers; if they do, they must follow the same path in the reverse order
The results are described in two cases: Case-I describe the Ant Colony Optimization (ACO) tour loop elimination and in Case-II, analyses the path selection and stops/nodes selection behaviour of the two different ACO algorithms-one with tour cycle and others with tour loop elimination
Summary
The School Bus Routing Problem (SBRP) is a common real-life problem, proposed in the literature by Newton and Thomas (1969), but has not been tackled that often in the field of computer science. Even that a day many of the organisations are faced with the problem regarding efficient vehicle fleets. When, they need to pick up and deliver items and goods or to provide the pick-up and delivery services to the people. The second part describes the comparison study of OVRP and VRP to find out the most efficient route of buses and to select the bus stops of the vehicle to provide the pick-up and delivery services to the students on time. The study discussed in the paper involves the bus route of Sant Baba Bhag Singh International School situated in rural area in Padhiana, Punjab, India, where more than 1000 students are bussed to the school from different villages and cover up a far distance by the buses, which is the main problem that some buses don’t return to the school
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Advanced Computer Science and Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
