Dépouillements

Some applications of the generalized vehicle routing problem / R. Baldacci in Journal of the operational research society (JORS), Vol. 61 N° 7 (Juillet 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 7 (Juillet 2010) . - pp. 1072–1077 Titre : Some applications of the generalized vehicle routing problem Type de document : texte imprimé Auteurs : R. Baldacci, Auteur ; E. Bartolini, Auteur ; G. Laporte, Auteur Année de publication : 2011 Article en page(s) : pp. 1072–1077 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Generalized  Vehicle  routing  problem  Models  Applications Index. décimale : 001.424 Résumé : The Generalized Vehicle Routing Problem (GVRP) is an extension of the classical Vehicle Routing Problem (VRP) in which the vertex set is partitioned into clusters and vehicles must visit exactly one (or at least one) vertex per cluster. The GVRP provides a useful modelling framework for a wide variety of applications. The purpose of this paper is to provide such examples of applications and models. These include the Travelling Salesman with Profits, several VRP extensions, the Windy Routing Problem, and the design of tandem configurations for automated guided vehicles. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n7/abs/jors200951a.html [article] Some applications of the generalized vehicle routing problem [texte imprimé] / R. Baldacci, Auteur ; E. Bartolini, Auteur ; G. Laporte, Auteur . - 2011 . - pp. 1072–1077. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 7 (Juillet 2010) . - pp. 1072–1077 Mots-clés : Generalized  Vehicle  routing  problem  Models  Applications Index. décimale : 001.424 Résumé : The Generalized Vehicle Routing Problem (GVRP) is an extension of the classical Vehicle Routing Problem (VRP) in which the vertex set is partitioned into clusters and vehicles must visit exactly one (or at least one) vertex per cluster. The GVRP provides a useful modelling framework for a wide variety of applications. The purpose of this paper is to provide such examples of applications and models. These include the Travelling Salesman with Profits, several VRP extensions, the Windy Routing Problem, and the design of tandem configurations for automated guided vehicles. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n7/abs/jors200951a.html

Articulate intervention revisited / Ormerod, R. J. in Journal of the operational research society (JORS), Vol. 61 N° 7 (Juillet 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 7 (Juillet 2010) . - pp. 1078–1094 Titre : Articulate intervention revisited Type de document : texte imprimé Auteurs : Ormerod, R. J., Auteur Année de publication : 2011 Article en page(s) : pp. 1078–1094 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Process  of  OR  Philosophy  of  OR  Popper  Pragmatism Index. décimale : 001.424 Résumé : Articulate Intervention by Hylton Boothroyd was published in 1978. It offered a description of OR based on experience. Boothroyd said his aim was to explore what can and cannot be meant by the idea of intelligently directing human affairs, about the place of articulating our thoughts before acting, about the place of consultants in business, industry and government, and about the place of formal methods. At the time the book was widely acclaimed by both academics and practitioners. This paper sets out the main ideas encapsulated in Articulate Intervention, examines how they stand up to more recent experience and speculates on their inherent philosophical position. It is concluded that 30 years on the ideas are still relevant today and can provide the basis of a variant of what Ulrich calls critical pragmatism. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n7/abs/jors200947a.html [article] Articulate intervention revisited [texte imprimé] / Ormerod, R. J., Auteur . - 2011 . - pp. 1078–1094. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 7 (Juillet 2010) . - pp. 1078–1094 Mots-clés : Process  of  OR  Philosophy  of  OR  Popper  Pragmatism Index. décimale : 001.424 Résumé : Articulate Intervention by Hylton Boothroyd was published in 1978. It offered a description of OR based on experience. Boothroyd said his aim was to explore what can and cannot be meant by the idea of intelligently directing human affairs, about the place of articulating our thoughts before acting, about the place of consultants in business, industry and government, and about the place of formal methods. At the time the book was widely acclaimed by both academics and practitioners. This paper sets out the main ideas encapsulated in Articulate Intervention, examines how they stand up to more recent experience and speculates on their inherent philosophical position. It is concluded that 30 years on the ideas are still relevant today and can provide the basis of a variant of what Ulrich calls critical pragmatism. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n7/abs/jors200947a.html

A heuristic method for the capacitated arc routing problem with refill points and multiple loads / C-A. Amaya in Journal of the operational research society (JORS), Vol. 61 N° 7 (Juillet 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 7 (Juillet 2010) . - pp. 1095–1103 Titre : A heuristic method for the capacitated arc routing problem with refill points and multiple loads Type de document : texte imprimé Auteurs : C-A. Amaya, Auteur ; A. Langevin, Auteur ; M. Trépanier, Auteur Année de publication : 2011 Article en page(s) : pp. 1095–1103 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Logistics  Optimization  Networks  and  graphs  Vehicle  routing  Capacitated  arc  routing  problem  Heuristics Index. décimale : 001.424 Résumé : We describe a solution procedure for a capacitated arc routing problem with refill points and multiple loads. This problem stems from the road network marking in Quebec, Canada. Two different types of vehicles are used: the first type (called servicing vehicle—SV) with a finite capacity to service the arcs and the other (called refilling vehicle—RV) to refill the SV vehicle. The RV can deliver multiple loads, which means that it meets the SV several times before returning to the depot. The problem consists of simultaneously determining the vehicle routes that minimize the total cost of the two vehicles. We present an integer formulation and a route first-cluster second heuristic procedure. Computational results are provided. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n7/abs/jors200958a.html [article] A heuristic method for the capacitated arc routing problem with refill points and multiple loads [texte imprimé] / C-A. Amaya, Auteur ; A. Langevin, Auteur ; M. Trépanier, Auteur . - 2011 . - pp. 1095–1103. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 7 (Juillet 2010) . - pp. 1095–1103 Mots-clés : Logistics  Optimization  Networks  and  graphs  Vehicle  routing  Capacitated  arc  routing  problem  Heuristics Index. décimale : 001.424 Résumé : We describe a solution procedure for a capacitated arc routing problem with refill points and multiple loads. This problem stems from the road network marking in Quebec, Canada. Two different types of vehicles are used: the first type (called servicing vehicle—SV) with a finite capacity to service the arcs and the other (called refilling vehicle—RV) to refill the SV vehicle. The RV can deliver multiple loads, which means that it meets the SV several times before returning to the depot. The problem consists of simultaneously determining the vehicle routes that minimize the total cost of the two vehicles. We present an integer formulation and a route first-cluster second heuristic procedure. Computational results are provided. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n7/abs/jors200958a.html

Staff rostering for the station personnel of a railway company / M. Lezaun in Journal of the operational research society (JORS), Vol. 61 N° 7 (Juillet 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 7 (Juillet 2010) . - pp. 1104–1111 Titre : Staff rostering for the station personnel of a railway company Type de document : texte imprimé Auteurs : M. Lezaun, Auteur ; G. Pérez, Auteur ; de la Maza, E Sáinz, Auteur Année de publication : 2011 Article en page(s) : pp. 1104–1111 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Manpower  planning  Crew  rostering  Scheduling  Binary  programming Index. décimale : 001.424 Résumé : This paper presents a case study commissioned by the Spanish railway carrier Ferrocariles Españoles de Vía Estrecha for the annual rostering of work schedules for station personnel. A mixed rostering process is used. The first part of the process is carried out manually with the aid of a spreadsheet and Visual Basic, and consists of designing an initial graphic with 4-week patterns for each station, assigning those patterns in a rotating schedule over the year and factoring in vacation time. The second part consists of assigning relief shifts to cover those shifts left vacant in such a way as to minimize the distance travelled by personnel from other stations brought in for relief shift duty. To that end, basic programmes are designed using binary programming and a 4-week time frame. The results obtained are a clear improvement on the system previously used at FEVE and the company has decided to implement the model. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n7/abs/jors200948a.html [article] Staff rostering for the station personnel of a railway company [texte imprimé] / M. Lezaun, Auteur ; G. Pérez, Auteur ; de la Maza, E Sáinz, Auteur . - 2011 . - pp. 1104–1111. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 7 (Juillet 2010) . - pp. 1104–1111 Mots-clés : Manpower  planning  Crew  rostering  Scheduling  Binary  programming Index. décimale : 001.424 Résumé : This paper presents a case study commissioned by the Spanish railway carrier Ferrocariles Españoles de Vía Estrecha for the annual rostering of work schedules for station personnel. A mixed rostering process is used. The first part of the process is carried out manually with the aid of a spreadsheet and Visual Basic, and consists of designing an initial graphic with 4-week patterns for each station, assigning those patterns in a rotating schedule over the year and factoring in vacation time. The second part consists of assigning relief shifts to cover those shifts left vacant in such a way as to minimize the distance travelled by personnel from other stations brought in for relief shift duty. To that end, basic programmes are designed using binary programming and a 4-week time frame. The results obtained are a clear improvement on the system previously used at FEVE and the company has decided to implement the model. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n7/abs/jors200948a.html

Integrating DEA into Six Sigma methodology for measuring health service efficiency / Q. Feng in Journal of the operational research society (JORS), Vol. 61 N° 7 (Juillet 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 7 (Juillet 2010) . - pp. 1112–1121 Titre : Integrating DEA into Six Sigma methodology for measuring health service efficiency Type de document : texte imprimé Auteurs : Q. Feng, Auteur ; J. Antony, Auteur Année de publication : 2011 Article en page(s) : pp. 1112–1121 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Data  envelopment  analysis  (DEA)  Six  Sigma  DMAIC  Physician  productivity  Health  service  efficiency Index. décimale : 001.424 Résumé : As a linear programming technique that is used to assess performance efficiency among organizational units, data envelopment analysis (DEA) has the practical value for planners to identify the most efficient units and thus project a best possible course of actions. This is also the fundamental goal of Six Sigma methodology for process improvement. Therefore, it is natural to integrate the DEA method into the framework of Six Sigma to enhance both the usefulness of Six Sigma and the effectiveness of DEA for assessing and improving health service efficiency. In this paper, the implementation of DEA is well incorporated into the Define, Measure, Analyze, Improve and Control process. The procedure can be well fitted into the Blackbelts training curriculum, which can also serve as a roadmap for Six Sigma practitioners to implement the DEA-enhanced projects. To illustrate how to integrate DEA into the Six Sigma framework, we present a Six Sigma project implemented to measure physician productivity in a clinical department. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n7/abs/jors200961a.html [article] Integrating DEA into Six Sigma methodology for measuring health service efficiency [texte imprimé] / Q. Feng, Auteur ; J. Antony, Auteur . - 2011 . - pp. 1112–1121. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 7 (Juillet 2010) . - pp. 1112–1121 Mots-clés : Data  envelopment  analysis  (DEA)  Six  Sigma  DMAIC  Physician  productivity  Health  service  efficiency Index. décimale : 001.424 Résumé : As a linear programming technique that is used to assess performance efficiency among organizational units, data envelopment analysis (DEA) has the practical value for planners to identify the most efficient units and thus project a best possible course of actions. This is also the fundamental goal of Six Sigma methodology for process improvement. Therefore, it is natural to integrate the DEA method into the framework of Six Sigma to enhance both the usefulness of Six Sigma and the effectiveness of DEA for assessing and improving health service efficiency. In this paper, the implementation of DEA is well incorporated into the Define, Measure, Analyze, Improve and Control process. The procedure can be well fitted into the Blackbelts training curriculum, which can also serve as a roadmap for Six Sigma practitioners to implement the DEA-enhanced projects. To illustrate how to integrate DEA into the Six Sigma framework, we present a Six Sigma project implemented to measure physician productivity in a clinical department. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n7/abs/jors200961a.html

Analysis of complementary methodologies for the estimation of school value added / M. C. A. S. Portela in Journal of the operational research society (JORS), Vol. 61 N° 7 (Juillet 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 7 (Juillet 2010) . - pp. 1122–1132 Titre : Analysis of complementary methodologies for the estimation of school value added Type de document : texte imprimé Auteurs : M. C. A. S. Portela, Auteur ; A. S. Camanho, Auteur Année de publication : 2011 Article en page(s) : pp. 1122–1132 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Efficiency  DEA  Value  added  Secondary  schools Index. décimale : 001.424 Résumé : This paper analyses the value added (VA) of a sample of Portuguese schools using two methodologies: data envelopment analysis (DEA) and the methodology used presently by the UK Department for Children, Schools and Families (DCSF). The VA estimates obtained by the two methods are substantially different. This reflects their different focus: DEA emphasizes on best-observed performance, whereas the DCSF method reveals average performance. The main advantage of the methodology used by the DCSF is its simplicity, although it confounds pupil effects with school effects in the estimation of school VA. In contrast, the DEA methodology can differentiate these effects, but the complexity may prevent its use in a systematic way. This paper shows that the two methods provide complementary information regarding the VA of schools, and their joint use can improve the understanding of the relative effectiveness of schools regarding the progress that pupils make between educational stages. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n7/abs/jors200985a.html [article] Analysis of complementary methodologies for the estimation of school value added [texte imprimé] / M. C. A. S. Portela, Auteur ; A. S. Camanho, Auteur . - 2011 . - pp. 1122–1132. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 7 (Juillet 2010) . - pp. 1122–1132 Mots-clés : Efficiency  DEA  Value  added  Secondary  schools Index. décimale : 001.424 Résumé : This paper analyses the value added (VA) of a sample of Portuguese schools using two methodologies: data envelopment analysis (DEA) and the methodology used presently by the UK Department for Children, Schools and Families (DCSF). The VA estimates obtained by the two methods are substantially different. This reflects their different focus: DEA emphasizes on best-observed performance, whereas the DCSF method reveals average performance. The main advantage of the methodology used by the DCSF is its simplicity, although it confounds pupil effects with school effects in the estimation of school VA. In contrast, the DEA methodology can differentiate these effects, but the complexity may prevent its use in a systematic way. This paper shows that the two methods provide complementary information regarding the VA of schools, and their joint use can improve the understanding of the relative effectiveness of schools regarding the progress that pupils make between educational stages. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n7/abs/jors200985a.html

Dynamic scheduling of recreational rental vehicles with revenue management extensions / A. T. Ernst in Journal of the operational research society (JORS), Vol. 61 N° 7 (Juillet 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 7 (Juillet 2010) . - pp. 1133–1143 Titre : Dynamic scheduling of recreational rental vehicles with revenue management extensions Type de document : texte imprimé Auteurs : A. T. Ernst, Auteur ; M. Horn, Auteur ; P. Kilby, Auteur Année de publication : 2011 Article en page(s) : pp. 1133–1143 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Scheduling  Networks  and  graphs  Revenue  management  Vehicle  routing Index. décimale : 001.424 Résumé : The rental fleet scheduling problem (RFSP) arises in vehicle-rental operations that offer a wide variety of vehicle types to customers, and allow a rented vehicle to ‘migrate’ to a setdown depot other than the pickup depot. When there is a shortage of vehicles of a particular type at a depot, vehicles may be relocated to that depot, or vehicles of similar types may be substituted. The RFSP involves assigning vehicles to rentals so as to minimise the costs of these operations, and arises in both static and online contexts. The authors have adapted a well-known assignment algorithm for application in the online context. In addition, a network-flow algorithm with more comprehensive coverage of problem conditions is used to investigate the determination of rental pricing using revenue management principles. The paper concludes with an outline of the algorithms’ use in supporting the operations of a large recreational vehicle rental company. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n7/abs/jors200978a.html [article] Dynamic scheduling of recreational rental vehicles with revenue management extensions [texte imprimé] / A. T. Ernst, Auteur ; M. Horn, Auteur ; P. Kilby, Auteur . - 2011 . - pp. 1133–1143. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 7 (Juillet 2010) . - pp. 1133–1143 Mots-clés : Scheduling  Networks  and  graphs  Revenue  management  Vehicle  routing Index. décimale : 001.424 Résumé : The rental fleet scheduling problem (RFSP) arises in vehicle-rental operations that offer a wide variety of vehicle types to customers, and allow a rented vehicle to ‘migrate’ to a setdown depot other than the pickup depot. When there is a shortage of vehicles of a particular type at a depot, vehicles may be relocated to that depot, or vehicles of similar types may be substituted. The RFSP involves assigning vehicles to rentals so as to minimise the costs of these operations, and arises in both static and online contexts. The authors have adapted a well-known assignment algorithm for application in the online context. In addition, a network-flow algorithm with more comprehensive coverage of problem conditions is used to investigate the determination of rental pricing using revenue management principles. The paper concludes with an outline of the algorithms’ use in supporting the operations of a large recreational vehicle rental company. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n7/abs/jors200978a.html

Finding relevant search engines results / G. R. Amin in Journal of the operational research society (JORS), Vol. 61 N° 7 (Juillet 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 7 (Juillet 2010) . - pp. 1144–1150 Titre : Finding relevant search engines results : a minimax linear programming approach Type de document : texte imprimé Auteurs : G. R. Amin, Auteur ; A. Emrouznejad, Auteur Année de publication : 2011 Article en page(s) : pp. 1144–1150 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Linear  programming  Search  engine  Metasearch  Relevancy  index Index. décimale : 001.424 Résumé : For a submitted query to multiple search engines finding relevant results is an important task. This paper formulates the problem of aggregation and ranking of multiple search engines results in the form of a minimax linear programming model. Besides the novel application, this study detects the most relevant information among a return set of ranked lists of documents retrieved by distinct search engines. Furthermore, two numerical examples aree used to illustrate the usefulness of the proposed approach. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n7/abs/jors200953a.html [article] Finding relevant search engines results : a minimax linear programming approach [texte imprimé] / G. R. Amin, Auteur ; A. Emrouznejad, Auteur . - 2011 . - pp. 1144–1150. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 7 (Juillet 2010) . - pp. 1144–1150 Mots-clés : Linear  programming  Search  engine  Metasearch  Relevancy  index Index. décimale : 001.424 Résumé : For a submitted query to multiple search engines finding relevant results is an important task. This paper formulates the problem of aggregation and ranking of multiple search engines results in the form of a minimax linear programming model. Besides the novel application, this study detects the most relevant information among a return set of ranked lists of documents retrieved by distinct search engines. Furthermore, two numerical examples aree used to illustrate the usefulness of the proposed approach. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n7/abs/jors200953a.html

Quantifying the risk in age and block replacement policies / B. C. Giri in Journal of the operational research society (JORS), Vol. 61 N° 7 (Juillet 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 7 (Juillet 2010) . - pp. 1151–1158 Titre : Quantifying the risk in age and block replacement policies Type de document : texte imprimé Auteurs : B. C. Giri, Auteur ; T. Dohi, Auteur Année de publication : 2011 Article en page(s) : pp. 1151–1158 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Preventive  maintenance  Risk  Age  Block  replacement  policies Index. décimale : 001.424 Résumé : Preventive maintenance policies have been studied in the literature without considering the risk due to the cost variability. In this paper, we consider the two most popular preventive replacement policies, namely, age and block replacement policies under long-run average cost and expected unit time cost criteria. To quantify the risk in the preventive maintenance policies, we use the long-run variance of the accumulated cost over a time interval. We numerically derive the Risk-sensitive preventive replacement policies and study the impact of the Risk-sensitive optimality criterion on the managerial decisions. We also examine the performance of the expected unit time cost criterion as an alternative to the traditional long-run average cost criterion. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n7/abs/jors200940a.html [article] Quantifying the risk in age and block replacement policies [texte imprimé] / B. C. Giri, Auteur ; T. Dohi, Auteur . - 2011 . - pp. 1151–1158. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 7 (Juillet 2010) . - pp. 1151–1158 Mots-clés : Preventive  maintenance  Risk  Age  Block  replacement  policies Index. décimale : 001.424 Résumé : Preventive maintenance policies have been studied in the literature without considering the risk due to the cost variability. In this paper, we consider the two most popular preventive replacement policies, namely, age and block replacement policies under long-run average cost and expected unit time cost criteria. To quantify the risk in the preventive maintenance policies, we use the long-run variance of the accumulated cost over a time interval. We numerically derive the Risk-sensitive preventive replacement policies and study the impact of the Risk-sensitive optimality criterion on the managerial decisions. We also examine the performance of the expected unit time cost criterion as an alternative to the traditional long-run average cost criterion. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n7/abs/jors200940a.html

Algorithms for partitioning of large routing networks / A. Awasthi in Journal of the operational research society (JORS), Vol. 61 N° 7 (Juillet 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 7 (Juillet 2010) . - pp. 1159–1167 Titre : Algorithms for partitioning of large routing networks Type de document : texte imprimé Auteurs : A. Awasthi, Auteur ; S. S. Chauhan, Auteur ; M. Parent, Auteur Année de publication : 2011 Article en page(s) : pp. 1159–1167 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Graph  partitioning  Large  networks  Distributed  computing  Load  balancing Index. décimale : 001.424 Résumé : Partitioning of large networks is vital for decentralized management and control. This paper presents two algorithms called ‘Hierarchical Recursive Progression-1’ (HRP-1) and ‘Hierarchical Recursive Progression-2’ (HRP-2) for partitioning of large networks into subnetworks of limited size with very few interconnections between them. In other words, we are trying to maximize the internal nodes and minimize the external connections of the subnetworks. The restriction on the size and the external connections is obtained by comparison against a user-defined value for the size of the subnetwork and for external connections via a term called density. The density of a subnetwork is defined as the ratio of the number of external connections and the size of the subnetwork. The two algorithms presented in the paper are based on the principle of subnetwork clustering. At the start of the algorithms, the number of subnetworks is equal to the total number of nodes of the network with each subnetwork containing a single node. Later, subnetworks are merged at various runs of the algorithm to form new subnetworks using connectivity, density and size criteria. The algorithms terminate when all the subnetworks satisfy a user-defined size and density limit. The difference between the algorithms HRP-1 and HRP-2 lies in the definition of density of subnetworks and the way through which the subnetworks are grouped at consecutive iterations of the algorithm. Note that the number of nodes inside the subnetworks never violates the size limit, thereby ensuring even distribution of load on the partitions obtained. Finally, the two algorithms are compared and tested on randomly generated graphs and a part of Paris road Network. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n7/abs/jors200952a.html [article] Algorithms for partitioning of large routing networks [texte imprimé] / A. Awasthi, Auteur ; S. S. Chauhan, Auteur ; M. Parent, Auteur . - 2011 . - pp. 1159–1167. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 7 (Juillet 2010) . - pp. 1159–1167 Mots-clés : Graph  partitioning  Large  networks  Distributed  computing  Load  balancing Index. décimale : 001.424 Résumé : Partitioning of large networks is vital for decentralized management and control. This paper presents two algorithms called ‘Hierarchical Recursive Progression-1’ (HRP-1) and ‘Hierarchical Recursive Progression-2’ (HRP-2) for partitioning of large networks into subnetworks of limited size with very few interconnections between them. In other words, we are trying to maximize the internal nodes and minimize the external connections of the subnetworks. The restriction on the size and the external connections is obtained by comparison against a user-defined value for the size of the subnetwork and for external connections via a term called density. The density of a subnetwork is defined as the ratio of the number of external connections and the size of the subnetwork. The two algorithms presented in the paper are based on the principle of subnetwork clustering. At the start of the algorithms, the number of subnetworks is equal to the total number of nodes of the network with each subnetwork containing a single node. Later, subnetworks are merged at various runs of the algorithm to form new subnetworks using connectivity, density and size criteria. The algorithms terminate when all the subnetworks satisfy a user-defined size and density limit. The difference between the algorithms HRP-1 and HRP-2 lies in the definition of density of subnetworks and the way through which the subnetworks are grouped at consecutive iterations of the algorithm. Note that the number of nodes inside the subnetworks never violates the size limit, thereby ensuring even distribution of load on the partitions obtained. Finally, the two algorithms are compared and tested on randomly generated graphs and a part of Paris road Network. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n7/abs/jors200952a.html

A heuristic approach for the truck and trailer routing problem / M. Caramia in Journal of the operational research society (JORS), Vol. 61 N° 7 (Juillet 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 7 (Juillet 2010) . - pp. 1168–1180 Titre : A heuristic approach for the truck and trailer routing problem Type de document : texte imprimé Auteurs : M. Caramia, Auteur ; F. Guerriero, Auteur Année de publication : 2011 Article en page(s) : pp. 1168–1180 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Mathematical  modeling  Heuristic  Routing Index. décimale : 001.424 Résumé : In this paper, we propose an approach based on mathematical programming and local search to cope with the truck and trailer vehicle routing problem. The mathematical programming framework models two subproblems that are solved sequentially, that is, the customer-route assignment problem (CAP), with the objective of minimizing the fleet size used to service clients, and the route definition problem, with the objective of minimizing the total tour length given the set of clients assigned to each vehicle. Since the route assignment model can return infeasible solutions, the local search plays the role of possibly retrieving a feasible solution. The mathematical formulations and the local search work iteratively, embedded in a multiple restarting mechanism able to diversify solutions by (i) identifying additional constraints for the CAP formulation to be taken into account during the algorithm progress, (ii) using a tabu like customer-route matrix to avoid assignments already analysed in the previous iterations of the algorithm. Also a lower bound to assess the solution quality is given. Experiments and comparison with competing approaches suggest that the results of the proposed machinery are promising, producing, on average, a smaller total tour lengths on benchmarks. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n7/abs/jors200959a.html [article] A heuristic approach for the truck and trailer routing problem [texte imprimé] / M. Caramia, Auteur ; F. Guerriero, Auteur . - 2011 . - pp. 1168–1180. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 7 (Juillet 2010) . - pp. 1168–1180 Mots-clés : Mathematical  modeling  Heuristic  Routing Index. décimale : 001.424 Résumé : In this paper, we propose an approach based on mathematical programming and local search to cope with the truck and trailer vehicle routing problem. The mathematical programming framework models two subproblems that are solved sequentially, that is, the customer-route assignment problem (CAP), with the objective of minimizing the fleet size used to service clients, and the route definition problem, with the objective of minimizing the total tour length given the set of clients assigned to each vehicle. Since the route assignment model can return infeasible solutions, the local search plays the role of possibly retrieving a feasible solution. The mathematical formulations and the local search work iteratively, embedded in a multiple restarting mechanism able to diversify solutions by (i) identifying additional constraints for the CAP formulation to be taken into account during the algorithm progress, (ii) using a tabu like customer-route matrix to avoid assignments already analysed in the previous iterations of the algorithm. Also a lower bound to assess the solution quality is given. Experiments and comparison with competing approaches suggest that the results of the proposed machinery are promising, producing, on average, a smaller total tour lengths on benchmarks. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n7/abs/jors200959a.html

Single machine scheduling with sequence-dependent family setups to minimize maximum lateness / F. Jin in Journal of the operational research society (JORS), Vol. 61 N° 7 (Juillet 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 7 (Juillet 2010) . - pp. 1181–1189 Titre : Single machine scheduling with sequence-dependent family setups to minimize maximum lateness Type de document : texte imprimé Auteurs : F. Jin, Auteur ; J. N. D. Gupta, Auteur ; S. Song, Auteur Année de publication : 2011 Article en page(s) : pp. 1181–1189 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Single  machine  Sequence-dependent  family  setup  times  Maximum  lateness  or  tardiness  Structura  Properties  Tabu  search  Empirical  results Index. décimale : 001.424 Résumé : Motivated by a real-life scheduling problem in a steel wire factory in China, this paper considers the single machine scheduling problem with sequence-dependent family setup times to minimize maximum lateness. In view of the NP-hard nature of the problem, structural (dominance and neighbourhood) properties of the problem are described and used in the tabu search algorithms to find optimal or near-optimal schedules. These proposed structural properties quickly exclude unpromising and/or non-improving neighbours from further search. Empirical results on the randomly generated and real-life problem instances from a factory in China show that the proposed heuristic algorithms utilizing the structural properties can obtain optimal or near optimal solutions with a reasonable computational effort. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n7/abs/jors200963a.html [article] Single machine scheduling with sequence-dependent family setups to minimize maximum lateness [texte imprimé] / F. Jin, Auteur ; J. N. D. Gupta, Auteur ; S. Song, Auteur . - 2011 . - pp. 1181–1189. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 7 (Juillet 2010) . - pp. 1181–1189 Mots-clés : Single  machine  Sequence-dependent  family  setup  times  Maximum  lateness  or  tardiness  Structura  Properties  Tabu  search  Empirical  results Index. décimale : 001.424 Résumé : Motivated by a real-life scheduling problem in a steel wire factory in China, this paper considers the single machine scheduling problem with sequence-dependent family setup times to minimize maximum lateness. In view of the NP-hard nature of the problem, structural (dominance and neighbourhood) properties of the problem are described and used in the tabu search algorithms to find optimal or near-optimal schedules. These proposed structural properties quickly exclude unpromising and/or non-improving neighbours from further search. Empirical results on the randomly generated and real-life problem instances from a factory in China show that the proposed heuristic algorithms utilizing the structural properties can obtain optimal or near optimal solutions with a reasonable computational effort. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n7/abs/jors200963a.html

Exemplaires

Bibliothèque Ecole Nationale Polytechnique d'Alger

Accueil

Se connecter

Météo

Adresse