Applying Genetic Algorithms To The Dial-A-Ride Problem With Time Windows
نویسنده
چکیده
The Dial-a-ride problem with time windows (DARPTW) assigns and schedules users transport requests to a fleet of vehicles enabled to fulfill the required service. The literature offers different heuristics for solving DARPTW problems, which are based on the extension of traditional graph search algorithms. On the other hand, the approach through Genetic Algorithms (GA) has been experienced in problems of combinatorial optimization. In this article we present our work and initial results with a framework to develop and test different GAs in the aim of finding an appropriate encoding and configuration, specifically for the DARPTW problem. Key-Words: Genetic algorithms, DARPTW, Transport systems, Optimization.
منابع مشابه
Solving the Ride-Sharing Problem with Non-Homogeneous Vehicles by Using an Improved Genetic Algorithm with Innovative Mutation Operators and Local Search Methods
An increase in the number of vehicles in cities leads to several problems, including air pollution, noise pollution, and congestion. To overcome these problems, we need to use new urban management methods, such as using intelligent transportation systems like ride-sharing systems. The purpose of this study is to create and implement an improved genetic algorithms model for ride-sharing with non...
متن کاملInvestigating Genetic Algorithms for Solving the Multiple Vehicle Pickup and Delivery Problem with Time Windows
One important problem in transportation and logistics systems is the Multiple Vehicle Pickup and Delivery Problem with Time Windows (MV-PDPTW). The problem deals with a number of pickup and delivery (P&D) requests that should be served by a fleet of vehicles. A delivery location must be served after its corresponding pickup location. The vehicle’s journey should start and end at a central depot...
متن کاملImproving Techniques for an On-line Dial-a-ride Problem with Time Windows and Capacity Constraints
متن کامل
Transfers in the on-demand transportation: the DARPT Dial-a-Ride Problem with transfers allowed
Today, the on-demand transportation is used for elderly and disabled people for short distances. Each user provides a specific demand: a particular ride from an origin to a destination with hard time constraints like time windows, maximum user ride time, maximum route duration limits and precedence. This paper deals with the resolution of these problems (Dial-a-Ride Problems – DARP), including ...
متن کاملOnline Dial-A-Ride Problem with Time Windows: An Exact Algorithm Using Status Vectors
The Dial-A-Ride Problem (DARP) has often been used to organize transport of elderly and handicapped people, assuming that these people can book their transport in advance. But the DARP can also be used to organize usual passenger or goods transportation in real online scenarios with time window constraints. This paper presents an efficient exact algorithm with significantly reduced calculation ...
متن کامل