Comparison of eight evolutionary crossover operators for the vehicle routing problem
zbMATH Open1282.90154MaRDI QIDQ2869102FDOQ2869102
Authors: Krunoslav Puljić, Robert Manger
Publication date: 2 January 2014
Published in: Mathematical Communications (Search for Journal in Brave)
Full work available at URL: http://hrcak.srce.hr/index.php?show=clanak&id_clanak_jezik=163313&lang=en
Recommendations
- State-of-the art review-evolutionary algorithms for vehicle routing
- Experimenting crossover operators to solve the vehicle routing problem with time windows by genetic algorithms
- An improved evolutionary algorithm for solving the vehicle routing problem
- Optimised crossover genetic algorithm for capacitated vehicle routing problem
- A simple and effective evolutionary algorithm for the vehicle routing problem
traveling salesman problemevolutionary algorithmsvehicle routing problemexperimentscrossover operators
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Analysis of algorithms (68W40) Combinatorial optimization (90C27)
Cited In (9)
- Evolutionary Computation in Combinatorial Optimization
- Title not available (Why is that?)
- An Evolutionary Algorithm with Diversified Crossover Operator for the Heterogeneous Probabilistic TSP
- A hybrid dynamic programming and memetic algorithm to the traveling salesman problem with hotel selection
- An experimental comparison of algebraic crossover operators for permutation problems
- Evolutionary operators for the Hamiltonian completion problem
- Adjusting the order crossover operator for capacitated vehicle routing problems
- A comparative study of four genetic algorithm-based crossover operators for solving travelling salesman problem
- Transit sets of \(k\)-point crossover operators
Uses Software
This page was built for publication: Comparison of eight evolutionary crossover operators for the vehicle routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2869102)