Skip to main content
Springer Nature Link
Log in

Freight transportation broker agent based on constraint logic programming

  • Original Paper
  • Published:
Evolving Systems Aims and scope Submit manuscript

Abstract

We propose an agent-based freight brokering system that provides an intelligent logistics brokerage service focusing on the transport activity for the efficient allocation of transport resources (vehicles or trucks) to the transport applications. The freight broker has the role to coordinate transportation arrangements of transport customers with transport resource providers. In this paper we focus on the fundamental function of this business that aims to find available trucks and to define their feasible routes for transporting requested customer loads. Our main achievement is the proposal of a knowledge-based freight broker based on agents and constraint programming. We describe the multi-agent architecture and the interaction protocol of the freight broker. The brokering function is defined as a special type of vehicle routing with pickup and delivery problem. This function is achieved by proposing an optimization agent based on constraint logic programming. We present in detail our novel declarative optimization model, as well as the components of the optimization agent. This model was implemented and evaluated using the state-of-the-art ECLiPSe-CLP engine. The experimental results that we obtained for sample benchmark problems are promising and they support the effectiveness of our approach in a practical setting.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Notes

  1. The ECLiPSe Constraint Programming System, http://eclipseclp.org/.

References

  • Agresti A, Coull BA (1998) Approximate is better than “exact” for interval estimation of binomial proportions. Am Stat 52(2):119–126. https://doi.org/10.1080/00031305.1998.10480550

  • Backer BD, Furnon V, Shaw P, Kilby P, Prosser P (2000) Solving vehicle routing problems using constraint programming and metaheuristics. J Heuristics 6(4):501–523. https://doi.org/10.1023/A:1009621410177

    Article  MATH  Google Scholar 

  • Bădică A, Bădică C (2011) FSP and FLTL framework for specification and verification of middle-agents. Appl Math Comput Sci 21(1):9–25. https://doi.org/10.2478/v10006-011-0001-6

  • Bădică A, Bădică C, Leon F, Buligiu I (2018) Modeling and optimization of pickup and delivery problem using constraint logic programming. In: Lirkov I, Margenov S (eds) Proceedings of the 11th International Conference on Large-Scale Scientific Computing, LSSC 2017, Lecture Notes in Computer Science, vol 10665. Springer, pp 324–332. https://doi.org/10.1007/978-3-319-73441-5-34

  • Bădică A, Bădică C, Leon F, Danciulescu D (2017) Optimization of freight transportation brokerage using agents and constraints. In: Boracchi G, Iliadis LS, Jayne C, Likas A (eds) Proceedings of the 18th International Conference on Engineering Applications of Neural Networks, EANN 2017, Communications in Computer and Information Science, vol 744. Springer, pp 451–464. https://doi.org/10.1007/978-3-319-65172-9-38

  • Bădică A, Bădică C, Leon F, Luncean L (2017) Declarative representation and solution of vehicle routing with pickup and delivery problem. In: Koumoutsakos P, Lees M, Krzhizhanovskaya VV, Dongarra JJ, Sloot PMA (eds) Proceedings of the International Conference on Computational Science, ICCS 2017, Procedia Computer Science, vol 108. Elsevier, pp 958–967. https://doi.org/10.1016/j.procs.2017.05.261

  • Barnier N, Brisset P (1998) Optimization by hybridization of a genetic algorithm with constraint satisfaction techniques. In: Proc. IEEE International Conference on Evolutionary Computation 1998, IEEE World Congress on Computational Intelligence, pp 645–649. IEEE. https://doi.org/10.1109/ICEC.1998.700115

  • Bordini RH, Hübner JF, Wooldridge M (2007) Programming multi-agent systems in agentspeak using Jason. Wiley Series in Agent Technology. Wiley

  • Dovier A, Formisano A, Pontelli E (2005) A comparison of clp(fd) and asp solutions to np-complete problems. In: Gabbrielli M, Gupta G (eds) Logic programming: Proc. 21st International Conference, ICLP 2005, Lecture Notes in Computer Science, vol 3668. Springer, Berlin Heidelberg, pp 67–82. https://doi.org/10.1007/11562931-8

  • Gavanelli M, Rossi F (2010) Constraint logic programming. In: Dovier A, Pontelli E (eds) A 25-year perspective on logic programming: achievements of the Italian association for logic programming, GULP, Lecture Notes in Computer Science, vol 6125. Springer, Berlin Heidelberg, pp 64–86. https://doi.org/10.1007/978-3-642-14309-0-4

  • Gouidis F, Patkos T, Flouris G, Plexousakis D (2014) Declarative reasoning approaches for agent coordination. In: Likas A, Blekas K, Kalles D (eds) Artificial intelligence: methods and applications, Lecture Notes in Computer Science, vol 8445. Springer International Publishing, pp 489–503. https://doi.org/10.1007/978-3-319-07064-3-42

  • Harvey WD, Ginsberg ML (1995) Limited discrepancy search. In: Proceedings of the 14th International Joint Conference on Artificial Intelligence—vol 1, IJCAI’95. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, pp 607–613. http://ijcai.org/Proceedings/95-1/Papers/080.pdf

  • Hölldobler S, Manthey N, Steinke P (2012) A compact encoding of pseudo-boolean constraints into sat. In: Advances in Artificial Intelligence: Proc. 35th Annual German Conference on AI—KI 2012, Lecture Notes in Computer Science, vol 7526. Springer, pp 107–118. https://doi.org/10.1007/978-3-642-33347-7-10

  • Leon F, Bădică C (2017) An optimization web service for a freight brokering system. Ser Sci 9(4):324–337. https://doi.org/10.1287/serv.2017.0191

  • Luncean L, Bădică C, Bădică A (2014) Agent-based system for brokering of logistics services—initial report. In: Nguyen NT, Attachoo B, Trawinski B, Somboonviwat K(eds) Proceedings of the 6th Asian Conference on Intelligent Information and Database Systems, ACIIDS 2014, Part II, Lecture Notes in Computer Science, vol. 8398. Springer, pp 485–494. https://doi.org/10.1007/978-3-319-05458-2-50

  • Mahmoudi M, Zhou X (2016) Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: a dynamic programming approach based on statespacetime network representations. Transport Res Part B Methodol 89:19–42. https://doi.org/10.1016/j.trb.2016.03.009

    Article  Google Scholar 

  • Marriott K, Stuckey PJ, Wallace M (2006) Constraint logic programming. In: Rossi F, van Beek P, Walsh T (eds) Handbook of constraint programming. foundations of artificial intelligence 2. Elsevier, pp 407–450

  • Munari P, Dollevoet T, Spliet R (2016) A generalized formulation for vehicle routing problems. ArXiv e-prints. http://adsabs.harvard.edu/abs/2016arXiv160601935M

  • Niederliński A (2014) A gentle guide to constraint logic programming via ECLiPSe, 3rd edn. Jacek Skalmierski Computer Studio, Gliwice

    Google Scholar 

  • Parragh SN, Doerner KF, Hartl RF (2008) A survey on pickup and delivery problems. part ii: Transportation between pickup and delivery locations. J Für Betriebswirtschaft 58(2):81–117. https://doi.org/10.1007/s11301-008-0036-4

  • Parsons S, Rodriguez-Aguilar JA, Klein M (2011) Auctions and bidding: a guide for computer scientists. ACM Comput Surv 43(2):10:1–10:59. https://doi.org/10.1145/1883612.1883617

  • Rao AS (1996) Agentspeak(l): Bdi agents speak out in a logical computable language. In: Van de Velde W, Perram JW (eds) Agents breaking away: Proc. of the 7th European Workshop on Modelling Autonomous Agents in a Multi-Agent World, MAAMAW ’96, Lecture Notes in Computer Science, vol 1038. Springer, pp 42–55. https://doi.org/10.1007/BFb0031845

  • Schimpf J (2002) Logical loops. In: Stuckey PJ (ed) Proceedings of the 18th International Conference onLogic Programming. ICLP 2002, Lecture Notes in Computer Science, vol 2401. Springer, Berlin Heidelberg, pp 224–238. https://doi.org/10.1007/3-540-45619-8-16

  • Schimpf J, Shen K (2012) Eclipse—from lp to clp. Theory Pract Logic Program 12(1–2):127–156. https://doi.org/10.1017/S1471068411000469

    Article  MathSciNet  MATH  Google Scholar 

  • Scholz J (2015) Spatial adaptive large neighborhood search for wood supply chain optimization. Int J Appl Geospatial Res 6(4):27–43. https://doi.org/10.4018/ijagr.2015100102

    Article  Google Scholar 

  • Shaw P (1998) Using constraint programming and local search methods to solve vehicle routing problems. In: Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming—CP’98, Lecture Notes in Computer Science, vol 1520. Springer, London, UK, pp 417–431. https://doi.org/10.1007/3-540-49481-2-30

  • Wald A, Wolfowitz J (1939) Confidence limits for continuous distribution functions. Ann Math Stat 10(2):105–118. http://www.jstor.org/stable/2235689

Download references

Author information

Authors and Affiliations

  1. University of Craiova, Craiova, Romania

    Costin Bǎdicǎ & Amelia Bǎdicǎ

  2. Technical University “Gheorghe Asachi” of Iaşi, Iaşi, Romania

    Florin Leon

Authors
  1. Costin Bǎdicǎ
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Florin Leon
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Amelia Bǎdicǎ
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Costin Bǎdicǎ.

Ethics declarations

Conflict of interest

The authors declare that they have no competing interests.

Ethical approval

This article does not contain any studies with human participants or animals performed by any of the authors.

Additional information

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bǎdicǎ, C., Leon, F. & Bǎdicǎ, A. Freight transportation broker agent based on constraint logic programming. Evolving Systems 11, 363–382 (2020). https://doi.org/10.1007/s12530-018-9230-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12530-018-9230-3

Keywords

Search

Navigation

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy