MMMiroslav Marić

Miroslav Marić

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Miroslav Marić has a total of 19 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • The Influence of Interactive Learning Materials on Solving Tasks That Require Different Types of Mathematical Reasoning

    by Marija Kaplar, Slaviša Radović, Kristina Veljković, Ksenija Simić-Muller, Miroslav Marić

    The purpose of this study is to analyse the effects of the Interactive Learning Materials Triangle (iLMT) on the learning and knowledge retention of 12-year-old students. The iLMT is a digital version of the standard school learning materials in Serbia, and is characterized by a high degree of interactivity and immediate feedback during the learning process. We conducted an experiment to explore whether iLMT influences student success in solving mathematical tasks that require different types of mathematical reasoning. Based on previous extensive research by Lithner, 4 types of tasks are discussed: high relatedness answer, high relatedness algorithm, local low relatedness, and global low relatedness. The study involved 633 students and 13 teachers of mathematics, equally distributed in control and test groups. The main findings indicate that student success on a knowledge test for high relatedness answer and local low relatedness tasks for the test group was significantly higher than for the control group. On the knowledge retention test, students in the test group outperformed students in the control group at high relatedness algorithm and local low relatedness tasks. Our results also suggest that, even when learning materials are carefully digitalized with the use of available technological advantages, student success in global low relatedness tasks may still be lacking.


  • Open Access

    Solving balanced multi-weighted attribute set partitioning problem with variable neighborhood search

    by Dusan Dzamic, Bojana Cendic, Miroslav Maric, Aleksandar Djenic

    This paper considers the Balanced Multi-Weighted Attribute Set Partitioning (BMWASP) problem which requires finding a partition of a given set of objects with multiple weighted attributes into a certain number of groups so that each attribute is evenly distributed amongst the groups. Our approach is to define an appropriate criterion allowing to compare the degree of deviation from the ?perfect balance? for different partitions and then produce the partition that minimizes this criterion. We have proposed a mathematical model for the BMWASP and its mixed-integer linear reformulation. We evaluated its efficiency through a set of computational experiments. To solve instances of larger problem dimensions, we have developed a heuristic method based on a Variable Neighborhood Search (VNS). A local search procedure with efficient fast swap-based local search is implemented in the proposed VNS-based approach. Presented computational results show that the proposed VNS is computationally efficient and quickly reaches all optimal solutions for smaller dimension instances obtained by exact solver and provide high-quality solutions on large-scale problem instances in short CPU times.

  • New Fuzzy Version of the Risk-constrained Cash-in-Transit Vehicle Routing Problem

    by Nina Radojičić, Miroslav Marić, Aleksandar Takači

    This paper considers the Risk-constrained Cash-in-Transit Vehicle Routing Problem (RCTVRP), a variant of the vehicle routing problem which takes into account risk factors of the routes. In this problem the risk constraints are set by using a risk threshold T on each route and thus, the routes with risk larger than T are forbidden. The main idea of this paper is to take into account the possibility of being robbed along each route, instead of just allowing solutions with routes that satisfy the risk constraints. We develop a new fuzzy version of the RCTVRP, called FRCTVRP, which takes into account the value of the risk index of each route and the solutions with lower values of risk indexes on their routes are considered as better. In order to achieve that, fuzzy numbers are incorporated into the new formulation. Moreover, two mixed integer program formulations of the FRCTVRP are developed in the paper. The introduced FRCTVRP is compared with the classical RCTVRP from the literature on an adequate example and the advantage of the newly proposed FRCTVRP is demonstrated. Computational experiments are performed and the comparison given in the paper shows that our approach leads to safer routes. DOI: http://dx.doi.org/10.5755/j01.itc.47.2.19874


  • Exponential quality function for community detection in complex networks

    by Dušan Džamić, Jun Pei, Miroslav Marić, Nenad Mladenović, Panos M. Pardalos

    One of the most popular topics in analyzing complex networks is the detection of its community structure. In this paper, we introduce a new criterion for community detection, called the E‐quality function. The quality of an individual community is defined as a difference between its benefit and its cost, where both are exponential functions of the number of internal edges and the number of external edges, respectively. The obtained optimization problem, maximization of the E‐quality function over all possible partitions of a network, is solved by the variable neighborhood search (VNS)‐based heuristic. Comparison of the new criterion and modularity is performed on the usual test instances from the literature. Experimental results obtained both on artificial and real networks show that the proposed E‐quality function allows detection of the communities existing in the network.


  • Open Access

    On the GeoGebra Supported Collaborative Learning

    by Durdica Takaci, Miroslav Maric

    Introduction In our research the collaborative learning with and without the use of the computer is analyzed. The process of collaborative learning is applied to the first year calculus students at the University of Novi Sad, Serbia, for examining functions and drawing their graphs. The collaborative learning process was analyzed, compared and described, for experimental and control group regarding their way of learning. First part of research was conducted in 2011 and 2012, were both experimental and control group were divided to small four member groups by using Kagan’s (1994) principles. In 2013 the new experimental group was formed by using mathematical model for the group making. The students in both experimental groups learned with the help of GeoGebra, and the students in the control group learned without using GeoGebra. After the collaborative learning, the students were tested with a test and post test, and the results of the experimental groups were significantly better than the results of students in the control group. The results are of the first part of research is published in the paper Takači et al (2015). Methods The research had started in 2011 year with the control group with 180 students, and continued in 2012 with the experimental group. In 2012 we had 210 students, but 180 students were chosen for experimental group having a corresponding student from 2011, same major, according to the pre-test results. Both the experimental and the control group were structured according to Kagan’s, instructions: The results of the pre-tests considering their pre-calculus knowledge were used to form a list order of all the students (ranging from the worst to the best one). Each student had to make two lists of persons whom he likes or dislikes, particularizing up to three names. The research was continued in 2013 when the second experimental group is formed analogously as in 2012, but the small four members groups are formed by using variable neighborhood search algorithm, (metaheuristic for solving the mathematical optimization problems) based on Kagan’s (1994) principles. The students also worked with the help of Geogebra. The task for all students was to examine twenty 20 appropriate functions and draw their graphs. The calculations for chosen functions could be done easily even without computer. The control group finished their task in two weeks (2 times 5 classes a week), but both experimental groups finished the whole task in 5 hours. The students worked on the task at the university, with the help of the authors. All the members in the group were given 5 points (of 100) for the successfully finished task, both in experimental and control group. After collaborative learning the students got test (colloquium) and post test (exam) to be done without the computer. Results and Discussion The analysis of the students work (examining 20 functions) had confirmed that learning calculus with the use of GeoGebra is more “constructivist” than without computer. Students used the opportunities to consider together algebraic and graphic view in order to examine, analyze and test the adequacy of their knowledge of the properties of functions. The students used the characteristics of the package GeoGebra to analyze both the formula and its graph at the same time in different ways. Both experimental groups finished all 20 tasks with the precision of 18.02% (2012), 18.25%, (2013), but the control group finished all 19.64 tasks with the precision of 12.84%. The statistical analysis (t-test, effect size) proves that the students’ learning achievement in examining functions and drawing their graphs is better when they use GeoGebra. The difference between the results of the test and post tests was statistically significant at the level of significance of 0.05 and 0.01, regarding control and both experimental groups. Conclusions Taking into account the results of the students’ achievement both at the test and the post-test, the results of the interviews, and the average number of solved tasks (of 20) per one group, we can say that the learning of examining functions and drawing their graphs by GeoGebra in CSCL groups is more efficient than the learning without it in collaborative groups. Since the difference between the tested experimental groups, of pre test, and post test was not statistically significant at the level of significance of 0.05 05 and 0.01, it can be concluded that the application of variable neighborhood search algorithm is very useful for team building procedure when we have lot of students to work with. References and Notes 1. Kagan, S. (1994). Cooperative Learning. San Clemente, CA: Resources for Teachers,Inc. 2. O'Malley, C. (ed.) (1995). Computer-supported cooperative learning. Berlin: Springer- Verlag. 3. Tall, D. (2011). A Sensible approach to the Calculus. Handbook Calculus and its teaching. Ed. F. Pluminage and A. Cuevas. 4. Takači, Dj., Stankov, G., Milanovic, I., (2015) Efficiency of learning environment using GeoGebra when calculus contents are learned in collaborative groups, Computers & Education 82: 421-431.

  • Open Access

    Variable Neighborhood Search for Solving the Capacitated Single Allocation Hub Location Problem

    by Miroslav Maric

    In this paper a Variable Neighborhood Search (VNS) algorithm for solving the Capacitated Single Allocation Hub Location Problem(CSAHLP) is presented. CSAHLP consists of two subproblems; the first ischoosing a set of hubs from all nodes in a network, while the other comprises finding the optimal allocation of non-hubs to hubs when a set of hubsis already known. The VNS algorithm was used for the first subproblem,while the CPLEX solver was used for the second. Computational resultsdemonstrate that the proposed algorithm has reached optimal solutions onall 20 test instances for which optimal solutions are known, and this in shortcomputational time.


  • Memetic Algorithm for Solving the Multilevel Uncapacitated Facility Location Problem

    by Miroslav Marić, Zorica Stanimirović, Aleksandar Djenić, Predrag Stanojević


  • An efficient memetic algorithm for the uncapacitated single allocation hub location problem

    by Miroslav Marić, Zorica Stanimirović, Predrag Stanojević


  • AN EFFICIENT EVOLUTIONARY ALGORITHM FOR LOCATING LONG-TERM CARE FACILITIES

    by Zorica Stanimirovic, Miroslav Maric, Srdjan Bozovic, Predrag Stanojevic

    This paper deals with a variant of a discrete location problem of establishing long-term care facilities in a given network.The objective is to determine optimal locations for these facilities in order to minimize the maximum number of assigned patients to a single facility. We propose an efficient evolutionary approach (EA) for solving this problem, based on binary encoding, appropriate objective function and standard genetic operators. Unfeasible individuals in the population are corrected to be feasible, while applied EA strategies keep the feasibility of individuals and preserve the diversity of genetic material. The algorithm is benchmarked on a real-life test instance with 33 nodes and the obtained results are compared with the existing ones from the literature. The EA is additionally tested on new problem instances derived from the standard ORLIB AP hub data set with up to 400 potential locations. For the first time in the literature we report verified optimal solutions for most of the tested problem instances with up to 80 nodes obtained by the standard optimization tool CPLEX. Exhaustive computational experiments show that the EA approach quickly returns all optimal solutions for smaller problem instances, while large-scale instances are solved in a relatively short CPU time. The results obtained on the test problems of practical sizes clearly indicate the potential of the proposed evolutionary-based method for solving this problem and similar discrete location problems.DOI: http://dx.doi.org/10.5755/j01.itc.41.1.1115