Human‐centered design of artificial intelligence
This chapter focuses on describing how the human‐centered design (HCD) process can be
revisited and expanded in an artificial intelligence (AI) context, proposing a methodological …
revisited and expanded in an artificial intelligence (AI) context, proposing a methodological …
A glass-box interactive machine learning approach for solving NP-hard problems with the human-in-the-loop
The goal of Machine Learning to automatically learn from data, extract knowledge and to
make decisions without any human intervention. Such automatic (aML) approaches show …
make decisions without any human intervention. Such automatic (aML) approaches show …
Towards interactive Machine Learning (iML): applying ant colony algorithms to solve the traveling salesman problem with the human-in-the-loop approach
Abstract Most Machine Learning (ML) researchers focus on automatic Machine Learning
(aML) where great advances have been made, for example, in speech recognition …
(aML) where great advances have been made, for example, in speech recognition …
Heuristic algorithms for solving the generalized vehicle routing problem
The vehicle routing problem (VRP) is one of the most famous combinatorial optimization
problems and has been intensively studied due to the many practical applications in the field …
problems and has been intensively studied due to the many practical applications in the field …
A survey of different integer programming formulations of the generalized minimum spanning tree problem
PC Pop - Carpathian Journal of Mathematics, 2009 - JSTOR
In this survey paper, we discuss the development of the Generalized Minimum Spanning
Tree Problem, denoted by GMSTP, and we focus on the integer programming formulations …
Tree Problem, denoted by GMSTP, and we focus on the integer programming formulations …
[图书][B] Advances in bio-inspired computing for combinatorial optimization problems
CM Pintea - 2014 - Springer
” Advances in Bio-inspired Combinatorial Optimization Problems” illustrates several recent
bio-inspired efficient algorithms for solving NP-hard problems. Theoretical bio-inspired …
bio-inspired efficient algorithms for solving NP-hard problems. Theoretical bio-inspired …
Sensitive ants in solving the generalized vehicle routing problem
The idea of sensitivity in ant colony systems has been exploited in hybrid ant-based models
with promising results for many combinatorial optimization problems. Heterogeneity is …
with promising results for many combinatorial optimization problems. Heterogeneity is …
Solving the Generalized Vehicle Routing Problem with an ACS‐based Algorithm
Ant colony system is a metaheuristic algorithm inspired by the behavior of real ants and was
proposed by Dorigo et al. as a method for solving hard combinatorial optimization problems …
proposed by Dorigo et al. as a method for solving hard combinatorial optimization problems …
Secure traveling salesman problem with intelligent transport systems features
Meeting the security requests in transportation is nowadays a must. The intelligent transport
systems (ITSs) represent the support for addressing such a challenge, due to their ability to …
systems (ITSs) represent the support for addressing such a challenge, due to their ability to …
Solving the test case prioritization problem with secure features using ant colony system
Nowadays, the correctness of a program is a must and this comes with a plus when is about
security. It is a major benefit to have confident results when the software is tested. In …
security. It is a major benefit to have confident results when the software is tested. In …