Variable Neighborhood Search Algorithms for the multi-depot dial-a-ride problem with heterogeneous vehicles and users

11/16/2016
by   Paolo Detti, et al.
0

In this work, a study on Variable Neighborhood Search algorithms for multi-depot dial-a-ride problems is presented. In dial-a-ride problems patients need to be transported from pre-specified pickup locations to pre-specified delivery locations, under different considerations. The addressed problem presents several constraints and features, such as heterogeneous vehicles, distributed in different depots, and heterogeneous patients. The aim is of minimizing the total routing cost, while respecting time-window, ride-time, capacity and route duration constraints. The objective of the study is of determining the best algorithm configuration in terms of initial solution, neighborhood and local search procedures. At this aim, two different procedures for the computation of an initial solution, six different type of neighborhoods and five local search procedures, where only intra-route changes are made, have been considered and compared. We have also evaluated an "adjusting procedure" that aims to produce feasible solutions from infeasible solutions with small constraints violations. The different VNS algorithms have been tested on instances from literature as well as on random instances arising from a real-world healthcare application.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/12/2020

Memetic Search for Vehicle Routing with Simultaneous Pickup-Delivery and Time Windows

The vehicle routing problem with simultaneous pickup-delivery and time w...
research
04/18/2012

Solution Representations and Local Search for the bi-objective Inventory Routing Problem

The solution of the biobjective IRP is rather challenging, even for meta...
research
02/18/2018

Large Neighborhood-Based Metaheuristic and Branch-and-Price for the Pickup and Delivery Problem with Split Loads

We consider the multi-vehicle one-to-one pickup and delivery problem wit...
research
10/10/2018

Robust optimization of a broad class of heterogeneous vehicle routing problems under demand uncertainty

This paper studies robust variants of an extended model of the classical...
research
07/03/2018

Variable neighborhood search for partitioning sparse biological networks into the maximum edge-weighted k-plexes

In a network, a k-plex represents a subset of n vertices where the degre...
research
04/25/2022

Efficient Neural Neighborhood Search for Pickup and Delivery Problems

We present an efficient Neural Neighborhood Search (N2S) approach for pi...
research
01/29/2014

Propagators and Violation Functions for Geometric and Workload Constraints Arising in Airspace Sectorisation

Airspace sectorisation provides a partition of a given airspace into sec...

Please sign up or login with your details

Forgot password? Click here to reset