In this paper we study a vehicle routing problem where customers request multiple commodities. We study the impact on transportation cost from using vehicles dedicated to a single commodity compared with using flexible vehicles capable of carrying any set of commodities. With vehicles that carry multiple commodities, we consider when the delivery to a customer can be made by more than one vehicle. If multiple vehicles can be used, we examine when deliveries of individual commodities may be split and when they may not be split. The latter problem has not previously been studied, and we present a mathematical programming model for it. We use worst case and computational analysis to compare these different models.


    Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Multicommodity vs. Single-Commodity Routing



    Published in:

    Publication date :

    2016




    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English



    Classification :

    Local classification TIB:    770/1935/7000
    BKL:    55.80 / 55.80 Verkehrswesen, Transportwesen: Allgemeines



    Multicommodity vs. Single-Commodity Routing

    Archetti, Claudia / Campbell, Ann Melissa / Speranza, M. Grazia | British Library Online Contents | 2016


    The Multicommodity-Ring Location Routing Problem

    Gianessi, Paolo | Online Contents | 2016


    The Multicommodity-Ring Location Routing Problem

    Gianessi, Paolo / Alfandari, Laurent / Létocart, Lucas et al. | British Library Online Contents | 2016



    Commodity Representations and Cut-Set-Based Inequalities for Multicommodity Capacitated Fixed-Charge Network Design

    Chouman, Mervat / Crainic, Teodor Gabriel / Gendron, Bernard | British Library Online Contents | 2017