Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

A chance-constrained stochastic approach to intermodal container routing problems.

ABSTRACT: We consider a container routing problem with stochastic time variables in a sea-rail intermodal transportation system. The problem is formulated as a binary integer chance-constrained programming model including stochastic travel times and stochastic transfer time, with the objective of minimising the expected total cost. Two chance constraints are proposed to ensure that the container service satisfies ship fulfilment and cargo on-time delivery with pre-specified probabilities. A hybrid heuristic algorithm is employed to solve the binary integer chance-constrained programming model. Two case studies are conducted to demonstrate the feasibility of the proposed model and to analyse the impact of stochastic variables and chance-constraints on the optimal solution and total cost.

SUBMITTER: Zhao Y

PROVIDER: S-EPMC5811005 | biostudies-literature | 2018

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

A chance-constrained stochastic approach to intermodal container routing problems.

Zhao Yi Y Liu Ronghui R Zhang Xi X Whiteing Anthony A

PloS one 20180213 2

We consider a container routing problem with stochastic time variables in a sea-rail intermodal transportation system. The problem is formulated as a binary integer chance-constrained programming model including stochastic travel times and stochastic transfer time, with the objective of minimising the expected total cost. Two chance constraints are proposed to ensure that the container service satisfies ship fulfilment and cargo on-time delivery with pre-specified probabilities. A hybrid heurist ...[more]

PMID: 29438389

Similar Datasets

Dynamics of stochastic-constrained particles.

Project description:Prior studies have focused on the overall behavior of randomly moving particle swarms. However, the characteristics of the stochastic-constrained particles that form ubiquitously within these swarms remain oblivious. This study demonstrates a generalized diffusion equation for stochastic-constrained particles that considers the velocity and location aggregation effects observed from their parent particle swarm (i.e., a completely random particle swarm). This equation can be approximated as the form of Schrödinger equation in the microcosmic case (low relative density) and describe the dynamics of the total mass distribution in the macrocosmic case (high relative density). The predicted density distribution of the particle swarm in the stable aggregation state is consistent with the total mass distribution of massive, relaxed galaxy clusters (at least in the range of [Formula: see text]), preventing cuspy problems in the empirical Navarro-Frenk-White profile. This study opens a window to observe the dynamics of stochastic-constrained particles from a third perspective, from which the aggregation effect of particles without gravitation can be saw.

| S-EPMC9935625 | biostudies-literature

An approach for economic analysis of intermodal transportation.

Project description:A different intermodal transportation model based on cost analysis considering technical, economical, and operational parameters is presented. The model consists of such intermodal modes as sea-road, sea-railway, road-railway, and multimode of sea-road-railway. A case study of cargo transportation has been carried out by using the suggested model. Then, the single road transportation mode has been compared to intermodal modes in terms of transportation costs. This comparison takes into account the external costs of intermodal transportation. The research reveals that, in the short distance transportation, single transportation modes always tend to be advantageous. As the transportation distance gets longer, intermodal transportation advantages begin to be effective on the costs. In addition, the proposed method in this study leads to determining the fleet size and capacity for transportation and the appropriate transportation mode.

| S-EPMC4134783 | biostudies-other

A memetic optimization algorithm for multi-constrained multicast routing in ad hoc networks.

Project description:A mobile ad hoc network is a conventional self-configuring network where the routing optimization problem-subject to various Quality-of-Service (QoS) constraints-represents a major challenge. Unlike previously proposed solutions, in this paper, we propose a memetic algorithm (MA) employing an adaptive mutation parameter, to solve the multicast routing problem with higher search ability and computational efficiency. The proposed algorithm utilizes an updated scheme, based on statistical analysis, to estimate the best values for all MA parameters and enhance MA performance. The numerical results show that the proposed MA improved the delay and jitter of the network, while reducing computational complexity as compared to existing algorithms.

| S-EPMC5839550 | biostudies-literature

Tabu search algorithm for the distance-constrained vehicle routing problem with split deliveries by order.

Project description:The vehicle routing problem (VRP) has a wide range of applications in the field of logistics distribution. In order to reduce the cost of logistics distribution, the distance-constrained and capacitated VRP with split deliveries by order (DCVRPSDO) was studied. We show that the customer demand, which can't be split in the classical VRP model, can only be discrete split deliveries by order. A model of double objective programming is constructed by taking the minimum number of vehicles used and minimum vehicle traveling cost as the first and the second objective, respectively. This approach contains a series of constraints, such as single depot, single vehicle type, distance-constrained and load capacity limit, split delivery by order, etc. DCVRPSDO is a new type of VRP. A new tabu search algorithm is designed to solve the problem and the examples testing show the efficiency of the proposed algorithm. This paper focuses on constructing a double objective mathematical programming model for DCVRPSDO and designing an adaptive tabu search algorithm (ATSA) with good performance to solving the problem. The performance of the ATSA is improved by adding some strategies into the search process, including: (a) a strategy of discrete split deliveries by order is used to split the customer demand; (b) a multi-neighborhood structure is designed to enhance the ability of global optimization;

| S-EPMC5953470 | biostudies-literature

SMITH: spatially constrained stochastic model for simulation of intra-tumour heterogeneity.

Project description:MotivationSimulations of cancer evolution are highly useful to study the effects of selection and mutation rates on cellular fitness. However, most methods are either lattice-based and cannot simulate realistically sized tumours, or they omit spatial constraints and lack the clonal dynamics of real-world tumours.ResultsStochastic model of intra-tumour heterogeneity (SMITH) is an efficient and explainable model of cancer evolution that combines a branching process with a new confinement mechanism limiting clonal growth based on the size of the individual clones as well as the overall tumour population. We demonstrate how confinement is sufficient to induce the rich clonal dynamics observed in spatial models and cancer samples across tumour types, while allowing for a clear geometric interpretation and simulation of 1 billion cells within a few minutes on a desktop PC.Availability and implementationSMITH is implemented in C# and freely available at https://bitbucket.org/schwarzlab/smith. For visualizations, we provide the accompanying Python package PyFish at https://bitbucket.org/schwarzlab/pyfish.Supplementary informationSupplementary data are available at Bioinformatics online.

| S-EPMC10010604 | biostudies-literature

Calculating the Malliavin derivative of some stochastic mechanics problems.

Project description:The Malliavin calculus is an extension of the classical calculus of variations from deterministic functions to stochastic processes. In this paper we aim to show in a practical and didactic way how to calculate the Malliavin derivative, the derivative of the expectation of a quantity of interest of a model with respect to its underlying stochastic parameters, for four problems found in mechanics. The non-intrusive approach uses the Malliavin Weight Sampling (MWS) method in conjunction with a standard Monte Carlo method. The models are expressed as ODEs or PDEs and discretised using the finite difference or finite element methods. Specifically, we consider stochastic extensions of; a 1D Kelvin-Voigt viscoelastic model discretised with finite differences, a 1D linear elastic bar, a hyperelastic bar undergoing buckling, and incompressible Navier-Stokes flow around a cylinder, all discretised with finite elements. A further contribution of this paper is an extension of the MWS method to the more difficult case of non-Gaussian random variables and the calculation of second-order derivatives. We provide open-source code for the numerical examples in this paper.

| S-EPMC5738136 | biostudies-literature

An empirical evaluation of a novel domain-specific language - modelling vehicle routing problems with Athos.

Project description:Domain-specific languages (DSLs) are a popular approach among software engineers who demand for a tailored development interface. A DSL-based approach allows to encapsulate the intricacies of the target platform in transformations that turn DSL models into executable software code. Often, DSLs are even claimed to reduce development complexity to a level that allows them to be successfully applied by domain-experts with limited programming knowledge. Recent research has produced some scientifically backed insights on the benefits and limitations of DSLs. Further empirical studies are required to build a sufficient body of knowledge from which support for different claims related to DSLs can be derived. In this research study, we adopt current DSL evaluation approaches to investigate potential gains in terms of effectiveness and efficiency, through the application of our DSL Athos, a language developed for the domain of traffic and transportation simulation and optimisation. We compare Athos to the alternative of using an application library defined within a general-purpose language (GPL). We specified two sets of structurally identical tasks from the domain of vehicle routing problems and asked study groups with differing levels of programming knowledge to solve the tasks with the two approaches. The results show that inexperienced participants achieved considerable gains in effectiveness and efficiency with the usage of Athos DSL. Though hinting at Athos being the more efficient approach, the results were less distinct for more experienced programmers. The vast majority of participants stated to prefer working with Athos over the usage of the presented GPL's API.Supplementary informationThe online version contains supplementary material available at 10.1007/s10664-022-10210-whttps://doi.org/10.1007/s10664-022-10210-w.

| S-EPMC9510508 | biostudies-literature

Benchmark dataset for undirected and Mixed Capacitated Arc Routing Problems under Time restrictions with Intermediate Facilities.

Project description:In this article we present benchmark datasets for the Mixed Capacitated Arc Routing Problem under Time restrictions with Intermediate Facilities (MCARPTIF). The problem is a generalisation of the Capacitated Arc Routing Problem (CARP), and closely represents waste collection routing. Four different test sets are presented, each consisting of multiple instance files, and which can be used to benchmark different solution approaches for the MCARPTIF. An in-depth description of the datasets can be found in "Constructive heuristics for the Mixed Capacity Arc Routing Problem under Time Restrictions with Intermediate Facilities" (Willemseand Joubert, 2016) [2] and "Splitting procedures for the Mixed Capacitated Arc Routing Problem under Time restrictions with Intermediate Facilities" (Willemseand Joubert, in press) [4]. The datasets are publicly available from "Library of benchmark test sets for variants of the Capacitated Arc Routing Problem under Time restrictions with Intermediate Facilities" (Willemse and Joubert, 2016) [3].

| S-EPMC4961348 | biostudies-literature

Model reduction for stochastic CaMKII reaction kinetics in synapses by graph-constrained correlation dynamics.

Project description:A stochastic reaction network model of Ca(2+) dynamics in synapses (Pepke et al PLoS Comput. Biol. 6 e1000675) is expressed and simulated using rule-based reaction modeling notation in dynamical grammars and in MCell. The model tracks the response of calmodulin and CaMKII to calcium influx in synapses. Data from numerically intensive simulations is used to train a reduced model that, out of sample, correctly predicts the evolution of interaction parameters characterizing the instantaneous probability distribution over molecular states in the much larger fine-scale models. The novel model reduction method, 'graph-constrained correlation dynamics', requires a graph of plausible state variables and interactions as input. It parametrically optimizes a set of constant coefficients appearing in differential equations governing the time-varying interaction parameters that determine all correlations between variables in the reduced model at any time slice.

| S-EPMC4489159 | biostudies-literature

Price of information in games of chance: A statistical physics approach.

Project description:Information in the form of data, which can be stored and transferred between users, can be viewed as an intangible commodity, which can be traded in exchange for money. Determining the fair price at which a string of data should be traded is an important and open problem in many settings. In this work we develop a statistical physics framework that allows one to determine analytically the fair price of information exchanged between players in a game of chance. For definiteness, we consider a game where N players bet on the binary outcome of a stochastic process and share the entry fees pot if successful. We assume that one player holds information about past outcomes of the game, which they may either use exclusively to improve their betting strategy or offer to sell to another player. We find a sharp transition as the number of players N is tuned across a critical value, between a phase where the transaction is always profitable for the seller and one where it may not be. In both phases, different regimes are possible, depending on the "quality" of information being put up for sale: we observe symbiotic regimes, where both parties collude effectively to rig the game in their favor, competitive regimes, where the transaction is unappealing to the data holder as it overly favors a competitor for scarce resources, and even prey-predator regimes, where an exploitative data holder could be giving away bad-quality data to undercut a competitor. Our analytical framework can be generalized to more complex settings and constitutes a flexible tool to address the rich and timely problem of pricing information in games of chance.

| S-EPMC7616869 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data