An Optimization Web Service for a Freight Brokering System

Florin Leon () and Costin Bădică ()
Additional contact information
Florin Leon: Technical University “Gheorghe Asachi” of Iaşi, Iaşi 700050, Romania
Costin Bădică: University of Craiova, Craiova 200585, Romania

Service Science, 2017, vol. 9, issue 4, 324-337

Abstract: Freight brokering is a real-life business problem that attempts to match the logistic capabilities of transportation providers with the needs of merchandise owners. From a service science perspective, the clients and transporters interacting through the matchmaking system create mutual value by minimizing client costs, maximizing business opportunities, increasing competition, and reducing operational risks. A general architecture of such a system is presented, which combines web services and agents in order to benefit from the advantages of both approaches: on the one hand interoperability and flexibility in heterogeneous systems, and on the other hand autonomy and the ability to represent the interests of particular users. The matchmaking is treated as an optimization problem solved with the help of a separate web service, and special emphasis is given to the details of the optimization mechanism.

Keywords: web services; agents; optimization; evolutionary algorithms; software architecture; freight brokering (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://doi.org/10.1287/serv.2017.0191 (application/pdf)

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:inm:orserv:v:9:y:2017:i:4:p:324-337

Access Statistics for this article

More articles in Service Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().