A modified variable neighborhood search hybridized with genetic algorithm for vehicle routing problems with cross-docking.
Ali BaniamerianMahdi BashiriFahime ZabihiPublished in: Electron. Notes Discret. Math. (2018)
Keyphrases
- variable neighborhood search
- metaheuristic
- genetic algorithm
- vehicle routing problem
- tabu search
- job shop scheduling problem
- hybrid metaheuristic
- memetic algorithm
- benchmark instances
- search procedure
- particle swarm optimization
- neighborhood search
- simulated annealing
- path relinking
- routing problem
- genetic algorithm ga
- heuristic methods
- traveling salesman problem
- ant colony optimization
- benchmark problems
- initial population
- minimum spanning tree
- combinatorial optimization problems
- test instances
- combinatorial optimization
- search space
- feasible solution
- neural network
- combinatorial problems
- scatter search
- optimal solution
- test problems
- travel time
- optimization problems
- scheduling problem
- crossover operator
- fitness function
- solution space
- single machine scheduling problem
- graph model
- evolutionary algorithm
- max sat
- hybrid algorithm
- differential evolution
- nature inspired
- cost function
- special case