The Assignment Problem and Its Relation to Logistics Problems

WoS Article

en

The assignment problem is a problem that takes many forms in optimization and graph theory, and by changing some of the constraints or interpreting them differently and adding other constraints, it can be converted to routing, distribution and scheduling problems. Showing such correlations is one of the aims of this paper. Some of the derived problems having exponential time complexity, the question arises of their solvability for larger instances. Instead of the traditional approach based on the use of approximate or stochastic heuristic methods, we focus here on the direct use of mixed integer programming models in the GAMS environment, which is now capable of solving instances much larger than in the past and does not require complex parameter settings or statistical evaluation of the results as in the case of stochastic heuristics because the computational core of software tools, nested in GAMS, is deterministic in nature. The source codes presented may be an aid, because this tool is not yet as well known as the MATLAB Optimisation Toolbox. Benchmarks of the permutation flow shop scheduling problem with informally derived MIP model and the travelling salesman problem are used to present the limits of the software’s applicability.

assignment problem; travelling salesman problem; vehicle routing problem; flow shop scheduling problem; GAMS, genetic algorithm

2022-10-16

MDPI

1999-4893

15

10

1–27

27