Filters








56,437 Hits in 5.4 sec

Two-Stage Robust Optimization for the Orienteering Problem with Stochastic Weights

Ke Shang, Felix T. S. Chan, Stephen Karungaru, Kenji Terada, Zuren Feng, Liangjun Ke, Hiroki Sayama
2020 Complexity  
In this paper, the two-stage orienteering problem with stochastic weights is studied, where the first-stage problem is to plan a path under the uncertain environment and the second-stage problem is a recourse  ...  A case study is presented by comparing the two-stage robust models with a one-stage robust model for the orienteering problem with stochastic weights.  ...  KQTD2016112514355531), and the Program for University Key Laboratory of Guangdong Province (Grant no. 2017KSYS008).  ... 
doi:10.1155/2020/5649821 fatcat:fhfuc3zssjduzdxe7cwmqew4hi

A multi-start simheuristic for the stochastic two-dimensional vehicle routing problem

Daniel Guimarans, Oscar Dominguez, Angel A. Juan, Enoc Martinez
2016 2016 Winter Simulation Conference (WSC)  
With the goal of minimizing total expected cost, we use this methodology to solve a set of stochastic instances of the 2L-VRP with unrestricted oriented loading.  ...  Monte Carlo simulation is used to deal with uncertainty at different stages of the search process.  ...  In order to deal with the stochastic nature of the problem, we embed Monte Carlo simulation at two stages of the search.  ... 
doi:10.1109/wsc.2016.7822273 dblp:conf/wsc/GuimaransRJM16 fatcat:fplflogrsrgqllmd5mctir4rcy

Two-stage robust optimization for orienteering problem with stochastic weights [article]

Ke Shang, Felix T.S. Chan, Stephen Karungaru, Kenji Terada, Zuren Feng, Liangjun Ke
2017 arXiv   pre-print
In this paper, the two-stage orienteering problem with stochastic weights (OPSW) is considered, where the first-stage problem is to plan a path under the uncertain environment and the second-stage problem  ...  A case study is presented by comparing the two-stage robust models with an one-stage robust model for OPSW.  ...  The two-stage orienteering problem with stochastic weights Suppose the weight of each arc (i, j) is stochastic and uncertain, denote the stochastic weight of arc (i, j) asd ij .  ... 
arXiv:1701.00090v3 fatcat:f2jxytosnzchjey6k4yhvfqj4a

Object-of-interest extraction by integrating stochastic inference with learnt active shape sketch

Hongwei Li, Liang Lin, Tianfu Wu, Xiaobai Liu, Lanfang Dong
2008 Pattern Recognition (ICPR), Proceedings of the International Conference on  
The extraction stage utilizes a stochastic Markov Chain Monte Carlo (MCMC) algorithm under the Bayesian framework.  ...  This article presents a novel integrated approach to object of interest extraction, including learning to define target pattern and extracting by combining detection and segmentation.  ...  If a curve crosses a base with the same orientation, it will cross more pixels on the base than the curves which not follow the orientation. Fig.3(b) shows the rough idea of our approach.  ... 
doi:10.1109/icpr.2008.4761329 dblp:conf/icpr/LiLWLD08 fatcat:tb7yr5uzavbrbk6b7bdispvc5a

RISK-AVERSE STOCHASTIC ORIENTEERING PROBLEMS

Özlem Çavuş
2019 Eskişehir Technical University Journal of Science and Technology A - Applied Sciences and Engineering  
To handle this, for the orienteering problems with stochastic travel times or stochastic rewards, we suggest two different formulations with an objective of coherent measures of risk.  ...  In this study, we consider risk-averse orienteering problems with stochastic travel times or stochastic rewards.  ...  The problem is modeled as a two-stage stochastic programing model with time windows. The tour is constructed in the first stage.  ... 
doi:10.18038/estubtda.540384 fatcat:6sklj4xdlncuznzdfq4ognqwpa

Bi-Objective Two-Stage Decision-Making Process for Service Marketing

Hamed Fazlollahtabar, Ermia Aghasi, Peter Forte
2012 International Journal of Strategic Decision Sciences  
The first stage of the authors' proposed process is to evaluate the services with respect to certain criteria using a stochastic multi-criteria acceptability analysis.  ...  The authors propose a bi-objective two-stage decision-making process to help the marketing team of a company to determine which services make more profit.  ...  The remainder of our work is organized as follows. Next we review the related literature. The problem is defined in the upcoming section. Afterwards, we model the problem in a two-stage process.  ... 
doi:10.4018/jsds.2012070103 fatcat:75v6zrcusjegvhkr2dkpjz7pre

Stochastic Survivable Network Design Problems

Ivana Ljubić, Petra Mutzel, Bernd Zey
2013 Electronic Notes in Discrete Mathematics  
We study survivable network design problems with edge-connectivity requirements under a two-stage stochastic model with recourse and finitely many scenarios.  ...  In order to accelerate the computations, we suggest a new technique for strengthening the decomposed Lshaped optimality cuts which is computationally fast and easy to implement.  ...  Practice: The SSNDP belongs to a broader class of two-stage integer stochastic programs with binary first stage solutions and binary recourse.  ... 
doi:10.1016/j.endm.2013.05.099 fatcat:dk4lodzcjza7vhzuolamwtcjgq

Stochastic survivable network design problems: Theory and practice

Ivana Ljubić, Petra Mutzel, Bernd Zey
2017 European Journal of Operational Research  
We study survivable network design problems with edge-connectivity requirements under a two-stage stochastic model with recourse and finitely many scenarios.  ...  In order to accelerate the computations, we suggest a new technique for strengthening the decomposed Lshaped optimality cuts which is computationally fast and easy to implement.  ...  Practice: The SSNDP belongs to a broader class of two-stage integer stochastic programs with binary first stage solutions and binary recourse.  ... 
doi:10.1016/j.ejor.2016.06.048 fatcat:xs5zrpwe5jgkvclv5jhbccj35e

A Two-stage Stochastic Programming Approach for Aircraft Landing Problem

Ming Liu, Bian Liang, Feifeng Zheng, Chengbin Chu, Feng Chu
2018 2018 15th International Conference on Service Systems and Service Management (ICSSSM)  
This paper considers a two-stage stochastic programming problem for airport runway scheduling under the uncertainty of arrival time on a single runway.  ...  to positions in the weight class sequence in the second stage.  ...  The work was also supported by the Fundamental Research Funds for the Central Universities.  ... 
doi:10.1109/icsssm.2018.8465107 fatcat:k5y7efafczheniup3gqgyuxnuy

Development of opened-network data envelopment analysis models under uncertainty

Hasan Hosseini-Nasab, Vahid Ettehadi
2022 Journal of Industrial and Management Optimization  
The proposed models have been used to evaluate the efficiency of 10 two-stage processes, seller and buyer in a supply chain, and the impact of data uncertainty is examined.  ...  The results obtained from the developed models have been compared with the results of traditional DEA network models. The validity and accuracy of the developed models have also been examined.  ...  Wang and Wei developed robust CCR models in two input-oriented and output-oriented according to Ben-Tal and Nimrovski approach.  ... 
doi:10.3934/jimo.2022027 fatcat:hrr2iavhlzdmhbta7ughabrnba

Oriented Stochastic Data Envelopment Models: Ranking Comparison to Stochastic Frontier Approach

František Brázdik
2005 Social Science Research Network  
The computed scores are compared to the stochastic frontier approach scores by Druska and Horrace (2004) and weak ranking consistency with results of stochastic frontier method is observed.  ...  Results of data envelopment analysis sensitively respond to stochastic noise in the data.  ...  To merge these stages in one optimization problem, the non-Archimedean is used as a weight for the second stage objective function.  ... 
doi:10.2139/ssrn.870553 fatcat:4oydotlcpnh4poqelk7a7bvefq

A two-phase multi criteria dynamic programing approach for personnel selection process

Asli Özdemir
2013 Problems and Perspectives in Management  
The problem can be divided into stages, with a policy decision required at each stage. Each stage has a number of states associated with the beginning of that stage.  ...  However in stochastic DP problems there is a probability for what the next state of the system will be in the next stage.  ... 
doaj:06da5138131b48a4b99dd25a2eb9131b fatcat:5ogcytwirfagpmsfkp3dovvyfe

A branch-and-Benders-cut algorithm for a bi-objective stochastic facility location problem [article]

Sophie N. Parragh, Fabien Tricoire, Walter Gutjahr
2020 arXiv   pre-print
In order to solve the underlying optimization problem, we apply a Benders' type decomposition approach which is known as the L-shaped method for stochastic programming and we embed it into a recently developed  ...  Finally, we compare the branch-and-Benders-cut approach to a straight-forward branch-and-bound implementation based on the deterministic equivalent formulation.  ...  Acknowledgments This work has been funded by the Austrian Science Fund (FWF): P31366 and P23589. This support is gratefully acknowledged.  ... 
arXiv:2004.11248v1 fatcat:fw6afuuofjesjnkv36zao7ikim

Orienting (hyper)graphs under explorable stochastic uncertainty [article]

Evripidis Bampis, Christoph Dürr, Thomas Erlebach, Murilo S. de Lima, Nicole Megow, Jens Schlöter
2021 arXiv   pre-print
Given a hypergraph with uncertain node weights following known probability distributions, we study the problem of querying as few nodes as possible until the identity of a node with minimum weight can  ...  Querying a node has a cost and reveals the precise weight of the node, drawn from the given probability distribution.  ...  No strict two-stage algorithm can have competitive ratio o(log n) for the hypergraph orientation problem, even for a single hyperedge with uniform query costs. Proof.  ... 
arXiv:2107.00572v1 fatcat:3xx6573zwzcc5ekoqcfwxy3ipq

Integral Optimization of the Container Loading Problem [chapter]

Rafael Garca-Cceres, Carlos Vega-Meja, Juan Caballero-Villalobos
2011 Stochastic Optimization - Seeing the Optimal for the Uncertain  
IAM adapts well to stochastic optimization problems, thus allowing the development of more complex and natural models, which are therefore closer to actual problem contexts.  ...  Integral optimization of the problem The quantitative analysis proposes a mathematical programming model and a heuristic method to solve the CLP.  ...  Bortfeldt et al. (2003) A Tabu Search metaheuristic is applied as a solution, making use of a Block Building approach which groups the boxes according to their orientation constraints.  ... 
doi:10.5772/15744 fatcat:xgtewfhgtferxpuprav3qwgw7a
« Previous Showing results 1 — 15 out of 56,437 results