New instances for maximum weight independent set from a vehicle routing application

05/26/2021
by   Yuanyuan Dong, et al.
0

We present a set of new instances of the maximum weight independent set problem. These instances are derived from a real-world vehicle routing problem and are challenging to solve in part because of their large size. We present instances with up to 881 thousand nodes and 383 million edges.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/28/2022

A Metaheuristic Algorithm for Large Maximum Weight Independent Set Problems

Motivated by a real-world vehicle routing application, we consider the m...
research
11/12/2021

Generalized Nested Rollout Policy Adaptation with Dynamic Bias for Vehicle Routing

In this paper we present an extension of the Nested Rollout Policy Adapt...
research
06/25/2023

Routing One Million Customers in a Handful of Minutes

In this paper, we propose a new dataset of Capacitated Vehicle Routing P...
research
02/05/2022

Solution of a Practical Vehicle Routing Problem for Monitoring Water Distribution Networks

In this work, we introduce a generalization of the well-known Vehicle Ro...
research
07/05/2018

Constructing Concrete Hard Instances of the Maximum Independent Set Problem

We provide a deterministic construction of hard instances for the maximu...
research
02/01/2020

Solving the Joint Order Batching and Picker Routing Problem for Large Instances

In this work, we investigate the problem of order batching and picker ro...
research
10/11/2016

Toward a new instances of NELL

We are developing the method to start new instances of NELL in various l...

Please sign up or login with your details

Forgot password? Click here to reset