14documents trouvés
A branch-and -price algorithm for the multi vehicle covering tour problem
N.JOZEFOWIEZ
MOGISA
Rapport LAAS N°12686, Décembre 2012, 13p.
Diffusable
128776The bi-objective multi-vehicle covering tour problem: formulation and lower bound by column generation
B.M.SARPONG, C.ARTIGUES, N.JOZEFOWIEZ
MOGISA
Rapport Local N°12562, 22p.
Diffusable
128266Multi-objective optimization for selecting and scheduling observations
P.TANGPATTANAKUL, N.JOZEFOWIEZ, P.LOPEZ
MOGISA
Manifestation avec acte : International Conference on Parallel Problem Solving From Nature (PPSN 2012), Taormina (Italie), 1-5 Septembre 2012, 10p. , N° 12340
Lien : http://hal.archives-ouvertes.fr/hal-00711545
Diffusable
Plus d'informations
Abstract
This paper presents a biased random-key genetic algorithm for solving a multi-objective optimization problem concerning the management of agile Earth observing satellites. It addresses the selection and scheduling of a subset of photographs from a set of candidates in order to optimize two objectives: maximizing the total profit, and ensuring fairness among users by minimizing the maximum profit difference between users. Two methods, one based on dominance, the other based on indicator, are compared to select the preferred solutions. The methods are evaluated on realistic instances derived from the 2003 ROADEF challenge.
A generic branch-and-cut algorithm for multi-objective optimization problems: Application to the multi-modal traveling salesman problem
N.JOZEFOWIEZ, G.LAPORTE, F.SEMET
MOGISA, CIRRELT, LAGIS
Revue Scientifique : INFORMS Journal on Computing, Vol.24, N°4, pp.554-564, Septembre 2012, doi:10.1287/ijoc.1110.0476 , N° 09551
Diffusable
127141The bi-objective multi-vehicle covering tour problem: formulation and lower bound
B.M.SARPONG, C.ARTIGUES, N.JOZEFOWIEZ
MOGISA
Manifestation avec acte : International Workshop on Freight Transportation and Logistics ( ODYSSEUS ) 2012 du 21 mai au 25 mai 2012, Mykonos (Grèce), 2012, 5p. , N° 12675
Diffusable
128731Optimisation multi-objectif des prises de vues d'un satellite agile d'observation de la terre
P.TANGPATTANAKUL, N.JOZEFOWIEZ, P.LOPEZ
MOGISA
Manifestation sans acte : Congrès Annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 2012), Angers (France), 11-13 Avril 2012, 2p. , N° 12174
Diffusable
126984Evaluation des performances des solveurs de programmation linéaire sur le problème du rendez-vous orbital impulsionnel
D.ARZELIER, N.JOZEFOWIEZ, P.LOPEZ, C.LOUEMBET
MAC, MOGISA
Rapport de Contrat : Convention CNES N° 104057/00, Novembre 2011, 43p. , N° 11605
Diffusable
125804A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants
N.JOZEFOWIEZ, G.LAPORTE, F.SEMET
MOGISA, CIRRELT, LAGIS
Revue Scientifique : Computers & Operations Research, Vol.38, N°11, pp.1534-1542, Novembre 2011 , N° 10233
Diffusable
124365A Branch-and-Price algorithm for the windy rural postman problem
H.AFSAR, N.JOZEFOWIEZ, P.LOPEZ
MOGISA
Revue Scientifique : RAIRO : Operations Research, Vol.45, N°4, pp.353-364, Octobre 2011 , N° 11842
Lien : http://hal.archives-ouvertes.fr/hal-00676778
Diffusable
Plus d'informations
Abstract
In this paper, we propose an exact solution method for the Windy Rural Postman Problem (WRPP). The motivation to study this problem comes from some real-life applications, such as garbage collecting in a predefined sector with hills, where the traversing or the servicing speed can change following the direction. We present a Dantzig-Wolfe decomposition and a branch-and-price algorithm to solve the WRPP. To the best of our knowledge, Dantzig-Wolfe decomposition has never been used to solve that problem. The numerical results show that optimal solutions are found in a very reasonable amount of time on instances with up to 100 nodes and 180 edges.
Etude bibliographique sur la programmation linéaire
D.ARZELIER, N.JOZEFOWIEZ, P.LOPEZ, C.LOUEMBET
MAC, MOGISA
Rapport de Contrat : Convention CNES n° 104057/00, Mars 2011, 85p. , N° 11124
Diffusable
124195