Search results for "simulation"

showing 10 items of 5095 documents

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 …

050210 logistics & transportationMathematical optimization021103 operations researchInformation Systems and ManagementGeneral Computer ScienceMathematical modelHeuristicComputer science05 social sciences0211 other engineering and technologies02 engineering and technologyManagement Science and Operations ResearchIndustrial and Manufacturing EngineeringField (computer science)Set (abstract data type)Packing problemsModeling and Simulation0502 economics and businessNesting (computing)PLANEJAMENTO DA PRODUÇÃOMetaheuristic
researchProduct

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…

050210 logistics & transportationScheduleTheoretical computer scienceDegree (graph theory)Hierarchy (mathematics)Computer scienceModulo05 social sciencesContext (language use)02 engineering and technology[INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE][INFO.INFO-MO]Computer Science [cs]/Modeling and Simulationlaw.inventionDynamic programming[INFO.INFO-IU]Computer Science [cs]/Ubiquitous Computing[INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]Calculatorlaw[INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA]0502 economics and business0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processing[INFO.INFO-ET]Computer Science [cs]/Emerging Technologies [cs.ET][INFO.INFO-DC]Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC]
researchProduct

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 …

050210 logistics & transportationService (systems architecture)021103 operations researchInformation Systems and ManagementGeneral Computer ScienceOperations researchComputer sciencebusiness.industryBranch and price05 social sciences0211 other engineering and technologiesContext (language use)02 engineering and technologyHub location problemManagement Science and Operations ResearchIndustrial and Manufacturing EngineeringOutsourcingNetwork planning and designModeling and Simulation0502 economics and businessPath (graph theory)Service Network Design Hub Location Intermodal Transport Branch-and-Price-and-CutbusinessSimulationEuropean Journal of Operational Research
researchProduct

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 …

050210 logistics & transportationService (systems architecture)Mathematical optimization021103 operations researchInformation Systems and ManagementGeneral Computer ScienceComputer science05 social sciences0211 other engineering and technologiesContext (language use)Incompatibility constraints02 engineering and technologyManagement Science and Operations ResearchGeneralized independent set problem Incompatibility constraints Routing Rural postman problem Management Science and Operations Research Information Systems and ManagementIndustrial and Manufacturing EngineeringGeneralized independent set problemDomain (software engineering)Rural postman problemModeling and SimulationIndependent set0502 economics and businessRouting (electronic design automation)MATEMATICA APLICADARouting
researchProduct

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 …

050210 logistics & transportationService (systems architecture)Mathematical optimization021103 operations researchInformation Systems and ManagementGeneral Computer ScienceComputer science05 social sciences0211 other engineering and technologiesMixed graphTime horizon02 engineering and technologyExtension (predicate logic)Management Science and Operations ResearchIndustrial and Manufacturing EngineeringSet (abstract data type)Modeling and Simulation0502 economics and businessPeriodic graph (geometry)Routing (electronic design automation)Branch and cutArc routingEuropean Journal of Operational Research
researchProduct

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…

050210 logistics & transportationVISSIMComputer sciencebusiness.industryRoundabout05 social sciencesMicrosimulationSurrogate safety measureTraffic simulation010501 environmental sciences01 natural sciencesVisSimTransport engineeringSoftware0502 economics and businessRoundaboutTrajectorySettore ICAR/04 - Strade Ferrovie Ed AeroportiAIMSUNbusinesscomputer0105 earth and related environmental sciencescomputer.programming_language
researchProduct

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.

050402 sociologySettore SPS/08 - Sociologia Dei Processi Culturali E ComunicativiMafia vittime estorsioni analisi dati.LegislationMafia-type organizationsMafia methodssocial responses0504 sociologyPhenomenonRacketSociology0505 lawcomputer.programming_languageLaw and economicsExtortionField (Bourdieu)05 social sciencessimulation16. Peace & justiceExtortionDynamics (music)Extortion; Mafia-type organizations; Mafia methods; social responses; simulationSettore SPS/12 - Sociologia Giuridica Della Devianza E Mutamento Sociale050501 criminologySettore SPS/07 - Sociologia GeneralecomputerCartography
researchProduct

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 …

12-DipalmitoylphosphatidylcholineLipid BilayersBiochemistryCatalysisColloid and Surface ChemistryCOARSE-GRAINED MODELSHAPE TRANSFORMATIONSMonolayerComputer SimulationLipid bilayer phase behaviorLipid bilayerChemistryBilayerLipid bilayer fusionBiological membraneGeneral ChemistryLipid bilayer mechanicsANTIMICROBIAL PEPTIDESCrystallographyMembraneTRANSMEMBRANE DISTRIBUTIONEGG PHOSPHATIDYLCHOLINEPhosphatidylcholinesPORE FORMATIONBiophysicsPRESSURE PROFILESMECHANOSENSITIVE CHANNELlipids (amino acids peptides and proteins)OCTYL GLUCOSIDEPHOSPHOLIPID-BILAYERSJournal of the American Chemical Society
researchProduct

Partition of Indicaxanthin in Membrane Biomimetic Systems. A Kinetic and Modeling Approach

2009

The solubilization site of indicaxanthin (Ind) in lipid bilayers was investigated by the kinetics of Ind oxidation by peroxyl radicals in water and in aqueous/L-alpha-dipalmitoyl-phosphatidylcholine (DPPC) vesicles, pH 7.4, and 37.0 and 48.0 degrees C, that is, in a gel-like and a crystal liquidlike bilayer state, respectively. The time-dependent Ind absorbance decay, matched with a successful simulation of the reaction kinetic mechanism by Gepasi software, supported a multistep pathway. Computer-assisted analysis allowed calculation of the rate constants associated with the reactions involved, the values of which decreased with increasing DPPC concentration. The binding constant calculated…

12-DipalmitoylphosphatidylcholinePyridinesLipid BilayersBetalain pigmentchemistry.chemical_compoundReaction rate constantGepasi simulation.biomimetic membraneLipid bilayervesiclephospholipidAqueous solutionChromatographyVesicleBilayerAqueous two-phase systemWaterGeneral ChemistryBinding constantBetaxanthinsPeroxidesKineticschemistryLiposomesPhysical chemistryDPPCGeneral Agricultural and Biological SciencesOxidation-ReductionIndicaxanthinSoftware
researchProduct

Influence of the exchange and correlation functional on the structure of amorphous InSb and In3SbTe2 compounds

2016

We have investigated the structural, vibrational, and electronic properties of the amorphous phase of InSb and In3SbTe2 compounds of interest for applications in phase change non-volatile memories. Models of the amorphous phase have been generated by quenching from the melt by molecular dynamics simulations based on density functional theory. In particular, we have studied the dependence of the structural properties on the choice of the exchange-correlation functional. It turns out that the use of the Becke-Lee-Yang-Parr functional provides models with a much larger fraction of In atoms in a tetrahedral bonding geometry with respect to previous results obtained with the most commonly used P…

10120 Department of Chemistrynon-volatile memoryYield (engineering)Theory of Condensed MatterGeneral Physics and Astronomy02 engineering and technologyElectronic structure01 natural sciencesMolecular dynamicsComputational chemistry540 Chemistry0103 physical sciencesPhysical and Theoretical Chemistry010306 general physicsamorphous materialFIS/03 - FISICA DELLA MATERIAQuenchingChemistry021001 nanoscience & nanotechnologyelectronic structure3100 General Physics and AstronomyAmorphous solidab-initio simulationChemical physicsMolecular vibrationTetrahedronDensity functional theory1606 Physical and Theoretical Chemistry0210 nano-technologyphase change material
researchProduct