Ant colony optimization applied to the problem of summary. This paper proposes a heuristic solution to the problem of programming and routing of vehicles to transport people with disabilities. In this type of problem, known in literature as a “problem of dial-a-ride”, users are requests for transport of a specific point of departure for a specific point landing. The objective of the problem is to determine a route schedule that meets requests for transportation subject to the restrictions on the number of available vehicles, windows time in collection and delivery points, vehicle capacity, precedence over the collection delivery and maximum tolerance of the passenger in the vehicle. The problem studied this article applies to the case where the vehicle fleet is finite, heterogeneous and vehicles start from different garages arranged geographically in the region from which arise requests. The proposed heuristic is based on meta-heuristic of ant colony and seeks to maximize the number of requests serviced at the lowest possible cost. The computational results obtained from the application of heuristics in a real data operator of the city of Sorocaba-SP, suggest a promising performance for use the ant colony optimization problem in the Dial-a-ride.
Ant colony optimization applied to the problem of scheduling and vehicle routing for the transportation of persons disabled.
This entry was posted in Publications. Bookmark the permalink.
