14documents trouvés
An exact method for the bi-objective one-machine problem with maximum lateness and unit family setup cost objectives
C.ARTIGUES, N.JOZEFOWIEZ, M.A.ALOULOU
MOGISA, LAMSADE
Revue Scientifique : Electronic Notes in Discrete Mathematics, Vol.36, pp.1233-1240, Août 2010 , N° 10484
Lien : http://hal.archives-ouvertes.fr/hal-00492202/fr/
Diffusable
123767A heuristic approach based on shortest path problems for integrated flight, aircraft and passenger rescheduling under disruptions
N.JOZEFOWIEZ, C.MANCEL, F.MORA CAMINO
MOGISA, ENAC, DISCO
Rapport LAAS N°10183, Mars 2010, 17p.
Diffusable
120957An exact method for the bi-objective one-machine problem with maximum lateness and unit family setup cost objectives
C.ARTIGUES, N.JOZEFOWIEZ, M.A.ALOULOU
MOGISA, LAMSADE
Manifestation avec acte : International Symposium on Combinatorial Optimization (ISCO 2010), Hammamet (Tunisie), 24-26 Mars 2010, 8p. , N° 10484
Lien : http://hal.archives-ouvertes.fr/hal-00492202/fr/
Diffusable
122260On the integration of a TSP heuristic into an EA for the bi-objective ring star problem
A.LIEFOOGHE, L.JOURDAN, N.JOZEFOWIEZ, E.G.TALBI
LIFL, MOGISA
Manifestation avec acte : International Workshop on Hybrid Metaheuristics (HM 2008), Malaga (Espagne), 8-9 Octobre 2008, pp.117-130 , N° 08643
Lien : http://hal.inria.fr/inria-00326372/fr/
Diffusable
Plus d'informations
Abstract
This paper discusses a new hybrid solution method for a bi-objective routing problem, namely the bi-objective ring star problem. The bi-objective ring star problem is a generalization of the ring star problem in which the assignment cost has been dissociated from the cost of visiting a subset of nodes. Here, we investigate the possible contribution of incorporating specialized TSP heuristics into a multiobjective evolutionary algorithm. Experiments show that the use of this hybridization scheme allows a strict improvement of the generated sets of non-dominated solutions.