Affiner les résultats

Institution

Collection spécifique

Langue

Haute école de gestion de Genève

Vehicle routing for a complex waste collection problem

Markov, Ilya ; Varone, Sacha ; Bierlaire, Michel

In: Proceedings of the 14th Swiss Transport Research Conference, Monte Verità - Ascona, May 14-16 2014, 2014, p. 27 p.

We consider a complex waste collection problem, where the residents of a certain region dispose of recyclable waste, which is collected using a fixed heterogeneous fleet of vehicles with different volume and weight capacities, fixed costs, unit distance running costs and hourly driver wage rates. Each tour starts and ends at one of several depots, not necessarily the same, and is a sequence of...

Haute école de gestion de Genève

Vehicle routing for a complex waste collection problem

Markov, Ilya ; Varone, Sacha ; Bierlaire, Michel

In: Proceedings of the 14th Swiss Transport Research Conference, Monte Verità - Ascona, May 14-16 2014, 2014, p. 1-27

We consider a complex waste collection problem, where the residents of a certain region dispose of recyclable waste, which is collected using a fixed heterogeneous fleet of vehicles with different volume and weight capacities, fixed costs, unit distance running costs and hourly driver wage rates. Each tour starts and ends at one of several depots, not necessarily the same, and is a sequence of...

Haute école de gestion de Genève

On a many-to-one shortest paths for a taxi service

Varone, Sacha

Nous décrivons un algorithme de type Dijkstra appliqué à des cartes géographiques, nécessaire à une application à temps réel pour une compagnie de taxis. Le problème qui est résolu consiste en une demande de client reçu par une société de taxi, qui doit répondre à cette demande en affectant l'un de ses taxis, tel qu'un temps d'attente maximal ne soit pas dépassé pour prendre en...

Haute école de gestion de Genève

Management of emergency response teams under stochastic demands

Iliya, Markov ; Varone, Sacha

In: International Conference on Operations Research and Enterprise Systems (ICORES) 2013

We propose a stochastic optimization model for the composition of emergency response teams. An emergency intervention requires first an evaluation of the situation which results in the need of different skills. People involved in the response team must therefore comply with the required skills, be available, with a past and future workload respecting contractual compliance. In addition, we must...

Haute école de gestion de Genève

Course opening, assignment and timetabling with student preferences

Varone, Sacha ; Schindl, David

In: International Conference on Operations Research and Enterprise Systems (ICORES) 2013

We consider the following problem of course scheduling and assignment of students. Students express their preferences for each course from several sets of proposed courses and each student has to take a certain number of courses from each set. A minimum number of students is required to open a course and a maximum number of students is specified for each course. The courses have to be scheduled...

Haute école de gestion de Genève

Service design needs for luxury e-commerce : an empirical study

Broillet, Alexandra ; Dubosson, Magali ; Varone, Sacha

In: Proceedings of the 2009 IEEE/INFORMS International Conference on Service Operations, Logistics and Informatics, 2009, p. 244-248

Nowadays, we are just in the launching phase of luxury e-business, it is not clear whether it should be served with a luxury service from a physical shop, or not. Do consumers especially wish a pre- and after-sales service which is taken in charge by a physical shop while buying on the official luxury Website? After the opinion of luxury bloggers, we do know that there is a need for luxury...

Haute école de gestion de Genève

The metric cutpoint partition problem

Hertz, Alain ; Varone, Sacha

In: Journal of classification, 2008, vol. 25, no. 2, p. 159-175

Let G = (V, E,w) be a graph with vertex and edge sets V and E, respectively, and w: E → a function which assigns a positive weight or length to each edge of G. G is called a realization of a finite metric space (M, d), with M = {1, ..., n} if and only if {1, ..., n} ⊆ V and d(i, j) is equal to the length of the shortest chain linking i and j in G ∀i, j = 1, ..., n. A realization...

Haute école de gestion de Genève

The metric bridge partition problem : partitioning of a metric space into two subspaces linked by an edge in any optimal realization

Hertz, Alain ; Varone, Sacha

In: Journal of classification, 2007, vol. 24, no. 2, p. 235-249

Let G = (V,E,w) be a graph with vertex and edge sets V and E, respectively, and w:E → R + a function which assigns a positive weight or length to each edge of G. G is called a realization of a finite metric space (M,d), with M = { 1,...,n} if and only if { 1,...,n} ⫅ V and d(i,j) is equal to the length of the shortest chain linking i and j in G ∀ i,j = 1,...,n. A realization G of (M,d), is...

Haute école de gestion de Genève

An ant algorithm for the Steiner Tree Problem in graphs

Luyet, Luc ; Varone, Sacha ; Zufferey, Nicolas

In: Applications of evolutionary computing, Lecture notes in computer science, 2007, vol. 4448, p. 42-51

The Steiner Tree Problem (STP) in graphs is a well-known NP-hard problem. It has regained attention due to the introduction of new telecommunication technologies, since it is the mathematical structure behind multi-cast communications. The goal of this paper is to design an ant algorithm (called ANT-STP) for the STP in graphs which is better than TM, which is a greedy constructive method for the...

Haute école de gestion de Genève

A constructive algorithm for realizing a distance matrix

Varone, Sacha

In: European Journal of Operational Research

The natural metric of a weighted graph is the length of the shortest paths between all pairs of vertices. The investigated problem consists in a representation of a given metric by a graph, such that the total length of the graph is minimized. For that purpose, we give a constructive algorithm based on a technique of reduction, fusion and deletion. We then show some results on a set of various...