Go to content
UR Home

Vehicle routing with private fleet, multiple common carriers offering volume discounts, and rental options

Gahm, Christian, Brabänder, Christian and Tuma, Axel (2017) Vehicle routing with private fleet, multiple common carriers offering volume discounts, and rental options. Transportation Research Part E: Logistics and Transportation Review 97, pp. 192-216.

Full text not available from this repository.

at publisher (via DOI)


Abstract

The problem addressed in this paper extends the vehicle routing problem with private fleet and common carriers by three aspects: two types of rental options, a cost function considering volumes and distances, and volume discounts offered by the common carriers. For its solution, we present a mixed integer program and three heuristics based on Variable Neighborhood Search. The computational ...

plus


Export bibliographical data



Item type:Article
Date:2017
Institutions:Business, Economics and Information Systems > Institut für Betriebswirtschaftslehre > Lehrstuhl für Controlling und Logistik (Prof. Dr. Andreas Otto)
Identification Number:
ValueType
10.1016/j.tre.2016.10.010DOI
Related URLs:
URLURL Type
http://www.sciencedirect.com/science/article/pii/S1366554516300837Publisher
Keywords:VARIABLE NEIGHBORHOOD SEARCH; TRAVELING-SALESMAN PROBLEM; FREIGHT FORWARDING COMPANIES; HEURISTIC ALGORITHM; QUANTITY DISCOUNTS; TIME WINDOWS; TABU SEARCH; TRANSPORTATION; TRUCKLOAD; CONSOLIDATION; Vehicle routing; Private vehicles; Common carrier; Rental options; Volume discounts; Variable neighborhood search
Dewey Decimal Classification:000 Computer science, information & general works > 000 Generalities, Science
300 Social sciences > 380 Commerce, communications, transport
Status:Published
Refereed:Yes, this version has been refereed
Created at the University of Regensburg:Partially
Item ID:34983
Owner only: item control page
  1. Homepage UR

University Library

Publication Server

Contact:

Publishing: oa@ur.de

Dissertations: dissertationen@ur.de

Research data: daten@ur.de

Contact persons