Investments in the agricultural sector represented by innovations and new technologies strongly influence the economic growth in developing countries. In this context, purchasing decisions have become more relevant. Multiple-criteria decision-making techniques are well suited for decision-makers (DMs) who are considering the introduction of new technologies. In this paper, a multi-criteria model is built to help a Colombian agricultural research company make decisions on purchasing different laboratory equipment. A compensatory approach based on trade-offs is used to elicit the preferences of a group of DMs. The high number of answers and cognitive effort required from them during the elicitation process led to using an alternative approach based on partial information, called the FITradeoff (The Flexible and Interactive Tradeoff) method. It showed to be the best fit to solve the company’s purchasing problem and allowed its managers to make decisions that consider criteria other than price, taking account of the DMs’ conflicting viewpoints. The proposed model aimed at contributing to the articulation of the end-user knowledge in decision-making in order to ensure effective articulation of actors and strengthening of science, technology and innovation in agriculture.

Preliminary normalization is central to the decision process of several popular, recent or completely new multi-attribute decision-making (MADM) methods. However, a number of authors have pointed out serious pitfalls attributed to normalization methods. One major pitfall, which has been identified, is that normalization methods may lead to different final rankings of alternatives when a ranking procedure (RP) based on them is used for solving a MADM problem. The current paper aims to ascertain and illustrate the effectiveness of some RPs based on prominent primary WEighted Self-NORmalizing Distance (WESNORD) metrics and their averages. The effectiveness of the selected RPs is demonstrated by solving a logistics service provider (LSP) selection problem taken from the literature. The results reveal that the RPs considered deliver final rankings of alternatives, which are very similar to the SAW-produced reference ranking.

This article has studied a full truckload transportation problem in the context of an empty return scenario, particularly an order selection and vehicle routing problem with full truckload, multiple depots and time windows (SFTMDVRPTW). The aim is to develop a solution where a set of truck routes serves a subset of selected transportation demands from a number of full truckload orders to maximize the total profit obtained from those orders. Each truck route is a chain of selected demands to serve, originating at a departure point and terminating at an arriving point of trucks in a way that respects the constraints of availability and time windows. It is not mandatory to serve all orders, and only the profitable ones are selected. In this study, we have formulated the SFTMDVRPTW as a mixed-integer linear programming (MILP) model. Finally, Computational results are conducted on a new data set that contains thirty randomly generated problem instances ranging from 16 to 30 orders using the CPLEX software. The findings prove that our model has provided good solutions in a reasonable time.

Public security is an area of increasing importance in Brazil, as society requires that public resources are managed more efficiently and effectively. Criminalistics is an integral and vital part of the Brazilian public security system and requires new management tools to optimize human resources, equipment, and facilities allocation. Faced with a challenging scenario of budgetary constraints in several areas in public administration, the search for innovative methods should be a priority for the forensic service sector managers. The current article presents a multicriteria decision model to evaluate the operational viability of 23 forensic units within the Federal Police of Brazil (PF). The framework used the hybrid approach BWM and R-TOPSIS. The proposed model led to the complete ranking of 23 local forensic units. Amongst the last positions in the ranking, it was possible to recommend merging or shutting down some units. The sensitivity analysis performed did not show abrupt variations in the original positions, confirming the robustness of the proposed solution. It was concluded that the model allowed resources optimization whilst not compromising the quality of the services provided to society.

This paper proposes a new hybrid algorithm to solve the multi-compartment vehicle routing problem (MCVRP) with a heterogeneous fleet of vehicles for the fuel delivery problem of a previous study of twenty petrol stations in northeastern Thailand. The proposed heuristic is called the Fisher and Jaikumar Algorithm with Adaptive Large Neighborhood Search (FJA-ALNS algorithm). The objective of this case is to minimize the total distance, while using a minimum number of multi-compartment vehicles. In the first phase, we used the FJA to solve the MCVRP for the fuel delivery problem. The results from solving the FJA were utilized to be the initial solutions in the second phase. In the second phase, a hybrid algorithm, namely the FJA-ALNS algorithm, has been developed to improve the initial solutions of the individual FJA. The results from the FJA-ALNS algorithm are compared with the exact method (LINGO software), individual FJA and individual ALNS. For small-sized problems (N=5), the results of the proposed FJA-ALNS and all methods provided no different results from the global optimal solution, but the proposed FJA-ALNS algorithm required less computational time. For larger-sized problems, LINGO software could not find the optimal solution within the limited period of computational time, while the FJA-ALNS algorithm provided better results with much less computational time. In solving the four numerical examples using the FJA-ALNS algorithm, the result shows that the proposed FJA-ALNS algorithm is effective for solving the MCVRP in this case. Undoubtedly, future work can apply the proposed FJA-ALNS algorithm to other practical cases and other variants of the VRP in real-world situations.

It is a fact accepted by everybody that football is the most popular sport around the world. The result of a derby match may be very important for millions of people. Even the time seems to stop on a match day for so many people. Show and entertainment are the most important aspects of football. If soccer players have a high performance, a match may provide pleasure and excitement to audiences. Briefly, the performance and quality of soccer players are the key factors, which draw audiences. Goalkeepers are also one of the important components of football like other players playing different positions such as strikers, mid-fielders, and defenders. Moreover, a goalkeeper can affect the result of a match positively or negatively. Therefore, with the help of a mathematical approach as the methodological framework, it can be seen that the examination of the performance of goalkeepers can be beneficial for decision-makers performing in the fields of sport and the future studies. The current paper proposes an improved integrated multi-criteria decision-making approach to evaluate the selection of goalkeepers; and this model can be applied for goalkeeper’s performance analysis. The proposed model combines the weights of criteria calculated with the help of both the CRITIC and the PSI techniques by applying the weight aggregation operator. It also ranks the decision alternatives by implementing the WASPAS technique based on the final criteria weights obtained by using the weight aggregation operator. In addition, a comprehensive sensitivity analysis consisting of three stages was performed to verify the validation of the suggested hybrid model. It has been observed that A11 has remained the best option for all scenarios. As a result, the results of the sensitivity analysis prove that the proposed hybrid MCDM technique is a very useful, strong and applicable approach. Also, the results obtained by applying the proposed model are accurate, realistic, and reasonable according to the results of the validation test.

The multiple travelling salesman problem (MTSP) is one of the widely studied combinatorial optimization problems with various theoretical and practical applications. However, most of the studies intended to deal with classical MTSP, very limited attention has been given to an open multiple travelling salesman problem and its variants. In this paper, an open multiple travelling salesman problem with load balancing constraint (OMTSPLB) is addressed. The OMTSPLB differs from the conventional MTSP, in which all the salesmen start from the central depot and need not come back to it after visiting the given number of cities by accomplishing the load balance constraint, which helps in fairly distributing the task among all salesmen. The problem aims to minimize the overall traversal distance/cost for operating open tours subject to the load balancing constraint. A zero-one integer linear programming (0-1 ILP) model and an efficient metaheuristic genetic algorithm (GA), is established for the OMTSPLB. Since no existing study on OMTSPLB, the proposed GA is tested on the relaxed version of the present model, comparative results are reported. The comparative results show that the proposed GA is competent over the existing algorithms. Furthermore, extensive experiments are carried out on OMTSPLB and the results show that proposed GA can find the global solution effectively.

School bus routing problem is widely studied, however, social elements such as the interaction between children traveling on the same route have not been considered so far. In this way, this article has as its main objective to propose a methodology to solve the school bus routing problem, including affinity as a strategy to increase positive interrelationships between children, and with this, support in bullying situations during school trips. The methodology includes two stages, assigning children to vehicles considering affinities and defining vehicle routes. The main contribution is the consideration of affinity in the process of forming the groups of children that will be taken on the bus, evidencing a balance in the affinity of the groups. Additionally, from the methodological point of view, the integration of a modified group technology algorithm and a new assignment model are proposed that simplify the classic quadratic assignment problem. Consideration of affinity in school bus routing generates benefits from a social point of view.

Designing an efficient supply chain for organ transplant networks which is intimately related to humans’ life plays a primary role in improving the network’s performance. This research is focused on proposing a new multi-period location-allocation modeling approach to make appropriate strategic decisions for designing organ transplant networks under supply and budget uncertainties. To serve this purpose, a bi-objective possibilistic programming model is formulated the aim of which is to maximize network responsiveness and minimize the total cost. A fuzzy goal programming approach is adopted to solve multiple objective function models and control their deviations from the corresponding aspiration levels. As an important contribution of this study, the chance of success of transplantation processes is taken into consideration by proposing appropriate utility functions according to transportation criteria. Moreover, for the purpose of coping with the inherent uncertainty of the input parameters, a possibilistic programming model based on Me measure converted to three optimistic, realistic and pessimistic models is developed. Three new formulations have also been developed to tackle equality chance constraints. Finally, the optimal solutions of the developed models are analyzed through conducting a real case study in Iran. According to the results, for the considered organ transplant network, the possibilistic programming model based on the realistic measure is better than the optimistic and pessimistic measure in most confidence levels.

Home health care faces new challenges day by day and it has become increasingly legitimate in the face of an aging population. Home healthcare centers are exposed to cumulative demands and academics are paying attention to the routing and scheduling matter, which is offered in literature as a Technician Routing and Scheduling Problem (TRSP) where the aim is to minimize the total cost subject to the time windows constraints to serve the patients respecting their priorities. In this paper, we develop a new distributed algorithm to resolve the home health care routing and scheduling problem (HHRSP). The principal idea of this algorithm is to apply artificial intelligence techniques in a distributed optimization method. The integration of automatic learning and search methods are applied to optimize the assignment of appointments to home caregivers. It allows us to gain time, effort, especially cost, and while complying with the problem constraints. The comparison results prove the efficacy of the recommended approach, which can offer decision support for medical executives of home health care.