All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1 Next

Displaying 1 – 20 of 25

Showing per page

Balancing the stations of a self service “bike hire” system

Mike Benchimol, Pascal Benchimol, Benoît Chappert, Arnaud de la Taille, Fabien Laroche, Frédéric Meunier, Ludovic Robinet (2011)

RAIRO - Operations Research

This paper is motivated by operating self service transport systems that flourish nowadays. In cities where such systems have been set up with bikes, trucks travel to maintain a suitable number of bikes per station. It is natural to study a version of the C-delivery TSP defined by Chalasani and Motwani in which, unlike their definition, C is part of the input: each vertex v of a graph G=(V,E) has a certain amount xv of a commodity and wishes to have an amount equal to yv (we assume that ∑ v ∈ V x v = ∑ v ∈ V y v and all quantities...

Balancing the stations of a self service “bike hire” system

Mike Benchimol, Pascal Benchimol, Benoît Chappert, Arnaud de la Taille, Fabien Laroche, Frédéric Meunier, Ludovic Robinet (2011)

RAIRO - Operations Research

This paper is motivated by operating self service transport systems that flourish nowadays. In cities where such systems have been set up with bikes, trucks travel to maintain a suitable number of bikes per station. It is natural to study a version of the C-delivery TSP defined by Chalasani and Motwani in which, unlike their definition, C is part of the input: each vertex v of a graph G=(V,E) has a certain amount xv of a commodity and wishes to have an amount equal to yv (we assume that ∑ v ∈ V x v = ∑ v ∈ V y v and all quantities...

Batch scheduling problem with due-date and fuzzy precedence relation

Xuesong Li, Hiroaki Ishii, Minghao Chen (2012)

Kybernetika

A single-machine batch scheduling problem is investigated. Each job has a positive processing time and due-date. Setup times are assumed to be identical for all batches. All batch sizes cannot exceed a common upper bound. As in many practical situations, jobs have to be subject to flexible precedence constraints. The aim of this paper is to find an optimal batch sequence. The sequence is to minimize the maximal completion time and maximize the minimum value of desirability of the fuzzy precedence....

Belief functions induced by multimodal probability density functions, an application to the search and rescue problem

P.-E. Doré, A. Martin, I. Abi-Zeid, A.-L. Jousselme, P. Maupin (2010)

RAIRO - Operations Research - Recherche Opérationnelle

In this paper, we propose a new method to generate a continuous belief functions from a multimodal probability distribution function defined over a continuous domain. We generalize Smets' approach in the sense that focal elements of the resulting continuous belief function can be disjoint sets of the extended real space of dimension n. We then derive the continuous belief function from multimodal probability density functions using the least commitment principle. We illustrate the approach on two...

Belief functions induced by multimodal probability density functions, an application to the search and rescue problem

P.-E. Doré, A. Martin, I. Abi-Zeid, A.-L. Jousselme, P. Maupin (2011)

RAIRO - Operations Research

In this paper, we propose a new method to generate a continuous belief functions from a multimodal probability distribution function defined over a continuous domain. We generalize Smets' approach in the sense that focal elements of the resulting continuous belief function can be disjoint sets of the extended real space of dimension n. We then derive the continuous belief function from multimodal probability density functions using the least commitment principle. We illustrate the approach on two...

Bi-directional nearness in a network by AHP (Analytic Hierarchy Process) and ANP (Analytic Network Process)

Kazutomo Nishizawa (2010)

RAIRO - Operations Research

In this paper we study bi-directional nearness in a network based on AHP (Analytic Hierarchy Process) and ANP (Analytic Network Process). Usually we use forward (one-dimensional) direction nearness based on Euclidean distance. Even if the nearest point to i is point j, the nearest point to j is not necessarily point i. Sowe propose the concept of bi-directional nearness defined by AHP'ssynthesizing of weights “for” direction and “from” direction. This concept of distance is a relative distance...

Binary integer programming solution for troubleshooting with dependent actions

Václav Lín (2017)

Kybernetika

We deal with a sequencing problem that arises when there are multiple repair actions available to fix a broken man-made system and the true cause of the system failure is uncertain. The system is formally described by a probabilistic model, and it is to be repaired by a sequence of troubleshooting actions designed to identify the cause of the malfunction and fix the system. The task is to find a course of repair with minimal expected cost. We propose a binary integer programming formulation for...

Bounded expansion in web graphs

Silvia Gago, Dirk Schlatter (2009)

Commentationes Mathematicae Universitatis Carolinae

In this paper we study various models for web graphs with respect to bounded expansion. All the deterministic models even have constant expansion, whereas the copying model has unbounded expansion. The most interesting case turns out to be the preferential attachment model --- which we conjecture to have unbounded expansion, too.

Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions

Imed Kacem, Nizar Souayah, Mohamed Haouari (2012)

RAIRO - Operations Research

This paper deals with the parallel-machine scheduling problem with the aim of minimizing the total (weighted) tardiness under the assumption of different release dates. This problem has been proven to be NP-hard. We introduce some new lower and upper bounds based on different approaches. We propose a branch-and-bound algorithm to solve the weighted and unweighted total tardiness. Computational experiments were performed on a large set of instances...

Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions

Imed Kacem, Nizar Souayah, Mohamed Haouari (2012)

RAIRO - Operations Research

This paper deals with the parallel-machine scheduling problem with the aim of minimizing the total (weighted) tardiness under the assumption of different release dates. This problem has been proven to be NP-hard. We introduce some new lower and upper bounds based on different approaches. We propose a branch-and-bound algorithm to solve the weighted and unweighted total tardiness. Computational experiments were performed on a large set of instances...

Currently displaying 1 – 20 of 25

Page 1 Next