IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v70y2019i12p2097-2111.html
   My bibliography  Save this article

A profit-maximization heuristic for combinatorial bid construction with pre-existing network restrictions

Author

Listed:
  • Intissar Ben Othmane
  • Monia Rekik
  • Sehl Mellouli

Abstract

This paper proposes a heuristic approach for constructing combinatorial bids in TL transportation services procurement auctions. It considers the case where the carrier has already engaged on a set of transportation contracts before participating in the auction. The proposed heuristic identifies profitable new contracts and efficiently integrates them in the carrier exiting routes, and/or builds new routes for unused vehicles. Experimental results prove the efficiency of the proposed heuristic in terms of computing times and solutions quality.

Suggested Citation

  • Intissar Ben Othmane & Monia Rekik & Sehl Mellouli, 2019. "A profit-maximization heuristic for combinatorial bid construction with pre-existing network restrictions," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 70(12), pages 2097-2111, December.
    • Handle: RePEc:taf:tjorxx:v:70:y:2019:i:12:p:2097-2111
    DOI: 10.1080/01605682.2018.1512844
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2018.1512844
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2018.1512844?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Hammami, Farouk & Rekik, Monia & Coelho, Leandro C., 2019. "Exact and heuristic solution approaches for the bid construction problem in transportation procurement auctions with a heterogeneous fleet," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 127(C), pages 150-177.
    2. Hammami, Farouk & Rekik, Monia & Coelho, Leandro C., 2021. "Exact and hybrid heuristic methods to solve the combinatorial bid construction problem with stochastic prices in truckload transportation services procurement auctions," Transportation Research Part B: Methodological, Elsevier, vol. 149(C), pages 204-229.
    3. Zhang, Huili & Luo, Kelin & Xu, Yao & Xu, Yinfeng & Tong, Weitian, 2022. "Online crowdsourced truck delivery using historical information," European Journal of Operational Research, Elsevier, vol. 301(2), pages 486-501.

    More about this item

    Statistics

    Access and download statistics

    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:taf:tjorxx:v:70:y:2019:i:12:p:2097-2111. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.