Processing, Please wait...

  • Publisher Home
  • Home
  • 🔙 Back
  • 📚 Journals
    • ⚙️ IJIEC - Industrial Engineering Computations
    • 🌐 IJDNS - Data and Network Science
    • 🧪 CCL - Current Chemistry Letters
    • 💹 AC - Accounting
    • 🎯 DSL - Decision Science Letters
    • 🚛 USCM - Uncertain Supply Chain Management
    • 🏗️ JPM - Journal of Project Management
    • 🏥 HE - Healthcare Engineering
    • 📈 SCI - Scientometrica
    • 🔩 ESM - Engineering Solid Mechanics
    • 🌿 JFS - Journal of Future Sustainability
    • 💼 MSL - Management Science Letters
  • 📝 Submit Article
  • 📊 Statistics
  • 📋 About
    • 📄 About Us
    • 📰 Blog
    • 📢 News
    • 📧 Contact
  • 📺 Tutorial
  • Search:
  • Advanced Search

Growing Science » International Journal of Industrial Engineering Computations » The bid generation problem in combinatorial auctions for transportation service procurement

⭐ Highly Cited Articles

  • Jaya Algorithm
  • Rao Algorithm
  • TLBO Algorithm
  • ChatGPT and Blended Learning

Journals

  • IJIEC (840)
  • IJDS (1032)
  • DSL (759)
  • ESM (434)
  • CCL (563)
  • JPM (350)
  • AC (572)
  • JFS (106)
  • MSL (2658)
  • USCM (1104)
  • HE (56)
  • SCI (53)

IJIEC Volumes

    • ▼ Volume 17 (113)
      • Issue 1 (21)
      • Issue 2 (30)
      • Issue 3 (26)
      • Issue 4 (36)
    • ▼ Volume 16 (75)
      • Issue 1 (12)
      • Issue 2 (15)
      • Issue 3 (19)
      • Issue 4 (29)
    • ▼ Volume 15 (55)
      • Issue 1 (19)
      • Issue 2 (15)
      • Issue 3 (12)
      • Issue 4 (9)
    • ▼ Volume 14 (50)
      • Issue 1 (11)
      • Issue 2 (15)
      • Issue 3 (9)
      • Issue 4 (15)
    • ▼ Volume 13 (41)
      • Issue 1 (10)
      • Issue 2 (8)
      • Issue 3 (10)
      • Issue 4 (13)
    • ▼ Volume 12 (29)
      • Issue 1 (9)
      • Issue 2 (6)
      • Issue 3 (8)
      • Issue 4 (6)
    • ▼ Volume 11 (36)
      • Issue 1 (9)
      • Issue 2 (8)
      • Issue 3 (9)
      • Issue 4 (10)
    • ▼ Volume 10 (34)
      • Issue 1 (8)
      • Issue 2 (10)
      • Issue 3 (8)
      • Issue 4 (8)
    • ▼ Volume 9 (32)
      • Issue 1 (9)
      • Issue 2 (6)
      • Issue 3 (7)
      • Issue 4 (10)
    • ▼ Volume 8 (30)
      • Issue 1 (9)
      • Issue 2 (7)
      • Issue 3 (8)
      • Issue 4 (6)
    • ▼ Volume 7 (47)
      • Issue 1 (10)
      • Issue 2 (14)
      • Issue 3 (10)
      • Issue 4 (13)
    • ▼ Volume 6 (39)
      • Issue 1 (7)
      • Issue 2 (12)
      • Issue 3 (10)
      • Issue 4 (10)
    • ▼ Volume 5 (47)
      • Issue 1 (13)
      • Issue 2 (12)
      • Issue 3 (12)
      • Issue 4 (10)
    • ▼ Volume 4 (50)
      • Issue 1 (14)
      • Issue 2 (10)
      • Issue 3 (12)
      • Issue 4 (14)
    • ▼ Volume 3 (77)
      • Issue 1 (10)
      • Issue 2 (15)
      • Issue 3 (20)
      • Issue 4 (12)
      • Issue 5 (20)
    • ▼ Volume 2 (68)
      • Issue 1 (12)
      • Issue 2 (20)
      • Issue 3 (20)
      • Issue 4 (16)
    • ▼ Volume 1 (17)
      • Issue 1 (9)
      • Issue 2 (8)

🔑 Keywords

Jordan(175)
Supply chain management(172)
Vietnam(154)
Customer satisfaction(124)
Performance(117)
Supply chain(115)
Artificial intelligence(108)
Service quality(101)
Competitive advantage(100)
SMEs(95)
Tehran Stock Exchange(94)
Sustainability(94)
optimization(88)
Financial performance(86)
TOPSIS(85)
Trust(85)
Organizational performance(81)
Job satisfaction(81)
Genetic Algorithm(81)
Social media(80)


» Show all keywords

✍️ Authors

Naser Azad(82)
Zeplin Jiwa Husada Tarigan(70)
Mohammad Reza Iravani(65)
Endri Endri(45)
Hotlan Siagian(43)
Muhammad Alshurideh(42)
Dmaithan Almajali(39)
Jumadil Saputra(37)
Muhammad Turki Alshurideh(35)
Ahmad Makui(33)
Sautma Ronni Basana(33)
Barween Al Kurdi(32)
Basrowi Basrowi(31)
Mohammad Khodaei Valahzaghard(30)
Haitham M. Alzoubi(30)
Ni Nyoman Kerti Yasa(30)
Hassan Ghodrati(30)
Shankar Chakraborty(29)
Sulieman Ibraheem Shelash Al-Hawary(28)
Mahmoud Allahham(28)


» Show all authors

🌍 Countries

1. Algeria (52)
2. Angola (2)
3. Argentina (22)
4. Armenia (2)
5. Australia (52)
6. Austria (2)
7. Bahrain (26)
8. Bangladesh (58)
9. Belarus (4)
10. Belgium (3)
11. Benin (2)
12. Benin Republic (1)
13. Bhutan (1)
14. Bosnia and Herzegovina (1)
15. Botswana (9)
16. Brazil (40)
17. Brunei (1)
18. Bulgaria (1)
19. Burkina Faso (1)
20. Cameroon (1)
Total: 121 countries

Show all countries
International Journal of Industrial Engineering Computations
ISSN 1923-2934 (Online) - ISSN 1923-2926 (Print)
Quarterly Publication
Volume 14 Issue 3 pp. 511-522, 2023

The bid generation problem in combinatorial auctions for transportation service procurement Pages 511-522 PDF Download PDF

Authors: Fang Yang, Sheng-Zhu Li, Yao-Huei Huang

📋 Author Affiliations:
Fang Yang ORCID 1, Sheng-Zhu Li ORCID 2, Yao-Huei Huang ORCID 3
1 School of Economics and Management, Chongqing University of Posts and Telecommunications, Chongqing, 400065, China
2 Chongqing University of Posts and Telecommunications E-commerce and Modern Logistics, Municipal Key Laboratory Postdoctoral Research Workstation, Chongqing, 400065, China
3 Department of Information Management, Fu Jen Catholic University, New Taipei City, Taiwan, N/A
doi 10.5267/j.ijiec.2023.4.003
2 Source: Scopus
Crossref 1 Source: CrossRef

🔑 Keywords: Combinatorial auctions, Bid generation problem, Vehicle routing, Multidigraph

Abstract: In this work, a probabilistic bid generation problem with the pricing of a bundle of lanes and carrier’s vehicle routing is considered as it is an importation in transportation service procurement. Depending on the network of the vehicle, there exist multiple lanes for traveling between two locations. To solve the bid generation problem efficiently, a two-phase method approach is presented. At the core of the procedure a feasible vehicle routing problem on a multidigraph is solved by an exhaustive search algorithm to enumerate all routes concerning routing constraints and treat each route as a decision variable in the set partitioning formulation. We examine our model both analytically and empirically using a simulation-based analysis.

How to cite this paper
APA: Yang, F., Li, S & Huang, Y. (2023). The bid generation problem in combinatorial auctions for transportation service procurement. International Journal of Industrial Engineering Computations, 14(3), 511-522.
Chicago/Turabian: Yang, F., Li, S & Huang, Y. 2023. "The bid generation problem in combinatorial auctions for transportation service procurement." International Journal of Industrial Engineering Computations 14, no. 3 (2023): 511-522.
AMA: Yang, F., Li, S & Huang, Y. The bid generation problem in combinatorial auctions for transportation service procurement. International Journal of Industrial Engineering Computations. 2023;14(3):511-522.

References
An, N., Elmaghraby, W., & Keskinocak, P. (2005). Bidding strategies and their impact on revenues in combinatorial auctions. Journal of Revenue and Pricing Management, 3(4), 337-357.
Caplice, C. (2007). Electronic markets for truckload transportation. Production and Operations Management, 16(4), 423-436.
Caplice, C., & Sheffi, Y. (2003). Optimization-based procurement for transportation services. Journal of Business Logistics, 24(2), 109-128.
Chang, T. S. (2009). Decision support for truckload carriers in one-shot combinatorial auctions. Transportation Research Part B: Methodological, 43(5), 522-541.
Garaix, T., Artigues, C., Feillet, D., & Josselin, D. (2010). Vehicle routing problems with alter- native paths: An application to on-demand transportation. European Journal of Operational Research, 204(1), 62-75.
Goldsby, T. J., & Eckert, J. A. (2003). Electronic transportation marketplaces: a transaction cost perspective. Industrial Marketing Management, 32(3), 187-198.
Guo, Y., Lim, A., Rodrigues, B., & Zhu, Y. (2006). Carrier assignment models in transportation procurement. Journal of the Operational Research Society, 57(12), 1472-1481.
Hammami, F., Rekik, M., & Coelho, L. 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, 127, 150-177.
Hammami, F., Rekik, M., & Coelho, L. 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, 149, 204-229.
Kuyzu, G., Akyol, Ç. G., Ergun, Ö., & Savelsbergh, M. (2015). Bid price optimization for truckload carriers in simultaneous transportation procurement auctions. Transportation Research Part B: Methodological, 73, 34-58.
Ledyard, J. O., Olson, M., Porter, D., Swanson, J. A., & Torma, D. P. (2002). The first use of a combined-value auction for transportation services. Interfaces, 32(5), 4-12.
Lee, C.-G., Kwon, R. H., & Ma, Z. (2007). A carrier’s optimal bid generation problem in combinatorial auctions for transportation procurement. Transportation Research Part E: Logistics and Transportation Review, 43(2), 173-191.
Lucking, R., D. (1999). Using field experiments to test equivalence between auction formats: Magic on the internet. American Economic Review, 89(5), 1063-1080.
Olcaytu, E., & Kuyzu, G. (2018). Synergy-based bidding method for simultaneous freight transportation auctions. Transportation research procedia, 30, 295-303.
Reinhardt, L. B., Jepsen, M. K., & Pisinger, D. (2016). The edge set cost of the vehicle routing problem with time windows. Transportation Science, 50(2), 694-707.
Sheffi, Y. (2004). Combinatorial auctions in the procurement of transportation services. Interfaces, 34(4), 245–252.
Song, J., & Regan, A. (2003). Combinatorial auctions for transportation service procurement: The carrier perspective. Transportation Research Record, 1833(1), 40-46.
Song, J., & Regan, A. (2005). Approximation algorithms for the bid construction problem in combinatorial auctions for the procurement of freight transportation contracts. Transportation Research Part B: Methodological, 39(10), 914-933.
Soriano, A., Vidal, T., Gansterer, M., & Doerner, K. (2020). The vehicle routing problem with arrival time diversification on a multigraph. European Journal of Operational Research, 286(2), 564-575.
Ticha, H. B., Absi, N., Feillet, D., & Quilliot, A. (2017). Empirical analysis for the VRPTW with a multigraph representation for the road network. Computers & Operations Research, 88, 103-116.
Tikani, H., & Setak, M. (2019). Efficient solution algorithms for a time-critical reliable transportation problem in multigraph networks with fifo property. Applied Soft Computing, 74, 504-528.
Tikani, H., Setak, M., & Demir, E. (2021). A risk-constrained time-dependent cash-in-transit routing problem in multigraph under uncertainty. European Journal of Operational Research, 293(2), 703-730.
Triki, C. (2016). Location-based techniques for the synergy approximation in combinatorial transportation auctions. Optimization Letters, 10(5), 1125-1139.
Triki, C., Oprea, S., Beraldi, P., & Crainic, T. G. (2014). The stochastic bid generation problem in combinatorial transportation auctions. European Journal of Operational Research, 236(3), 991-999.
Wang, X., & Xia, M. (2005). Combinatorial bid generation problem for transportation service procurement. Transportation research record, 1923(1), 189-198.
  • 17
  • 1
  • 2
  • 3
  • 4
  • 5

📚 Journal: International Journal of Industrial Engineering Computations | 📅 Year: 2023 | 📖 Volume: 14 | 📄 Issue: 3 | 👁️ Views: 2446 | 📊 Crossref: 1

Related Articles:
  • A mixed-integer linear programming model for the selective full-truckload multi-depot vehicle routing problem with time windows
  • Time-dependent vehicle routing problem with backhaul with FIFO assumption: Variable neighborhood search and mat-heuristic variable neighborhood search algorithms
  • Solving the collaborative bidirectional multi-period vehicle routing problems under a profit-sharing agreement using a covering model
  • Variable neighborhood search algorithm for the green vehicle routing problem
  • Pricing for freight carriers in a competitive environment: A game theory approach

📝 Ready to share your research?

International Journal of Industrial Engineering Computations is accepting new submissions for upcoming issues. Join our community of authors and publish your work with us.

✓ Open access
✓ Rigorous peer review
✓ Fast publication
📤 Submit Your Manuscript →

📖 Author Guidelines

® 2010-2026 GrowingScience.Com