IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-02081045.html
   My bibliography  Save this paper

Dynamic bundling and pricing for LTL transport requests in Physical Internet

Author

Listed:
  • Bin Qiao

    (CGS i3 - Centre de Gestion Scientifique i3 - Mines Paris - PSL (École nationale supérieure des mines de Paris) - PSL - Université Paris Sciences et Lettres - I3 - Institut interdisciplinaire de l’innovation - CNRS - Centre National de la Recherche Scientifique)

  • Shenle Pan

    (CGS i3 - Centre de Gestion Scientifique i3 - Mines Paris - PSL (École nationale supérieure des mines de Paris) - PSL - Université Paris Sciences et Lettres - I3 - Institut interdisciplinaire de l’innovation - CNRS - Centre National de la Recherche Scientifique)

  • Eric Ballot

    (CGS i3 - Centre de Gestion Scientifique i3 - Mines Paris - PSL (École nationale supérieure des mines de Paris) - PSL - Université Paris Sciences et Lettres - I3 - Institut interdisciplinaire de l’innovation - CNRS - Centre National de la Recherche Scientifique)

Abstract

This work investigates the dynamic bundling and pricing problem for LTL requests in Physical Internet. From the perspective of carrier, bundling freight transport requests means accepting a package of requests that have synergies on their routes for transport cost reduction. In this work, we consider the situation in which a set of LTL requests with different O-D pairs in a network and carriers should consider request bundling to increase their fill rate and profit. Under combinatorial auction (CA) mechanism, carrier should decide the profitable request bundles that they want to transport and the optimal bidding price to maximize his total profit. Moreover, the future possible requests on the route should also be considered to improve the decision. We propose a mixed integer nonlinear programming (MINLP) model to solve the problem, which optimizes dynamic bundle (route) generation and pricing simultaneously. The model can be used as a decision-making model for carriers to establish real-time transport planning and pricing. A numerical study is constructed to evaluate the feasibility of the proposed model.

Suggested Citation

  • Bin Qiao & Shenle Pan & Eric Ballot, 2019. "Dynamic bundling and pricing for LTL transport requests in Physical Internet," Post-Print hal-02081045, HAL.
    • Handle: RePEc:hal:journl:hal-02081045
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hal:journl:hal-02081045. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.