heuristic approach
Recently Published Documents

A Linear transport problem can be defined as the action of transporting products from "m origins" (or units) to "n destinations" (or customers) at the lowest cost. So the solution to a transportation problem is to organize the transportation in such a way as to minimize its cost. The objective of this paper is to determine the quantity sent from each source (origin) to each destination while minimizing transport costs. Achieving this objective requires a methodology which consists in deploying an algorithm whose purpose is the search for an optimal solution, based on an initial solution. The application is made on a factory producing mechanical parts.

In “School Choice in Chile,” Correa et al. describe the design and implementation of the new school admissions system in Chile. The design, based on the celebrated work of Gale, Shapley, and Roth, involves several challenges to comply with the Chilean legislation. For instance, the system includes different priorities and quotas for different groups of students. Moreover, the system operates nationwide and in all grade levels. As a result of the latter, one of the primary goals was to favor the joint assignment of siblings to the same schools. To accomplish this, the authors propose a heuristic approach that dynamically updates preferences, and breaks ties at the family level to increase the probability that siblings are assigned to the same school. The system, introduced in 2016 and still in use today, serves more than half a million students each year.