Documents disponibles écrits par cet auteur

Optimizing vehicle routes in a bakery company allowing flexibility in delivery dates / Pacheco, J. 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. 569–581 Titre : Optimizing vehicle routes in a bakery company allowing flexibility in delivery dates Type de document : texte imprimé Auteurs : Pacheco, J., Auteur ; A. Alvarez, Auteur ; I. García, Auteur Année de publication : 2012 Article en page(s) : pp. 569–581 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : VRP  with  flexibility  in  delivery  Metaheuristics  GRASP  Path  relinking Index. décimale : 001.424 Résumé : The work addressed in this paper is motivated from a real problem proposed to the authors by a bakery company in Northern Spain. The objective is to minimize the total distance travelled for the daily routes over the week. In order to reduce this total distance, some flexibility in the dates of delivery is introduced. A mixed-integer linear model for the problem is formulated. In addition, a two-phase method based in GRASP and path-relinking metaheuristic strategies is proposed. Computational experiments show that the method performs very well, obtaining high-quality solutions in short computational times. Moreover, when it is applied to real-data-based instances, the obtained solutions considerably reduce transportation costs over the planning horizon. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n5/abs/jors201151a.html [article] Optimizing vehicle routes in a bakery company allowing flexibility in delivery dates [texte imprimé] / Pacheco, J., Auteur ; A. Alvarez, Auteur ; I. García, Auteur . - 2012 . - pp. 569–581. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 63 N° 5 (Mai 2012) . - pp. 569–581 Mots-clés : VRP  with  flexibility  in  delivery  Metaheuristics  GRASP  Path  relinking Index. décimale : 001.424 Résumé : The work addressed in this paper is motivated from a real problem proposed to the authors by a bakery company in Northern Spain. The objective is to minimize the total distance travelled for the daily routes over the week. In order to reduce this total distance, some flexibility in the dates of delivery is introduced. A mixed-integer linear model for the problem is formulated. In addition, a two-phase method based in GRASP and path-relinking metaheuristic strategies is proposed. Computational experiments show that the method performs very well, obtaining high-quality solutions in short computational times. Moreover, when it is applied to real-data-based instances, the obtained solutions considerably reduce transportation costs over the planning horizon. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n5/abs/jors201151a.html

Use of VNS heuristics for scheduling of patients in hospital / Vlah, S. in Journal of the operational research society (JORS), Vol. 62 N° 7 (Juillet 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 7 (Juillet 2011) . - pp. 1227–1238 Titre : Use of VNS heuristics for scheduling of patients in hospital Type de document : texte imprimé Auteurs : Vlah, S., Auteur ; Lukac, Z., Auteur ; Pacheco, J., Auteur Année de publication : 2011 Article en page(s) : pp. 1227–1238 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Health  service  Scheduling  Hospitals  Heuristics  Reduced  VNS Index. décimale : 001.424 Résumé : One of the important problems in hospital management is how to schedule the treatments of resident patients in hospital for a given day due to the restrictions imposed by their medical condition as well as restrictions on medical machines and qualified medical personnel availability. Patients are to be subjected to different kinds of treatments, each requiring a medical machine of a certain type as well as a physician being qualified to operate it. This is a highly complex problem not yet adequately addressed in the literature. At present in most hospitals the problem is being solved manually by specialized personnel. However, the resulting schedules are very often inaccurate and inefficient with patients waiting for a long time to be treated and medical personnel often working overtime. In this paper we formulate the model for this problem and develop a simple and efficient method based on Variable Neighbourhood Search for solving it. The heuristics has been tested on real-life as well as on generated instances. Numerical results show that the heuristics proposed outperform commercial software for optimization as well as manual solutions both in quality of solution and in computational time. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n7/abs/jors201073a.html [article] Use of VNS heuristics for scheduling of patients in hospital [texte imprimé] / Vlah, S., Auteur ; Lukac, Z., Auteur ; Pacheco, J., Auteur . - 2011 . - pp. 1227–1238. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 7 (Juillet 2011) . - pp. 1227–1238 Mots-clés : Health  service  Scheduling  Hospitals  Heuristics  Reduced  VNS Index. décimale : 001.424 Résumé : One of the important problems in hospital management is how to schedule the treatments of resident patients in hospital for a given day due to the restrictions imposed by their medical condition as well as restrictions on medical machines and qualified medical personnel availability. Patients are to be subjected to different kinds of treatments, each requiring a medical machine of a certain type as well as a physician being qualified to operate it. This is a highly complex problem not yet adequately addressed in the literature. At present in most hospitals the problem is being solved manually by specialized personnel. However, the resulting schedules are very often inaccurate and inefficient with patients waiting for a long time to be treated and medical personnel often working overtime. In this paper we formulate the model for this problem and develop a simple and efficient method based on Variable Neighbourhood Search for solving it. The heuristics has been tested on real-life as well as on generated instances. Numerical results show that the heuristics proposed outperform commercial software for optimization as well as manual solutions both in quality of solution and in computational time. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n7/abs/jors201073a.html