Documents disponibles écrits par cet auteur

An adaptive search for the response time variability problemstar / Samir Salhi in Journal of the operational research society (JORS), Vol. 63 N° 5 (Mai 2012) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 63 N° 5 (Mai 2012) . - pp. 597–605 Titre : An adaptive search for the response time variability problemstar Type de document : texte imprimé Auteurs : Samir Salhi, Auteur ; A. García-Villoria, Auteur Année de publication : 2012 Article en page(s) : pp. 597–605 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Response  time  variability  Heuristics  Adaptive  search  Scheduling  Fair  sequences Index. décimale : 001.424 Résumé : The Response Time Variability Problem (RTVP) is an NP-hard combinatorial scheduling problem, which has recently been reported and formalised in the literature. This problem has a wide range of real-world applications in mixed-model assembly lines, multi-threaded computer systems, broadcast of commercial videotapes and others. The RTVP arises whenever products, clients or jobs need to be sequenced in such a way that the variability in the time between the points at which they receive the necessary resources is minimised. We propose a greedy but adaptive heuristic that avoids being trapped into a poor solution by incorporating a look ahead strategy suitable for this particular scheduling problem. The proposed heuristic outperforms the best existing methods, while being much faster and easier to understand and to implement. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n5/abs/jors201146a.html [article] An adaptive search for the response time variability problemstar [texte imprimé] / Samir Salhi, Auteur ; A. García-Villoria, Auteur . - 2012 . - pp. 597–605. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 63 N° 5 (Mai 2012) . - pp. 597–605 Mots-clés : Response  time  variability  Heuristics  Adaptive  search  Scheduling  Fair  sequences Index. décimale : 001.424 Résumé : The Response Time Variability Problem (RTVP) is an NP-hard combinatorial scheduling problem, which has recently been reported and formalised in the literature. This problem has a wide range of real-world applications in mixed-model assembly lines, multi-threaded computer systems, broadcast of commercial videotapes and others. The RTVP arises whenever products, clients or jobs need to be sequenced in such a way that the variability in the time between the points at which they receive the necessary resources is minimised. We propose a greedy but adaptive heuristic that avoids being trapped into a poor solution by incorporating a look ahead strategy suitable for this particular scheduling problem. The proposed heuristic outperforms the best existing methods, while being much faster and easier to understand and to implement. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n5/abs/jors201146a.html

Fine-tuning a parametric Clarke and Wright heuristic by means of EAGH (empirically adjusted greedy heuristics) / A. Corominas in Journal of the operational research society (JORS), Vol. 61 N° 8 (Août 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 8 (Août 2010) . - pp. 1309–131 Titre : Fine-tuning a parametric Clarke and Wright heuristic by means of EAGH (empirically adjusted greedy heuristics) Type de document : texte imprimé Auteurs : A. Corominas, Auteur ; A. García-Villoria, Auteur ; R. Pastor, Auteur Année de publication : 2011 Article en page(s) : pp. 1309–131 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Fine-tuning  EAGH  Greedy  heuristics  Clarke  and  Wright  savings  heuristic  CVRP Index. décimale : 001.424 Résumé : Altınel and Öncan (2005) (A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem) proposed a parametric Clarke and Wright heuristic to solve the capacitated vehicle routing problem (CVRP). The performance of this parametric heuristic is sensitive to fine-tuning. Antinel and Öncan used an enumerative parameter-setting approach and improved on the results obtained with the original Clarke and Wright heuristic, but their approach requires much more computation time to solve an instance. Battarra et al (2008) (Tuning a parametric Clarke–Wright heuristic through a genetic algorithm) proposed a genetic algorithm to set the parameter values. They succeeded in reducing the time needed to solve an instance, but the quality of the solution was slightly worse. In this paper, we propose to use the EAGH (empirically adjusted greedy heuristics) procedure to set the parameter values. A computational experiment shows the efficiency of EAGH; in an even shorter time, we improve on the best results obtained with any parametric Clarke and Wright heuristic method proposed in the literature. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n8/abs/jors200989a.html [article] Fine-tuning a parametric Clarke and Wright heuristic by means of EAGH (empirically adjusted greedy heuristics) [texte imprimé] / A. Corominas, Auteur ; A. García-Villoria, Auteur ; R. Pastor, Auteur . - 2011 . - pp. 1309–131. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 8 (Août 2010) . - pp. 1309–131 Mots-clés : Fine-tuning  EAGH  Greedy  heuristics  Clarke  and  Wright  savings  heuristic  CVRP Index. décimale : 001.424 Résumé : Altınel and Öncan (2005) (A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem) proposed a parametric Clarke and Wright heuristic to solve the capacitated vehicle routing problem (CVRP). The performance of this parametric heuristic is sensitive to fine-tuning. Antinel and Öncan used an enumerative parameter-setting approach and improved on the results obtained with the original Clarke and Wright heuristic, but their approach requires much more computation time to solve an instance. Battarra et al (2008) (Tuning a parametric Clarke–Wright heuristic through a genetic algorithm) proposed a genetic algorithm to set the parameter values. They succeeded in reducing the time needed to solve an instance, but the quality of the solution was slightly worse. In this paper, we propose to use the EAGH (empirically adjusted greedy heuristics) procedure to set the parameter values. A computational experiment shows the efficiency of EAGH; in an even shorter time, we improve on the best results obtained with any parametric Clarke and Wright heuristic method proposed in the literature. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n8/abs/jors200989a.html