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

Intissar Ben Othmane, Monia Rekik and Sehl Mellouli

Journal of the Operational Research Society, 2019, vol. 70, issue 12, 2097-2111

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.

Date: 2019
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://hdl.handle.net/10.1080/01605682.2018.1512844 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:tjorxx:v:70:y:2019:i:12:p:2097-2111

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/tjor20

DOI: 10.1080/01605682.2018.1512844

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald

More articles in Journal of the Operational Research Society from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().