Synchronized routing of active and passive means of transport

Authors:
Frank Meisel;Herbert Kopfer
Affiliations:
School of Economics and Business, Martin-Luther-University Halle-Wittenberg, Halle, Germany 06108;Faculty of Business Studies and Economics, University of Bremen, Bremen, Germany
Venue:
OR Spectrum
Year:
2014

Citing 8
Cited 0

An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows

Transportation Science
Simultaneous vehicle and driver scheduling: A case study in a limousine rental company

Computers and Industrial Engineering
A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows

Networks - Route 2007
Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows

Operations Research
The combined manpower-vehicle routing problem for multi-staged services

Expert Systems with Applications: An International Journal
A vehicle routing problem with pickup and delivery time windows, and coordination of transportable resources

Computers and Operations Research
The Two-Echelon Capacitated Vehicle Routing Problem: Models and Math-Based Heuristics

Transportation Science
Synchronization in Vehicle Routing---A Survey of VRPs with Multiple Synchronization Constraints

Transportation Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses a routing problem where the fulfillment of transport requests requires two types of transport resources, namely, passive and active means of transport. The passive means are used for holding the cargo that is to be shipped from pickup to delivery locations. The active means take up the passive means and carry them from one location to another. Compared to classical vehicle routing problems, the additional challenge in this combined routing problem is that the operations of both transport resources have to be synchronized. In this paper, we provide a modeling approach for the joint routing of passive and active means of transport. We solve the problem by large neighborhood search meta-heuristics that utilize various problem-specific components, for example local search techniques for the routes of active and passive means. A computational study on a large set of benchmark instances is used for assessing the performance of the meta-heuristics.