IDEAS home Printed from https://ideas.repec.org/a/inm/orserv/v9y2017i4p324-337.html
   My bibliography  Save this article

An Optimization Web Service for a Freight Brokering System

Author

Listed:
  • Florin Leon

    (Technical University “Gheorghe Asachi” of Iaşi, Iaşi 700050, Romania)

  • Costin Bădică

    (University of Craiova, Craiova 200585, Romania)

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.

Suggested Citation

  • Florin Leon & Costin Bădică, 2017. "An Optimization Web Service for a Freight Brokering System," Service Science, INFORMS, vol. 9(4), pages 324-337, December.
    • Handle: RePEc:inm:orserv:v:9:y:2017:i:4:p:324-337
    DOI: 10.1287/serv.2017.0191
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/serv.2017.0191
    Download Restriction: no
    File URL: https://libkey.io/10.1287/serv.2017.0191?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Michael Held & Richard M. Karp, 1970. "The Traveling-Salesman Problem and Minimum Spanning Trees," Operations Research, INFORMS, vol. 18(6), pages 1138-1162, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jaroslaw Witkowski & Jakub Marcinkowski & Maja Kiba-Janiak, 2020. "A Comparative Analysis of Electronic Freight Exchanges in the United States and Europe with the Use of the Multiple Criteria Decision-Making Method “Promethee”," European Research Studies Journal, European Research Studies Journal, vol. 0(Special 1), pages 476-487.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ibrahim Muter & Tevfik Aytekin, 2017. "Incorporating Aggregate Diversity in Recommender Systems Using Scalable Optimization Approaches," INFORMS Journal on Computing, INFORMS, vol. 29(3), pages 405-421, August.
    2. Rostami, Borzou & Malucelli, Federico & Belotti, Pietro & Gualandi, Stefano, 2016. "Lower bounding procedure for the asymmetric quadratic traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 253(3), pages 584-592.
    3. Martinhon, Carlos & Lucena, Abilio & Maculan, Nelson, 2004. "Stronger K-tree relaxations for the vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 158(1), pages 56-71, October.
    4. Ghosh, Diptesh & Sumanta Basu, 2011. "Diversified Local Search for the Traveling Salesman Problem," IIMA Working Papers WP2011-01-03, Indian Institute of Management Ahmedabad, Research and Publication Department.
    5. Kouhei Harada, 2021. "A Feasibility-Ensured Lagrangian Heuristic for General Decomposable Problems," SN Operations Research Forum, Springer, vol. 2(4), pages 1-26, December.
    6. Yao, Yu & Zhu, Xiaoning & Dong, Hongyu & Wu, Shengnan & Wu, Hailong & Carol Tong, Lu & Zhou, Xuesong, 2019. "ADMM-based problem decomposition scheme for vehicle routing problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 129(C), pages 156-174.
    7. Horbach, Andrei, 2005. "Combinatorial relaxation of the k-traveling salesman problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 599, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    8. Peter Reiter & Walter Gutjahr, 2012. "Exact hybrid algorithms for solving a bi-objective vehicle routing problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 20(1), pages 19-43, March.
    9. Rathinam, Sivakumar & Sengupta, Raja, 2006. "Matroid Intersection and its application to a Multiple Depot, Multiple TSP," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt9sj6585p, Institute of Transportation Studies, UC Berkeley.
    10. Marcel Turkensteen & Dmitry Malyshev & Boris Goldengorin & Panos M. Pardalos, 2017. "The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems," Journal of Global Optimization, Springer, vol. 68(3), pages 601-622, July.
    11. Igor Litvinchev & Socorro Rangel & Jania Saucedo, 2010. "A Lagrangian bound for many-to-many assignment problems," Journal of Combinatorial Optimization, Springer, vol. 19(3), pages 241-257, April.
    12. Fatemeh Keshavarz-Ghorbani & Seyed Hamid Reza Pasandideh, 2022. "A Lagrangian relaxation algorithm for optimizing a bi-objective agro-supply chain model considering CO2 emissions," Annals of Operations Research, Springer, vol. 314(2), pages 497-527, July.
    13. Shawn Choo & Diego Klabjan & David Simchi-Levi, 2010. "Multiship Crane Sequencing with Yard Congestion Constraints," Transportation Science, INFORMS, vol. 44(1), pages 98-115, February.
    14. Zamani, Reza & Lau, Sim Kim, 2010. "Embedding learning capability in Lagrangean relaxation: An application to the travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 201(1), pages 82-88, February.
    15. Shengbin Wang & Weizhen Rao & Yuan Hong, 2020. "A distance matrix based algorithm for solving the traveling salesman problem," Operational Research, Springer, vol. 20(3), pages 1505-1542, September.
    16. Steeger, Gregory & Rebennack, Steffen, 2017. "Dynamic convexification within nested Benders decomposition using Lagrangian relaxation: An application to the strategic bidding problem," European Journal of Operational Research, Elsevier, vol. 257(2), pages 669-686.
    17. Freville, Arnaud, 2004. "The multidimensional 0-1 knapsack problem: An overview," European Journal of Operational Research, Elsevier, vol. 155(1), pages 1-21, May.
    18. Thomas L. Magnanti, 2021. "Optimization: From Its Inception," Management Science, INFORMS, vol. 67(9), pages 5349-5363, September.
    19. Kinable, Joris & Cire, Andre A. & van Hoeve, Willem-Jan, 2017. "Hybrid optimization methods for time-dependent sequencing problems," European Journal of Operational Research, Elsevier, vol. 259(3), pages 887-897.
    20. Marshall L. Fisher, 2004. "Comments on ÜThe Lagrangian Relaxation Method for Solving Integer Programming ProblemsÝ," Management Science, INFORMS, vol. 50(12_supple), pages 1872-1874, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:orserv:v:9:y:2017:i:4:p:324-337. See general information about how to correct material in RePEc.

    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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.