Università di Pisa
Sistema bibliotecario di ateneo

A multiperiod drayage problem with customer-dependent service periods

Ghezelsoflu, Ali and Di Francesco, Massimo and Frangioni, Antonio and Zuddas, Paola (2019) A multiperiod drayage problem with customer-dependent service periods. Technical Report del Dipartimento di Informatica, TR . University of Pisa, Pisa, IT. (Submitted)

Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (2676Kb) | Preview


    We investigate a routing problem arising in the domain of drayage operations. to determine mimimum-cost vehicle routes in several periods. We adapt a set-covering model, which is solved either with all feasible routes by an off-the-shelf MIP solver, or by and a Price-and-Branch algorithm in which the pricing problem is a formulated as a collection of shortest path problems in tailor-made auxiliary acyclic networks. We propose a new arc-flow formulation based on the previous auxiliary networks and show that solving it by a MIP solver is usually preferable. Finally, we characterize how possible changes in flexibility levels affect routing costs.

    Item Type: Book
    Subjects: Area01 - Scienze matematiche e informatiche > MAT/09 - Ricerca operativa
    Divisions: Dipartimenti (from 2013) > DIPARTIMENTO DI INFORMATICA
    Depositing User: Prof. Antonio Frangioni
    Date Deposited: 03 May 2019 09:43
    Last Modified: 03 May 2019 09:43
    URI: http://eprints.adm.unipi.it/id/eprint/2394

    Repository staff only actions

    View Item