Abstract
The paper presents experience of solving a complex real-life problem from the area of dynamic logistics. Different approaches to solving the problem are presented including usage of a constraint solver, linearization of the problem for its faster solving and development of an algorithm for finding feasible solutions. The considered problem takes into account continuously changing problem environment and requires nearly real-time solving. Consequently, it was important to ensure that the chosen approach allows solving the problem in a very short time (nearly real-time). Three solving techniques have been tested: (i) using a third party constraint solver, (ii) linearization of the problem and (iii) specially developed algorithm finding feasible solutions. The analysis of the results has shown that in the particular considered case the developed algorithm is the most applicable.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Pochet Y, Wolsey LA (2006) Production planning by mixed integer programming. Springer, Berlin, 477 pp
Anily S, Tzur M (2005) Shipping multiple-items by capacitated vehicles—an optimal dynamic programming approach. Transp Sci 39:233–248
Ell’Amico M, Fischetti M, Toth P (1993) Heuristic algorithms for the multiple depot vehicle scheduling problem, Manag Sci 39(1):115–125
Smirnov A, Shilov N, Levashova T, Kashevnik A (2006) Ontology-driven BTO production network configuration based on knowledge logistics. In: Proceedings of the German–Russian logistics workshop, Saint-Petersburg, Russia, 20–21 April, 2006, pp 162–171
Benavides D, Segura S, Trinidad P, Ruiz-Cortes A (2006) Using Java CSP solvers in the automated analyses of feature models. In: Lammel R, Saraiva J, Visser J (eds) Lecture notes in computer science, vol 4143. Springer, Berlin, pp 399–408
Sleeman D, Chalmes S (2006) Assisting domain experts to formulate & solve constraint satisfaction problems. In: Staab S, Svatek V, (eds) Proceedings managing knowledge in a world of networks: 15th international conference on knowledge engineering and knowledge management (EKAW 2006), Podebrady, Czech Republic, pp 19–26
Choco: Java library for constraint satisfaction applications, 2006, URL: http://choco.sourceforge.net/. Accessed 31 March 2009
CLAIR: rule processing language, 2006, http://claire3.free.fr/. Accessed 18 May 2010
PaLM: Propagation and learning with move, 2006, http://www.e-constraints.net/palm/palm.html. Accessed 18 May 2010
ILOG optimization decision management system, 2007, http://www.ilog.com/products/optimization/tools/index.cfm. Accessed 31 March 2009
ILIPT project web-site, 2007, http://www.ilipt.org. Accessed 18 May 2010
Acknowledgements
The paper is due to the research carried out as a part of projects funded through Integrated Project FP6-IST-NMP 507592-2 “Intelligent Logistics for Innovative Product Technologies” sponsored by European Commission, by grants #05-01-00264, 09-07-00066 and 09-07-00436 of the Russian Foundation for Basic Research, projects #213 of the research program “Intelligent information technologies, mathematical modelling, system analysis and automation” of the Russian Academy of Sciences, project of the scientific program of St. Petersburg Scientific Center of RAS, as well as project of the Science and High School Committee of St. Petersburg Government.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Smirnov, A., Shilov, N. AI-based Approaches to Solving a Dynamic Logistics Problem. Künstl Intell 24, 143–147 (2010). https://doi.org/10.1007/s13218-010-0028-0
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13218-010-0028-0