This paper presents two new heuristics which utilize classification and max-flow algorithm respectively to derive near-optimal branch decompositions for linear matroids. In the literature, there are already excellent heuristics for graphs, however, no practical branch decomposition methods for general linear matroids have been addressed yet. Introducing a “measure” which compares the “similarit...

When we construct an agent by integrating modules, there appear troubles concerning the autonomy of the agent if we introduce a heuristics that dominates the whole agent. Thus, we design an agent that has an interdependent heuristics influenced by a module controlled by the heuristics, and we apply these agents into a problem of obtaining cooperation of Multi-Agents. We enable a present method ...

In this paper, we propose an energy-efficient mathematical model for the resource-constrained project scheduling problem to optimize makespan and consumption of energy, simultaneously. In the proposed model, resources are speed-scaling machines. The problem is NP-hard in the strong sense. Therefore, a multi-objective fruit fly optimization algorithm (MOFOA) is developed. The MOFOA uses the VIKO...

To handle a large amount of unlabeled data, batch active learning (BAL) queries humans for the labels most valuable data points at every round. Most current BAL strategies are based on human-designed heuristics, such as uncertainty sampling or mutual information maximization. However, there exists disagreement between these heuristics and ultimate goal BAL, i.e., optimizing model's final perfor...

Nowadays, one of the major goals of the distribution environment is to reduce lead times and inventories. Cross-docking is a logistics technique which removes the storage and picking up the functions of a warehouse. The term cross-docking refers to moving products directly from incoming to outgoing trailers with little or no storage in between. According to the recent related papers, the truck ...

In this paper, a hub covering location problem is considered. Hubs, which are the most congested part of a network, are modeled as M/M/C queuing system and located in placeswhere the entrance flows are more than a predetermined value.A fuzzy constraint is considered in order to limit the transportation time between all origin-destination pairs in the network.On modeling, a nonlinear mathematica...