Search results for "imulation"
showing 10 items of 7271 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 …
Cimo: An efficient 2-phases calculator of multimodal itineraries for real trans-territories based on a dynamic programming
2015
In this work we propose an exact solution for calculating multimodal itinerary. This solution is named Cimo (Calculateur d'Itineraires Multimodaux Ordonnes). Cimo is an exact optimal itineraries' calculator wherein itineraries are sorted, multimodal, and trans-territorial. The solution is based on a dynamic programming algorithm "cut", "price" and "share". This solution is multi-objectives and multi-constraints. Several versions of this algorithm are proposed following a methodological approach that enables evaluation of efficiency and complexity's gain : through theoretical calculus and benchmarks. In the first version of realistic problem, we propose a solution with itineraries calculated…
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 …
Surrogate Measures of Safety at Roundabouts in AIMSUN and VISSIM Environment
2018
This paper addresses issues on road safety analysis through microscopic traffic simulation models. The Surrogate Safety Assessment Model (SSAM) was applied to read vehicle trajectory files generated by two micro-simulators and then calculate surrogate measures of safety. Since safety assessment of any road entity can provide different results based on the micro-simulator which is used, the main objective of this research was to estimate the safety performance of three roundabout layouts and compare the conflict events simulated by AIMSUN and VISSIM. The two micro-simulators were used to build the calibrated models of the roundabouts, each fitting the corresponding empirical capacity functio…
Mafia Methods, Extortion Dynamics and Social Responses
2016
This chapter is devoted to exploring both the empirical results and the policy proposals produced by the GLODERS project. Based on 631 cases of extortions, the Sicily and Calabria extortion database represents a relevant achievement in the field of the research on extortion racket and it is one of the main results of the GLODERS project. Gathering a great amount of information, our empirical analysis revealed the existence of several differences in the extortive conducts carried on within these two regions, which are presented. Moreover, the chapter introduces the legislation related to the crime of extortion. Social and legal responses to the phenomenon are then discussed.
Stability of Asymmetric Lipid Bilayers Assessed by Molecular Dynamics Simulations
2009
The asymmetric insertion of amphiphiles into biological membranes compromises the balance between the inner and outer monolayers. As a result, area expansion of the receiving leaflet and curvature strain may lead to membrane permeation, shape changes, or membrane fusion events. We have conducted both atomistic and coarse-grained molecular dynamics simulations of dipalmitoyl-phosphatidylcholine (DPPC) bilayers to study the effect of an asymmetric distribution of lipids between the two monolayers on membrane stability. Highly asymmetric lipid bilayers were found to be surprisingly stable within the submicrosecond time span of the simulations. Even the limiting case of a monolayer immersed in …