Learning (Re-)Starting Solutions for Vehicle Routing Problems

08/08/2020
by   Xingwen Zhang, et al.
0

A key challenge in solving a combinatorial optimization problem is how to guide the agent (i.e., solver) to efficiently explore the enormous search space. Conventional approaches often rely on enumeration (e.g., exhaustive, random, or tabu search) or have to restrict the exploration to rather limited regions (e.g., a single path as in iterative algorithms). In this paper, we show it is possible to use machine learning to speedup the exploration. In particular, a value network is trained to evaluate solution candidates, which provides a useful structure (i.e., an approximate value surface) over the search space; this value network is then used to screen solutions to help a black-box optimization agent to initialize or restart so as to navigate through the search space towards desirable solutions. Experiments demonstrate that the proposed “Learn to Restart” algorithm achieves promising results in solving Capacitated Vehicle Routing Problems (CVRPs).

READ FULL TEXT
POST COMMENT

Comments

sanathkumarparimi999

source code???


Authors

page 1

page 2

page 3

page 4

10/22/2020

Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems

In this article, a novel approach to solve combinatorial optimization pr...
08/27/2012

Sensitive Ants in Solving the Generalized Vehicle Routing Problem

The idea of sensitivity in ant colony systems has been exploited in hybr...
03/16/2018

Heuristics for vehicle routing problems: Sequence or set optimization?

We investigate a structural decomposition for the capacitated vehicle ro...
01/23/2013

Learning Bayesian Network Structure from Massive Datasets: The "Sparse Candidate" Algorithm

Learning Bayesian networks is often cast as an optimization problem, whe...
10/16/2012

Uniform Solution Sampling Using a Constraint Solver As an Oracle

We consider the problem of sampling from solutions defined by a set of h...
04/14/2021

Exact and Approximate Hierarchical Clustering Using A*

Hierarchical clustering is a critical task in numerous domains. Many app...
12/11/2012

Study: Symmetry breaking for ASP

In their nature configuration problems are combinatorial (optimization) ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.