Solving the capacitated vehicle routing problem with timing windows using rollouts and MAX-SAT.
Harshad KhadilkarPublished in: CoRR (2022)
Keyphrases
- max sat
- weighted max sat
- stochastic local search
- graph coloring
- variable ordering
- lower bound
- tabu search
- branch and bound algorithm
- search algorithm
- sat solvers
- branch and bound
- sat problem
- random sat instances
- exact algorithms
- memetic algorithm
- guided local search
- maximum satisfiability
- constraint satisfaction
- orders of magnitude
- linear programming
- cnf formula
- information retrieval
- sat instances
- satisfiability problem
- vehicle routing problem
- propositional satisfiability
- randomly generated
- neural network
- max sat solver