Search results for "Automation"
showing 10 items of 1181 documents
Branch-and-Cut for the Split Delivery Vehicle Routing Problem with Time Windows
2019
The split delivery vehicle routing problem with time windows (SDVRPTW) is a notoriously hard combinatorial optimization problem. First, it is hard to find a useful compact mixed-integer programming (MIP) formulation for the SDVRPTW. Standard modeling approaches either suffer from inherent symmetries (mixed-integer programs with a vehicle index) or cannot exactly capture all aspects of feasibility. Because of the possibility to visit customers more than once, the standard mechanisms to propagate load and time along the routes fail. Second, the lack of useful formulations has rendered any direct MIP-based approach impossible. Up to now, the most effective exact algorithms for the SDVRPTW hav…
Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks
2016
Abstract This paper proposes models and algorithms for the pickup and delivery vehicle routing problem with time windows and multiple stacks. Each stack is rear-loaded and is operated in a last-in-first-out (LIFO) fashion, meaning that when an item is picked up, it is positioned at the rear of a stack. An item can only be delivered if it is in that position. This problem arises in the transportation of heavy or dangerous material where unnecessary handling should be avoided, such as in the transportation of cars between car dealers and the transportation of livestock from farms to slaughterhouses. To solve this problem, we propose two different branch-price-and-cut algorithms. The first sol…
The Split Delivery Vehicle Routing Problem with Time Windows and Customer Inconvenience Constraints
2019
In classical routing problems, each customer is visited exactly once. By contrast, when allowing split deliveries, customers may be served through multiple visits. This potentially results in substantial savings in travel costs. Even if split deliveries are beneficial to the transport company, several visits may be undesirable on the customer side: At each visit the customer has to interrupt his primary activities and handle the goods receipt. The contribution of the present paper consists in a thorough analysis of the possibilities and limitations of split delivery distribution strategies. To this end, we investigate two different types of measures for limiting customer inconvenience (a m…
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 …
Modelling Drivers’ Adaptation to Assistance Systems
2021
Human factors research and engineering of advanced driving assistance systems (ADAS) must consider how drivers adapt to their presence. The major obstruction to this at the moment is poor understanding of the details of the adaptive processes that the human cognition undergoes when faced with such changes. This paper presents a simulation model that predicts how drivers adapt to a steering assistance system. Our approach is based on computational rationality, and demonstrates how task interleaving strategies adapt to the task environment and the driver’s goals and cognitive limitations. A supervisor controls eye movements between the driving and non-driving tasks, making this choice on the …
2D size, position and shape definition of defects by B-scan image analysis
2015
The non-destructive evaluation of defects by automatic procedures is of great importance for structural components. Thanks to the developments of the non-contact ultrasonic techniques, the automation of the inspections is gaining a progressively important role. In this work, an automatic inspection technique for the evaluation of defects by the analysis of B-scan images obtained by a laser ultrasonic system is presented. The data are extracted directly from a B-scan map obtained for a panel with internal defects, and are used to build an image of the cross section of the panel. The proposed automatic procedure allows the definition of size, position and shape of defects in panels of known t…
A coarse to fine 3D acquisition system
2015
International audience; The 3D chain (acquisition-processing-compression) is , most of the time , sequenced into several steps. Such approaches result into an one-dense acquisition of 3D points. In large scope of applications , the first processing step consists in simplifying the data. In this paper , we propose a coarse to fine acquisition system which permits to obtain simplified data directly from the acquisition. By calculating some complementary information from 2D images , such as 3D normals , multiple homogeneous regions will be segmented and affected to a given primitive class. Contrary to other studies , the whole process is not based on a mesh. The obtained model is simplified di…
Dataa näkyvissä: Läpinäkyvyys algoritmien ja datan journalistisessa hyödyntämisessä
2021
Läpinäkyvyyden käsite on noussut keskeiseksi viestinnän, median ja politiikan tutkimuksessa sekä viestinnän ja politiikan käytäntöjen eettisessä arvioinnissa. Läpinäkyvyyttä on esitetty keinoksi ylläpitää ja kasvattaa luottamusta journalistista työtä ja sen tuotteita kohtaan interaktiivisessa media- ja viestintäympäristössä. Tiedontuotannon ja päätöksenteon perustuessa yhä enemmän dataan ja sen prosessointiin läpinäkyvyys on noussut keskeiseksi käsitteeksi myös algoritmisen päätöksenteon kohdalla. Tässä artikkelissa tarkastelemme läpinäkyvyyden roolia dataa ja algoritmeja sekä journalismia koskevassa keskustelussa ja esitämme mahdollisuuksia dataan ja algoritmeihin tukeutuvan journalismin l…
Benchmarking the sustainable manufacturing paradigm via automatic analysis and clustering of scientific literature: A perspective from Italian techno…
2019
Abstract The number of scientific papers in the field of Sustainable Manufacturing (SM) shows a strong growth of interest in this topic in the last 20 years. Despite this huge number of publications, a clear statement of the profound meaning of Sustainable Manufacturing, or at least a strong theoretical support, is still missing. The 6R framework seems to be a first attempt to rationalize this issue, as it is an axiomatic identification of its true nature. Recognizing the pursuing of one or more of the Reduce-Recycle-Reuse-Recover-Redesign-Remanufacture principles allows users to identify if any manufacturing action is in the right direction of sustainability. In the paper, the authors spec…