نتایج جستجو برای: stochastic demands

تعداد نتایج: 188893  

Journal: :Computers & OR 2010
Jorge E. Mendoza Bruno Castanier Christelle Guéret Andrés L. Medaglia Nubia Velasco

The Multi-Compartment Vehicle Routing Problem (MC-VRP) consists of designing transportation routes to satisfy the demands of a set of costumers for several products that because of incompatibility constraints must be loaded on independent vehicle compartments. Despite its wide practical applicability the MC-VRP has not received much attention in the literature, and the few existing methods assu...

2012
Angélica Muñoz-Meléndez Prithiviraj Dasgupta William Lenagh

A central problem in multi-robot systems is to solve the multi-robot task allocation problem. In this paper, a decentralized stochastic model based on stochastic queueing processes is applied for an application of collective detection of underground landmines where the robots are not told the distribution or number of landmines to be encountered in the environment. Repeat demands of inspection ...

2015
Lijian Chen Dengfeng Sun Wen-Chyuan Chiang Shuguang He

We study stochastic programming formulations for the origindestination model in airline seat allocation under uncertainty. In particular, we focus on solving the stability issues of the traditional probabilistic model by purposefully underestimating the demands. The stochastic seat allocation models assume at least the possession of the distributional information, which is usually difficult to ...

Journal: :Computers & Industrial Engineering 2003
Jian Zhou Baoding Liu

Capacitated location-allocation problem with stochastic demands is originally formulated as expected value model, chance-constrained programming and dependent-chance programming according to different criteria. For solving these stochastic models efficiently, the network simplex algorithm, stochastic simulation and genetic algorithm are integrated to produce a hybrid intelligent algorithm. Fina...

Journal: :Electronic Notes in Discrete Mathematics 2016
Benjamin Biesinger Bin Hu Günther R. Raidl

In this work we consider the generalized vehicle routing problem with stochastic demands (GVRPSD). This NP-hard problem combines the clustering aspect of the generalized vehicle routing problem with the uncertainty aspect of the vehicle routing problem with stochastic demands. We propose an integer L-shaped method based on decomposition and branch-and-cut. The subproblem of computing the restoc...

Journal: :Queueing Systems 2023

Abstract We compare stability regions for different power flow models in the process of charging electric vehicles (EVs) by considering their random arrivals, stochastic demand energy at stations, and characteristics electricity distribution network. assume network is a line with stations located on it. consider Distflow Linearized models, we that EVs have an exponential requirement, voltage dr...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید