An Examination of Human Fast and Frugal Heuristic Decisions for Truckload Spot Pricing
Abstract
:1. Introduction
- K competing carriers and L (=2K) loads (K loads per day; we use a two-day horizon)
- Given the typically long truckload distances, each carrier can handle at most one load each day.
- Carriers have historical statistics on strike prices (past delivery prices) on the load’s transportation lane (i.e., origin to destination path). We use “load” and “lane” synonymously herein.
- In each round, each carrier submits a bid for its projected most profitable two-day load bundle (i.e., a pair of loads comprising a two-day tour) to the shipper or the shipper’s freight transportation broker.
- Shippers solve winner determination problems (WDPs) to select carriers for their loads. This process, applicable to truckload and less-than-truckload settings—e.g., Lyu et al. (2019) [2]—proceeds to subsequent rounds if any carrier with capacity can profit from being selected for any unassigned load. We coded and verified this process in MATLAB (Release 2021b) and R to ensure accurate simulation of auctions. The coding to simulate the auction process produced the findings that will be presented later in the Results section.
2. Literature Review and Research Novelty
2.1. Trucking Services Pricing
- A lane’s prescribed bid price is a weighted average of the carrier’s operating cost and maximum price on the probability distribution of the carriers’ lowest bid, then truncated to fall between the highest and lowest projected bid. The authors found that for a uniform distribution of bid prices, the optimal weight is half. Their approach suggests a weight closer to two-thirds for normal distributions.
- For loads on lanes after the first load in a carriers’ tour, uncertainty in a carrier’s lane operating cost (caused by inherent location uncertainty in multi-lane/multi-load tours) affects the prescribed price.
2.2. Pricing-Relevant Works on Behavioral Theories
2.3. Works on Human-vs-Optimization Comparison
3. Materials and Methods
3.1. The Transportation Network
- Fix each replicate’s load coordinates and generate n random realizations of the 10 truck locations (n values explained below).
- Convert North America’s USD 1.10 per mile operating cost—see, e.g., the study in [32]—to approximately USD 0.70 per km, then randomly assign carriers operating costs between USD 0.60 and USD 0.80 per km.
- Calculate each carrier’s cost per loaded km by multiplying the operating cost per km by the distance to pick up and deliver each load, divided by the delivery distance. This requires one cost calculation for each Day1 load and 11 for each Day2 load, considering all possible two-day tours involving each Day2 load.
- Among the 11 cost calculations, only 1 corresponds to the carrier’s truck location when Day 2 begins. To select this, we randomly chose three Day 1 outcomes and used the one with the middle surplus of revenue-earning over empty travel. From that projected outcome (and associated delivery costs for Day2 loads), the carrier’s bid price prices for Day2 loads are calculated. This approach reflects the realistic possibility of varying Day1 outcomes due to competition in the auction.
- Using data from sources like the American Transportation Research Institute, we set carriers’ bid prices to achieve operating profit margins from a triangular distribution with {minimum; mode; maximum} = [5%; 5%; 17%], which reflects the industry’s often thin margins.
- Simulate each of the n multi-round auctions to obtain lane-specific strike prices, varying the sample size from n = 20 to n = 60. The results stabilized at n = 40, suggesting n = 60 as a sufficient sample size to derive the historical strike price data presented to respondents.
- For each carrier and two-day tour in the n = 60 auctions, calculate the surplus of loaded km over empty km as Sk,i-j, where the Day1 and Day2 loads and the carrier are indexed, respectively, as i = 0 to 10, j = 0, 11 to 20, and k = 1 to 10.
- Using the Sk,i-j values, determine each carrier’s mean surplus for each Day1 and Day2 non-dummy load and each load’s associated ordinal rank (1 to 10) against other loads on the same day; e.g., for Day1, the best rank (Rk,i = 1) is for the load with the largest surplus.
- For each day, convert carrier k’s ordinal load ranks to percentile ranks denoted θik and θjk in (1), then calculate each load’s mean across all carriers as the indices θi and θj in (2). As Figure 1 shows, respondents had these rivalry (a.k.a. desirability) indices (which range from 0 to 1) for judging how intensely they must compete for the various loads; i.e., how desirable the load is to rival carriers.
3.2. Experimental Design and Workflow
3.3. Research Respondent Selection and Behavior Experiment Controls
3.4. Performance Benchmarking
- Run the 6–7 auctions with human prices to ascertain (a) carrier k’s expected profit (i.e., the average over the 6–7 auctions) and (b) the strike prices for all shipper-carrier transactions.
- Use the empirical distribution of strike prices to calculate offer probabilities for each price Bk,i as inputs to (3) to obtain the prices that the respondent should have consistently bid to maximize carrier k’s average profit.
- Re-run the auctions with carrier k’s new prices from step 2 (the other nine respondents’ prices remaining unchanged) to confirm the optimality of the expected profit from those prices.
- Calculate each carrier’s ratio of the profit from step 1 to the profit from step 3 as the metric for gauging the gap between human respondents’ profits and optimum profits.
4. Results
4.1. Bidding Behavior Description and Rationality
4.2. Price Conformance to Theory Prediction
4.3. Human Pricing Efficacy
5. Conclusions
5.1. Research Contributions
5.2. Research Limitations and Extensions
- Our study is limited to the carrier side of spot market transactions. This limitation can be addressed by future work that answers the sort of research questions herein from the shipper side (i.e., the buyer side). To properly anchor such future work to relevant theory, guidelines can be sought, not only from this work but also from Engelbrecht-Wiggans and Katok [39]. That work, though not about truckload spot markets, studies buyer-side decisions through risk aversion and regret theories. Positioning such theoretically grounded future works in the specific domain of truckload spot markets would facilitate extensions even to works other than ours. One such work is Yan et al. [40], who modeled the shipper’s bid price optimization problem.
- We considered only one type of market for truckload transportation services. Our findings and insights, which address truckload spot market pricing behavior, can also be examined in the related freight transportation context of contract markets. That is where the reverse auction outcome for a carrier is a contract to make multiple deliveries over an extended period (e.g., over the next 6–18 months) instead of the one-off spot market delivery.
- Limitation in the type of respondent. To that end, the third research extension we propose is to build on this paper’s findings by exploring their robustness in the case of the research respondents being carrier personnel. True, the research literature has established that laboratory behavior experiments with business school students as surrogates for professional business practitioners can yield accurate predictions of those practitioners’ behavior. This holds true if, as we did, we implement the necessary methodological protocols to assure that the experiments are carefully designed and run. It would be interesting to see if the accurate practitioner behavior predictions from similar laboratory experiments in other domains hold true for our experiments in the truckload spot market domain.
- Pricing heuristic refinement. While the prescription of refined FFH is well beyond the paper’s scope of observing and understanding the FFHs that humans use, our work could be a catalyst for future work on heuristic prescription. So, our fourth proposed extension is that researchers with interests in the areas of mathematical optimization and heuristic development can explore questions such as whether it is possible to create easily implementable heuristics that come closer to the performance of mathematically optimized pricing.
- Contrast between collaborative and competitive pricing. Future research could build on our findings by replicating our comparison of human FFH with mathematical optimization in the context of inter-carrier collaboration. This could be obtained through the study of collaborative pricing behavior among humans and comparison with mathematically optimized collaborative pricing models such as what Voruganti et al. [14] presented.
Author Contributions
Funding
Data Availability Statement
Acknowledgments
Conflicts of Interest
Appendix A. Three Examples of Respondents’ Bid Pricing Logic
Example 1: A respondent with prices close to the means across all respondents |
I prioritized making sure that any route I bid for would be profitable and to have a high likelihood of winning a bid. First, I checked what day 1 loads have mean historical prices greater than my operating cost, and then did the same thing for day 2 loads (I used the median operating cost for day 2 loads, but if minimum operating cost is much lower than a load’s mean historical price, I still kept the load in mind as a tentative possibility). Among those loads, I then narrowed my focus to see which of them are good pairs between the 2 days and which were most frequent in my top 22 list. Among the loads in my top 22, the top ranked load always had a high rivalry index of at least 88%, so I priced it below the lower 98% limit, but still above my cost. I think this gives me a very good chance to get my overall top ranked two-day tour option in each auction. I did basically the same thing for my other high ranked day 1 loads that linked very well with day 2 loads: I would gradually adjust the price down to somewhere lower than the lower 98% limit but higher than my cost as long as the overall two-day profit didn’t drop far below the projected profit for my top ranked two-day tour option. I applied that logic in pricing my high ranked loads for day 2 and I base my prices on my confidence that my cost will be close to the minimum because the map shows that I won’t need to travel far from one of the day 1 loads I expect to get. For loads that were not very high in the top 22 list, I went slightly above the 98% limit (to make a profit that is on par with the other options), but still below the mean from the past, because these loads still had decent rivalry indices and I still want to be competitive. |
Example 2: A respondent with prices leaned mostly towards aggressive bidding |
I applied the following steps based on rivalry index, historical prices, and operating cost.
|
Example 3: A respondent with prices that leaned mostly towards conservative bidding |
In all three auctions, I focused a lot on the 98% limits and bid more towards the lower limit if my operational cost is low, so I could be competitive and profitable. Trying to get a very high win chance for most of my top 22 options was something I also focused on. So, the first price entries I experimented with were all below the lower 98% limit for the Day 1 and Day 2 loads in my top 22. I’ll use the first auction to explain how I then adjusted those prices. In that auction, my top two projected profits were $460 and $369, and below those, most of the top ones were high $200s to low $300s, and profits after that were very low (some low $200s and some in the $100-$150 range). Based on that, my approach was to try to have a great chance of making around $300 instead of taking a risk of losing the top ones to competitors and end up with a very low profit. So, because I didn’t want to overprice, I used trial and error to adjust the bid prices for the top loads down to levels where I am very sure that I will make a two-day profit of at least around $280–$310.For the loads that are not in my top 22, I priced at about 4-8% above my cost based on learning about the typical operating profit margins in the trucking industry. Some of the resulting prices for loads exceeded the upper 98% limit, but I wasn’t too worried because I think pricing lower would be almost like giving away my services for free to deliver loads that are not that good for my trucking company. |
References
- Lafkihi, M.; Pan, S.; Ballot, E. Freight transportation service procurement: A literature review and future research opportunities in omnichannel E-commerce. Transp. Res. Part E 2019, 125, 348–365. [Google Scholar] [CrossRef]
- Lyu, X.; Chen, H.; Wang, N.; Yang, Z. A multi-round exchange mechanism for carrier collaboration in less than truckload transportation. Transp. Re-Search Part E Logist. Transp. Rev. 2019, 129, 38–59. [Google Scholar] [CrossRef]
- Shen, L.; Hsee, C.K.; Wu, Q.; Tsai, C.I. Overpredicting and underprofiting in pricing decisions. J. Behabioral Decis. Mak. 2012, 25, 512–521. [Google Scholar] [CrossRef]
- Powell, W.B. Marginal cost pricing of truckload services: A comparison of two approaches. Transp. Res. Part B Methodol. 1985, 19, 433–445. [Google Scholar] [CrossRef]
- Skinner, W.; Maserang, D.; Caplice, C. The future of transportation rates and fuel surcharges—The shipper’s view. In Proceedings of the Annual Global Conference of the Council of Supply Chain Management Professionals, Chicago, IL, USA, 20–23 September 2009. [Google Scholar]
- Özkaya, E.; Keskinocak, P.; Joseph, V.R.; Weight, R. Estimating and benchmarking Less-than-Truckload market rates. Transp. Res. Part E 2010, 46, 667–682. [Google Scholar] [CrossRef]
- Lindsey, C.; Frei, A.; Alibabai, H.; Mahmassani, H.S.; Park, Y.; Klabjan, D.; Reed, M.; Langheim, G.; Keating, T. Modeling Carrier Truckload Freight Rates in Spot Markets. In Proceedings of the Transportation Research Board 92nd Annual Meeting, Washington, DC, USA, 13–17 January 2013. Technical Report. [Google Scholar]
- Lindsey, C.; Frei, A.; Park, Y.; Klabian, D.; Reed, M.; Langheim, G.; Keating, T. Predictive Analytics to Improve Pricing and Sourcing in Third-Party Logistics Operations. Transp. Res. Rec. J. Transp. Res. Board 2014, 2410, 123–131. [Google Scholar] [CrossRef]
- Lindsey, C.; Mahmassani, H.S. Measuring Carrier Reservation Prices for Truckload Capacity in the Transportation Spot Market: A Choice Experiment. Transp. Res. Rec. J. Transp. Res. Board 2015, 2478, 123–132. [Google Scholar] [CrossRef]
- Topaloglu, H.; Powell, W. Incorporating Pricing Decisions into the Stochastic Dynamic Fleet Management Problem. Transp. Sci. 2007, 41, 281–301. [Google Scholar] [CrossRef]
- Madden, T.; Russell, R.A. Evaluating and pricing lanes in the truckload motor freight industry. Int. J. Revenue Manag. 2009, 3, 235–251. [Google Scholar] [CrossRef]
- Kuyzu, G.; Akyol, Ç.G.; Ergun, G.Ö.; Savelsbergh, M. Bid price optimization for truckload carriers in simultaneous transportation procurement auctions. Transp. Res. Part B Methodol. 2015, 7, 34–58. [Google Scholar] [CrossRef]
- Toptal, A.; Bingöl, S.O. Transportation pricing of a truckload carrier. Eur. J. Oper. Res. 2011, 214, 559–567. [Google Scholar] [CrossRef]
- Voruganti, A.; Unnikrishnan, A.; Waller, S. Modeling carrier collaboration in freight networks. Transp. Lett. 2011, 3, 51–61. [Google Scholar] [CrossRef]
- Scott, A. Carrier Bidding Behavior in Truckload Spot Auctions. J. Bus. Logist. 2018, 39, 267–281. [Google Scholar] [CrossRef]
- Miller, J.W.; Scott, A.; Williams, B.D. Pricing Dynamics in the Truckload Sector: The Moderating Role of the Electronic Logging Device Mandate. J. Bus. Logist. 2021, 42, 388–405. [Google Scholar] [CrossRef]
- Olcaytu, E.; Kuyzu, G. Location-based distribution estimation for stochastic bid price optimization. Transp. Lett. 2021, 13, 21–35. [Google Scholar] [CrossRef]
- Olcaytu, E.; Kuyzu, G. An efficient bidding heuristic for simultaneous truckload transportation auctions. Optim. Lett. 2021, 15, 459–468. [Google Scholar] [CrossRef]
- Budak, A.; Ustandag, A.; Guloglu, B. A forecasting approach for truckload spot market pricing. Transp. Res. Part A Policy Pract. 2017, 97, 55–68. [Google Scholar] [CrossRef]
- Loomes, G.; Sugden, R. Regret theory: An alternative theory of rational choice under uncertainty. Econ. J. 1982, 92, 805–824. [Google Scholar] [CrossRef]
- Kahnemann, D.; Tversky, A. Prospect theory: An analysis of decision under risk. Econometrica 1979, 47, 263–291. [Google Scholar] [CrossRef]
- Kahneman, D.; Tversky, A. Choices, values, and frames. Am. Psychol. 1984, 39, 341–350. [Google Scholar] [CrossRef]
- Schoemaker, P.; Russo, J. Managing frames to make better decisions. In Wharton on Making Decisions; Hoch, S., Kunreuther, H., Eds.; John Wiley and Sons: New York, NY, USA, 2001. [Google Scholar]
- Soman, D. Framing, loss aversion and mental accounting. In Blackwell Handbook of Judgement and Decision Making; Koehler, D.J., Harvey, N., Eds.; Blackwell Publishing: Malden, MA, USA, 2004. [Google Scholar]
- Martignon, L.; Vitouch, O.; Takezawa, M.; Forster, M.R. Naive and yet enlightened: From natural frequencies to fast and frugal decision trees. In Heuristics: The Foundations of Adaptive Behavior; Gigerenzer, G., Hertwig, R., Pachur, T., Eds.; Online Edn; Oxford Academic: Oxford, UK, 1 May 2011. [Google Scholar] [CrossRef]
- Shan, Y.; Yang, L. Fast and frugal heuristics and naturalistic decision making: A review of their commonalities and differences. Think. Reason. 2017, 23, 10–32. [Google Scholar] [CrossRef]
- Vargas, F.; Martignon, L.; Stenning, K. Bounded rationality: From fast and frugal heuristics to logic programming and back. Mind Soc. 2023, 22, 33–51. [Google Scholar] [CrossRef]
- MacGregor, J.N.; Chronicle, E.P.; Ormerod, T.C. A Comparison of Heuristic and Human Performance on Open Versions of the Traveling Salesperson Problem. J. Probl. Solving 2006, 1, 5. [Google Scholar] [CrossRef]
- Chronicle, E.P.; MacGregor, J.N.; Ormerod, T.C.; Burr, A. It looks easy! Heuristics for combinatorial optimization problems. Q. J. Exp. Psychol. 2006, 59, 783–800. [Google Scholar] [CrossRef] [PubMed]
- Kefalidou, G.; Ormerod, T.C. The Fast and the Not-So-Frugal: Human Heuristics for Optimization Problem Solving. In Proceedings of the Annual Meeting of the Cognitive Science Society, Quebec City, QC, Canada, 23–26 July 2014; Volume 36. Available online: https://escholarship.org/uc/item/616016t3 (accessed on 1 February 2021).
- Fontaine, P.; Taube, F.; Minner, S. Human solution strategies for the vehicle routing problem: Experimental findings and a choice-based theory. Comput. Oper. Res. 2020, 120, 104962. [Google Scholar] [CrossRef]
- Zolfagharinia, H.; Haughton, M. Effective truckload dispatch decision methods with incomplete advance load information. Eur. J. Oper. Res. 2016, 252, 103–121. [Google Scholar] [CrossRef]
- Drichoutis, A.C.; Nayga, R.M.; Lazaridis, P. The Role of Training in Experimental Auctions. Am. J. Agric. Econ. 2011, 93, 521–527. [Google Scholar] [CrossRef]
- Mir, S.; Aloysius, J.A.; Eckerd, S. Understanding Supplier Switching Behavior: The Role of Psychological Contracts in a Competitive Setting. J. Supply Chain Manag. 2016, 53, 3–18. [Google Scholar] [CrossRef]
- Moritz, B.B.; Hill, A.V.; Donohue, K.L. Individual differences in the newsvendor problem: Behavior and cognitive reflection. J. Oper. Manag. 2013, 31, 72–85. [Google Scholar] [CrossRef]
- Ball, S.B.; Cech, P. Subject pool choice and treatment effects in economic laboratory research. Exp. Econ. 1996, 6, 239–292. [Google Scholar]
- Plott, C. Dimensions of parallelism: Some policy applications of experimental methods. In Experimental Economics: Six Points of View; Roth, A., Ed.; Cambridge University Press: New York, NY, USA, 1987; pp. 193–232. [Google Scholar]
- Katok, E.; Thomas, D.; Davis, A. Inventory service level agreements as coordination mechanisms: The effect of review periods. Manuf. Serv. Oper. Manag. 2008, 10, 609–624. [Google Scholar] [CrossRef]
- Engelbrecht-Wiggans, R.; Katok, E. A Direct Test of Risk Aversion and Regret in First Price Sealed-Bid Auction. Decis. Anal. 2009, 6, 75–86. [Google Scholar] [CrossRef]
- Yan, F.; Xu, M.; Ma, Y.; Yu, H. Price optimization for transportation service procurement with fuzzy random shipments: From shipper’s perspective. Transp. Lett. 2017, 9, 258–275. [Google Scholar] [CrossRef]
Research Area | |||
---|---|---|---|
Spot pricing of trucking services | Pricing behavior theories | Human FFH performance | |
A sample of the most closely related papers | Lindsey et al. [8] Lindsey and Mahmassani [9] Kuyzu et al. [12] Olcaytu and Kuyzu [17,18] | Kahnemann and Tversky [21,22] Schoemaker and Russo [23] Soman [24] | MacGregor et al. [28] Chronicle et al. [29] Kefalidou and Omerod [30] Fontaine et al. [31] |
Main outcomes from past papers | Models to predict and optimize bid prices | Theoretical explanations for human pricing behavior | Performance of human FFHs versus optimization methods |
Some key gaps in the literature | No past work examines human behavior behind bid prices | Theories untested in reverse auctions for transportation services | There is no FFH performance analysis in the freight spot market domain |
This paper’s major proposed improvements | Research objective 1 Examines the logic/rationality of FFHs that humans use in pricing | Research objective 2 Determines which theories align best with humans’ FFH-based pricing | Research objective 3 Measures profits from humans’ FFH pricing vis-à-vis profit from pricing optimization models |
Each cell Shows the 10 Competing Research Respondents [RR] across the 10 Carrier Positions | ||||
---|---|---|---|---|
Carrier Position | Replicate 1 [7 Auction Competitions] | Replicate 2 [7 Competitions] | Replicate 3 [7 Competitions] | Replicate 4 [6 Competitions] |
1–10 | 1: RRs #1–#10 | 1: RRs #1–#10 | 1: RRs #1–#10 | |
1–10 | 2: RRs #11–#20 | 2: RRs #11–#20 | 1: RRs #11–#20 | |
1–10 | 2: RRs #21–#30 | 3: RRs #21–#30 | 2: RRs #21–#30 | |
1–10 | 3: RRs #31–#40 | 3: RRs #31–#40 | 3: RRs #31–#40 | |
1–10 | 4: RRs #41–#50 | 4: RRs #41–#50 | 4: RRs #41–#50 | |
1–10 | 5: RRs #51–#60 | 5: RRs #51–#60 | 4: RRs #51–#60 | |
1–10 | 5: RRs #61–#70 | 6: RRs #61–#70 | 5: RRs #61–#70 | |
1–10 | 6: RRs #71–#80 | 6: RRs #71–#80 | 6: RRs #71–#80 | |
1–6 7–10 | 7: RRs #81–#86 RRs #7–#10 * | 7: RRs #81–#86 RRs #7–#10 * | 7: RRs #81–#86 RRs #7–#10 * |
Profit Metric | |||
---|---|---|---|
Bid pricing approach | Overall mean profit as % of optimal mean 1 | Profit exceeded by bidders 95% of the time 2 | Probability of a single auction profit exceeding 83% of the optimal mean |
Research respondents’ observed behavior | 74% [0.25] | 38% | Probability (≥83%) = 0.45 |
Always conservative: Equation (4) prices | 87% [0.12] | 72% | Probability (≥83%) = 0.59 |
Optimization [the benchmark] | 100% [0.11] | 83% | Probability (≥83%) = 0.95 |
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).
Share and Cite
Haughton, M.; Amini, A. An Examination of Human Fast and Frugal Heuristic Decisions for Truckload Spot Pricing. Logistics 2024, 8, 72. https://doi.org/10.3390/logistics8030072
Haughton M, Amini A. An Examination of Human Fast and Frugal Heuristic Decisions for Truckload Spot Pricing. Logistics. 2024; 8(3):72. https://doi.org/10.3390/logistics8030072
Chicago/Turabian StyleHaughton, Michael, and Alireza Amini. 2024. "An Examination of Human Fast and Frugal Heuristic Decisions for Truckload Spot Pricing" Logistics 8, no. 3: 72. https://doi.org/10.3390/logistics8030072
APA StyleHaughton, M., & Amini, A. (2024). An Examination of Human Fast and Frugal Heuristic Decisions for Truckload Spot Pricing. Logistics, 8(3), 72. https://doi.org/10.3390/logistics8030072