Search results for "Turin"
showing 10 items of 2664 documents
The berth allocation problem in terminals with irregular layouts
2019
As international trade thrives, terminals attempt to obtain higher revenue while coping with an increased complexity with regard to terminal management operations. One of the most prevalent problems such terminals face is the Berth Allocation Problem (BAP), which concerns allocating vessels to a set of berths and time slots while simultaneously minimizing objectives such as total stay time or total assignment cost. Complex layouts of real terminals introduce spatial constraints which limit the mooring and departure of vessels. Although significant research has been conducted regarding the BAP, these real-world restrictions have not been taken into account in a general way. The present work …
Asymmetry matters: Dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster
2017
Abstract With their paper “Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints” [Discrete Optimization 3, 2006, pp. 255–273] Righini and Salani introduced bounded bidirectional dynamic programming (DP) as an acceleration technique for solving variants of the shortest path problem with resource constraints (SPPRC). SPPRCs must be solved iteratively when vehicle routing and scheduling problems are tackled via Lagrangian relaxation or column-generation techniques. Righini and Salani and several subsequent works have shown that bounded bidirectional DP algorithms are often superior to their monodirectional counterparts, s…
Irregular packing problems: a review of mathematical models
2020
Abstract Irregular packing problems (also known as nesting problems) belong to the more general class of cutting and packing problems and consist of allocating a set of irregular and regular pieces to larger rectangular or irregular containers, while minimizing the waste of material or space. These problems combine the combinatorial hardness of cutting and packing problems with the computational difficulty of enforcing the geometric non-overlap and containment constraints. Unsurprisingly, nesting problems have been addressed, both in the scientific literature and in real-world applications, by means of heuristic and metaheuristic techniques. However, more recently a variety of mathematical …
Branch-and-price-and-cut for a service network design and hub location problem
2015
In the context of combined road-rail freight transport, we study the integrated tactical planning of hub locations and the design of a frequency service network. We consider a number of real-world constraints such as multiple transshipments of requests at hubs, transport time limits for requests, request splitting, and outsourcing possibilities. To our knowledge, the combination of problem features we deal with has not been described before. We present a path-based model and solve it with a branch-and-price-and-cut algorithm. Computational experiments show that large realistic instances from a major German rail freight company can be solved close to optimality within one hour on a standard …
The directed profitable rural postman problem with incompatibility constraints
2017
[EN] In this paper, we study a variant of the directed rural postman problem (RPP) where profits are asso- ciated with arcs to be served, and incompatibility constraints may exist between nodes and profitable arcs leaving them. If convenient, some of the incompatibilities can be removed provided that penalties are paid. The problem looks for a tour starting and ending at the depot that maximizes the difference between collected profits and total cost as sum of traveling costs and paid penalties, while satisfying remaining incompatibilities. The problem finds application in the domain of road transportation service, and in particular in the context of horizontal collaboration among carriers …
The periodic rural postman problem with irregular services on mixed graphs
2019
Abstract In this paper, we deal with an extension of the rural postman problem in which some links of a mixed graph must be traversed a given number of times over a time horizon. These links represent entities that must be serviced a specified number of times in some subsets of days (or periods) of the time horizon. The aim is to design a set of minimum-cost tours, one for each day/period of the time horizon, that satisfy the service requirements. We refer to this problem as the periodic rural postman problem with irregular services (PRPP–IS). Some practical applications of the problem can be found in road maintenance operations and road network surveillance, for example. In order to solve …
Simplified restructuring proceedings in Poland as an example of anti – crisis regulation due to the COVID-19 pandemic
2020
Summary The study discusses new legislative anti – crisis solutions adopted in Poland in connection with the COVID – 19 pandemic. The Polish legislator decided to introduce the so-called simplified restructuring procedure. This happened in the face of the expectations of both the jurisprudence of law and practice. On the one hand, the simplified restructuring procedure (the fifth independent type of restructuring procedure for an entrepreneur in Poland) allows for a quick, cheap and simplified conclusion of an arrangement with creditors outside the court, then approved by the court. On the other hand, the opening of such proceedings gives the debtor protection against enforcement at the cre…
Wpływ Brexitu na współpracę sądową w sprawach karnych w Unii Europejskiej
2020
Wystąpienie Zjednoczonego Królestwa z Unii Europejskiej stanowi jedno z głównych wyzwań dla dalszego funkcjonowania europejskiego obszaru wymiaru sprawiedliwości w sprawach karnych. W niniejszym artykule szczególna uwaga zostanie zwrócona na wybrane aspekty zapewnienia dalszej współpracy sądowej w sprawach karnych po Brexicie. Dotyczy to przede wszystkim możliwości dalszego udziału Zjednoczonego Królestwa w specyficznych organach wspomagających obrót prawny w ramach tej współpracy (tj. w ramach Eurojustu i Europolu) oraz stosowania instrumentów prawnych urzeczywistniających zasadę wzajemnego uznawania orzeczeń, ze szczególnym uwzględnieniem sztandarowego instrumentu prawnego, tj. europejski…
STANCE BUNDLES IN ENGLISH-TO-POLISH TRANSLATION: A CORPUS-INFORMED STUDY
2018
In this paper, we make an attempt to improve the textual fit of English-to-Polish translation of a peculiar type of multi-word units known in corpus linguistic literature as lexical bundles (Biber et al. 1999). Inspired by a study conducted by Grabar and Lefer (2015), we used the English-Polish parallel corpus Paralela (Pezik 2016) and the National Corpus of Polish (NKJP) to extract and explore the use - in terms of frequency distributions - of the Polish equivalents of selected English lexical bundles expressing attitudinal and epistemic stance. More precisely, we used the NKJP corpus to check whether the Polish equivalents are typical of contemporary Polish as found in native texts. The r…
Untargeted metabolomics to explore the oxidation processes during shelf life of pork patties treated with guarana seed extracts
2019
The changes of metabolites in pork patties with different antioxidants added (control without antioxidants, 200 mg kg(-1) butylated hydroxytoluene (BHT) and 250 mg kg(-1) guarana seed extracts (GSEs)) under modified atmosphere (80% O-2 and 20% CO2) for 18 days of refrigerated storage were evaluated. Untargeted metabolomic approach based on UHPLC-ESI-QTOF-MS analysis was applied. GSE phytochemical profile revealed a wide variety of compounds (caffeine, glycerol 1-propanoate, amino acids, alkaloids and glycerophospholipids), together with antioxidants (tyrosols, procyanidins and flavonoids). Important differences in BHT and GSE patties metabolomic profiles were found during storage. Most of t…