With an increasing demand from emerging logistics businesses, Vehicle Routing Problem with Private fleet and common Carrier (VRPPC) has been introduced to manage package delivery services from a supplier to customers. However, almost all of existing studies focus on the deterministic problem that assumes all parameters are known perfectly at the time when the planning and routing decisions are made. In reality, some parameters are random and unknown. Therefore, in this paper, we consider VRPPC with hard time windows and random demand, called Optimal Delivery Planning (ODP). The proposed ODP aims to minimize the total package delivery cost while meeting the customer time window constraints. We use stochastic integer programming to formulate the optimization problem incorporating the customer demand uncertainty. Moreover, we evaluate the performance of the ODP using test data from benchmark dataset and from actual Singapore road map.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Optimal Stochastic Delivery Planning in Full-Truckload and Less-Than-Truckload Delivery


    Contributors:


    Publication date :

    2017-06-01


    Size :

    275219 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Network concentration indices for less-than-truckload transportation

    Lange, Anne / Delfmann, Werner | Online Contents | 2016




    Network concentration indices for less-than-truckload transportation

    Lange, Anne / Delfmann, Werner | Online Contents | 2016