Welcome to the InfoSci Platform
Reference Hub2
A Heuristic Algorithm for Optimizing Business Matchmaking Scheduling

A Heuristic Algorithm for Optimizing Business Matchmaking Scheduling

Yingping Huang, Xihui Zhang, Paulette S. Alexander
Copyright: © 2012 |Volume: 3 |Issue: 4 |Pages: 15
ISSN: 1947-9328|EISSN: 1947-9336|EISBN13: 9781466613843|DOI: 10.4018/joris.2012100104
Cite Article Cite Article

MLA

Huang, Yingping, et al. "A Heuristic Algorithm for Optimizing Business Matchmaking Scheduling." IJORIS vol.3, no.4 2012: pp.59-73. http://doi.org/10.4018/joris.2012100104

APA

Huang, Y., Zhang, X., & Alexander, P. S. (2012). A Heuristic Algorithm for Optimizing Business Matchmaking Scheduling. International Journal of Operations Research and Information Systems (IJORIS), 3(4), 59-73. http://doi.org/10.4018/joris.2012100104

Chicago

Huang, Yingping, Xihui Zhang, and Paulette S. Alexander. "A Heuristic Algorithm for Optimizing Business Matchmaking Scheduling," International Journal of Operations Research and Information Systems (IJORIS) 3, no.4: 59-73. http://doi.org/10.4018/joris.2012100104

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Business matchmaking is a service dedicated to providing one-on-one appointments for small businesses (or sellers) to meet with government agencies and large corporations (or buyers) for contracting opportunities. Business matchmaking scheduling seeks to maximize the total number of appointments with the maximum objective that weighs the preferences of both buyers and sellers. In this paper, the authors transformed the business matchmaking scheduling problem into a 3-dimensional planar assignment problem and solved it heuristically using a series of bipartite maximum weighted maximum cardinality matching problems. Simulation experiments and real data showed that this algorithm outperforms human experts and prior algorithm in terms of number of appointments, the objective that weighs buyer and seller’s preferences, and the execution time.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.