A Parallel Meta-heuristic for Solving a Multiple Asymmetric Traveling Salesman Problem with Simulateneous Pickup and Delivery Modeling Demand Responsive Transport Problems.
Eneko OsabaFernando DíazEnrique OnievaPedro López-GarcíaRoberto CarballedoAsier PerallosPublished in: HAIS (2015)
Keyphrases
- metaheuristic
- combinatorial optimization problems
- combinatorial optimization
- optimization problems
- ant colony optimisation
- combinatorial problems
- ant colony optimization
- genetic algorithm
- tabu search
- hyper heuristics
- branch and bound
- optimization method
- harmony search algorithm
- evolutionary algorithm
- benchmark problems
- search space
- suboptimal solutions
- np complete problems
- traveling salesman problem
- timetabling problem
- difficult problems
- branch and bound algorithm
- constraint satisfaction problems
- np complete
- optimal solution