Research Article
Optimization of a Semiflexible Demand-Responsive Feeder System in Suburban Areas Using a Memetic Algorithm
Algorithm 1
MA full algorithm pseudo-code.
| Start: | | For each line in set of line: | | Initialize pool of possible routes for line | | Append requests of the current operation period in the list of requests | | Append rejected requests from previous periods in the list of requests | | Generate initial solutions | | Identify the list of 5% best solutions | | Repeat: | | Create a new empty generation | | Add the 5% best solutions from previous generation | | Repeat: | | Generate two new solutions with crossover operation | | Apply mutation on these two solutions | | Evaluate solutions | | Until solutions in the new generation = | | Apply repair operation to all solutions | | Apply improvement operation to all solutions | | Update list of 5% best solutions | | Until termination criteria |
|