Delivery scheduling plays a significant role in the operations and development of enterprises operating in the European Union market. The specificity of the problem lies in taking into account the legal, organizational, and logistical conditions of trade within the European Union, assuming that the transported goods are excise products – in this case, alcohol.The article refers to an earlier publication under the same title, the aim of which was to identify the problem. In accordance with the methodology of operations research, as the goal of further research on the problem, the authors undertook the construction of a mathematical model.
The article presents a list of the main criteria and constraints taken into account during delivery scheduling and proposes their mathematical notation along with basic transformations. Based on the main assumptions of the model, the authors began research using a solver, the course and results of which are described in the article.
1. INTRODUCTION
Delivery scheduling belongs to a broad class of scheduling problems, generally consisting of determining an optimal (rational) finite number of sequences of operations (actions) over time, assuming a certain number of conditions or constraints [24][26].
Scheduling problems are usually formulated as combinatorial problems
P or NP-hard [15]. They concern areas such as management, production, transport, computer systems, and others [26]. The delivery scheduling problem is an operational problem defined as determining their quantities and deadlines in future periods, based on the forecasted inventory status [24].
In the literature, one can find a number of different approaches to solving scheduling problems depending on the specific nature of the problem and the level of complexity. A leading method currently used for solving scheduling problems belonging to the group of exact algorithms is dynamic programming [2, 3, 7, 9, 14, 16]. When solving more complex real-world problems, approximation techniques are usually used, which are faster and require fewer resources. In the literature, one can find a number of approximate methods used to solve scheduling problems, including genetic algorithms [1], fuzzy logic [25], the tabu search method [5, 10], simulated annealing [8], or other heuristics [23]. (…)
The article contains 35,190 characters.
Source: Logistyka Magazine 2/2012







