Complexity Analysis of the Parallel Memetic Algorithm for the Pickup and Delivery Problem with Time Windows.
Miroslaw BlochoJakub NalepaPublished in: ICMMI (2017)
Keyphrases
- memetic algorithm
- complexity analysis
- vehicle routing problem
- tabu search
- theoretical analysis
- assembly line balancing
- benchmark instances
- evolutionary computation
- job shop scheduling problem
- timetabling problem
- genetic algorithm
- crossover operator
- lower bound
- combinatorial optimization
- traveling salesman problem
- metaheuristic
- first order logic
- vehicle routing
- shared memory
- computational complexity
- simulated annealing
- computational intelligence
- data structure
- neural network