Real time simulation of auctioning and re-scheduling processes in hybrid freight markets
In the freight logistics business, supply chains are under strong pressure to provide customized goods and services. Individualized product deliveries, modifications in product specification, late orders and volume changes need to be accommodated within strict delivery time frames. This uncertainty in demand can only be accommodated by allowing for slack capacity and time in trip planning. As this overbooking creates substantial costs, however, firms will attempt to minimize these costs by further optimizing and re-organizing their distribution channels. In this paper we look at the feasibility of one such solution, a hybrid system of contracting freight carrying services. Here, part of the services are provided by various carriers using contracts for a fixed base volume of freight, which results in planned delivery tours. Additional to these volumes, peaks resulting from additional shipments are accommodated by one or more of these carriers within an auction setting based on price and quality of service. The additional freight is won by the carrier that has the most flexible trip planning in terms of capacity, service quality and costs. We test the effectiveness and efficiency of this contracting system by means of a simultaneous, real time simulation of the execution of planned tours, the auctioning process and the re-scheduling of tours. The model provides us with new insights on the dynamics of bidding behaviour on the side of carriers and shippers.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 41 (2007)
Issue (Month): 9 (November)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Regan, A C & Song, Jiongjiong, 2003. "Combinatorial Auctions for Transportation Service Procurement: The Carrier Perspective," University of California Transportation Center, Working Papers qt7sq003mj, University of California Transportation Center.
- Bob Thompson, 2008. "Liveability," ERES eres2008_275, European Real Estate Society (ERES).
- Song, Jiongjiong & Regan, Amelia, 2005. "Approximation algorithms for the bid construction problem in combinatorial auctions for the procurement of freight transportation contracts," Transportation Research Part B: Methodological, Elsevier, vol. 39(10), pages 914-933, December.
- Olli Bräysy & Michel Gendreau, 2002. "Tabu Search heuristics for the Vehicle Routing Problem with Time Windows," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 10(2), pages 211-237, December.
- Bulow, Jeremy & Klemperer, Paul, 1996. "Auctions versus Negotiations," American Economic Review, American Economic Association, vol. 86(1), pages 180-94, March.
- S. Illeris & G. Akehurst, 2002. "Introduction," The Service Industries Journal, Taylor & Francis Journals, vol. 22(1), pages 1-3, January.
When requesting a correction, please mention this item's handle: RePEc:eee:transb:v:41:y:2007:i:9:p:1050-1066. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Shamier, Wendy)
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.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.