Large-scale vehicle routing problems: quantum annealing, tunings and results
From MaRDI portal
Publication:1652398
DOI10.1016/j.cor.2017.05.014zbMath1391.90091OpenAlexW2619624888MaRDI QIDQ1652398
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2017.05.014
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Quantum computation (81P68)
Related Items (3)
A quantum computing based numerical method for solving mixed-integer optimal control problems ⋮ A numerical method for interval multi-objective mixed-integer optimal control problems based on quantum heuristic algorithm ⋮ Thermal entanglement in quantum annealing processor
Uses Software
Cites Work
- Unnamed Item
- Quantum annealing of the graph coloring problem
- Computing nine new best-so-far solutions for capacitated VRP with a cellular genetic algorithm
- A problem-reduction evolutionary algorithm for solving the capacitated vehicle routing problem
- The late acceptance hill-climbing heuristic
- Active guided evolution strategies for large-scale vehicle routing problems with time windows
- BoneRoute: An adaptive memory-based method for effective fleet management
- Very large-scale vehicle routing: new test problems, algorithms, and results
- A new ILP-based refinement heuristic for vehicle routing problems
- Tuning an Algorithm Using Design of Experiments
- Parallel iterative search methods for vehicle routing problems
- Equation of State Calculations by Fast Computing Machines
This page was built for publication: Large-scale vehicle routing problems: quantum annealing, tunings and results