Les Inscriptions à la Bibliothèque sont ouvertes en
ligne via le site: https://biblio.enp.edu.dz
Les Réinscriptions se font à :
• La Bibliothèque Annexe pour les étudiants en
2ème Année CPST
• La Bibliothèque Centrale pour les étudiants en Spécialités
A partir de cette page vous pouvez :
| Retourner au premier écran avec les recherches... |
Journal of the operational research society (JORS) |
Dépouillements
Ajouter le résultat dans votre panierThe unbounded parallel-batch scheduling with rejection / L. Q. Zhang in Journal of the operational research society (JORS), Vol. 63 N° 3 (Mars 2012)
in Journal of the operational research society (JORS) > Vol. 63 N° 3 (Mars 2012) . - pp. 293–298
Titre : The unbounded parallel-batch scheduling with rejection Type de document : texte imprimé Auteurs : L. Q. Zhang, Auteur ; L. F. Lu, Auteur ; C. T. Ng, Auteur Année de publication : 2012 Article en page(s) : pp. 293–298 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Parallel-batch scheduling Rejection penalty Polynomial-time algorithm Index. décimale : 001.424 Résumé : In this paper, we consider the unbounded parallel-batch scheduling with rejection. A job is either rejected, in which case a certain penalty has to be paid, or accepted and processed in batches on a machine. The processing time of a batch is defined as the longest processing time of the jobs contained in it. Four problems are considered: (1) to minimize the sum of the total completion time of the accepted jobs and the total rejection penalty of the rejected jobs; (2) to minimize the total completion time of the accepted jobs subject to an upper bound on the total rejection penalty of the rejected jobs; (3) to minimize the total rejection penalty of the rejected jobs subject to an upper bound on the total completion time of the accepted jobs; (4) to find the set of all the Pareto optimal schedules. We provide a polynomial-time algorithm for the first problem. Furthermore, we show that all the other three problems are binary NP-hard and present a pseudo-polynomial-time algorithm and a fully polynomial-time approximation scheme for them. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n3/abs/jors201131a.html [article] The unbounded parallel-batch scheduling with rejection [texte imprimé] / L. Q. Zhang, Auteur ; L. F. Lu, Auteur ; C. T. Ng, Auteur . - 2012 . - pp. 293–298.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 63 N° 3 (Mars 2012) . - pp. 293–298
Mots-clés : Parallel-batch scheduling Rejection penalty Polynomial-time algorithm Index. décimale : 001.424 Résumé : In this paper, we consider the unbounded parallel-batch scheduling with rejection. A job is either rejected, in which case a certain penalty has to be paid, or accepted and processed in batches on a machine. The processing time of a batch is defined as the longest processing time of the jobs contained in it. Four problems are considered: (1) to minimize the sum of the total completion time of the accepted jobs and the total rejection penalty of the rejected jobs; (2) to minimize the total completion time of the accepted jobs subject to an upper bound on the total rejection penalty of the rejected jobs; (3) to minimize the total rejection penalty of the rejected jobs subject to an upper bound on the total completion time of the accepted jobs; (4) to find the set of all the Pareto optimal schedules. We provide a polynomial-time algorithm for the first problem. Furthermore, we show that all the other three problems are binary NP-hard and present a pseudo-polynomial-time algorithm and a fully polynomial-time approximation scheme for them. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n3/abs/jors201131a.html
in Journal of the operational research society (JORS) > Vol. 63 N° 3 (Mars 2012) . - pp. 299–305
Titre : Efficiency and returns-to-scale of local governments Type de document : texte imprimé Auteurs : H. Amatatsu, Auteur ; T. Ueda, Auteur ; Y. Amatatsu, Auteur Année de publication : 2012 Article en page(s) : pp. 299–305 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Data envelopment analysis Government Returns to scale Input–output table Index. décimale : 001.424 Résumé : Local governments of advanced countries often have financial problems. Most central governments promote re-organization of local governments into larger local governments in order to reduce operating costs. Although cost reductions have been discussed by governments, political parties, economic institutes, etc, changes in industrial efficiency in regions governed by local governments have been overlooked. In this paper, we evaluate the industrial efficiency and the corresponding returns to scale (RTS). We present input–output tables that provide data of regional economies, network data envelopment analysis algorithms to measure the industrial efficiency, and an algorithm to measure the RTS. The Japanese government has proposed plans to merge prefectures, which are equivalent to counties in Britain, into larger states. The results obtained by applying the proposed algorithm to these plans demonstrate that a number of the new states will suffer from decreased RTS and will experience reduced efficiency. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n3/abs/jors201138a.html [article] Efficiency and returns-to-scale of local governments [texte imprimé] / H. Amatatsu, Auteur ; T. Ueda, Auteur ; Y. Amatatsu, Auteur . - 2012 . - pp. 299–305.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 63 N° 3 (Mars 2012) . - pp. 299–305
Mots-clés : Data envelopment analysis Government Returns to scale Input–output table Index. décimale : 001.424 Résumé : Local governments of advanced countries often have financial problems. Most central governments promote re-organization of local governments into larger local governments in order to reduce operating costs. Although cost reductions have been discussed by governments, political parties, economic institutes, etc, changes in industrial efficiency in regions governed by local governments have been overlooked. In this paper, we evaluate the industrial efficiency and the corresponding returns to scale (RTS). We present input–output tables that provide data of regional economies, network data envelopment analysis algorithms to measure the industrial efficiency, and an algorithm to measure the RTS. The Japanese government has proposed plans to merge prefectures, which are equivalent to counties in Britain, into larger states. The results obtained by applying the proposed algorithm to these plans demonstrate that a number of the new states will suffer from decreased RTS and will experience reduced efficiency. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n3/abs/jors201138a.html
in Journal of the operational research society (JORS) > Vol. 63 N° 3 (Mars 2012) . - pp. 306–321
Titre : A time-dependent proportional hazards survival model for credit risk analysis Type de document : texte imprimé Auteurs : J.-K. Im, Auteur ; D. W. Apley, Auteur ; C. Qi, Auteur Année de publication : 2012 Article en page(s) : pp. 306–321 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Risk Predicting consumer credit risk Failure models Survival analysis for credit risk modelling Data analysis Estimating survival models Index. décimale : 001.424 Résumé : In the consumer credit industry, assessment of default risk is critically important for the financial health of both the lender and the borrower. Methods for predicting risk for an applicant using credit bureau and application data, typically based on logistic regression or survival analysis, are universally employed by credit card companies. Because of the manner in which the predictive models are fit using large historical sets of existing customer data that extend over many years, default trends, anomalies, and other temporal phenomena that result from dynamic economic conditions are not brought to light. We introduce a modification of the proportional hazards survival model that includes a time-dependency mechanism for capturing temporal phenomena, and we develop a maximum likelihood algorithm for fitting the model. Using a very large, real data set, we demonstrate that incorporating the time dependency can provide more accurate risk scoring, as well as important insight into dynamic market effects that can inform and enhance related decision making. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n3/abs/jors201134a.html [article] A time-dependent proportional hazards survival model for credit risk analysis [texte imprimé] / J.-K. Im, Auteur ; D. W. Apley, Auteur ; C. Qi, Auteur . - 2012 . - pp. 306–321.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 63 N° 3 (Mars 2012) . - pp. 306–321
Mots-clés : Risk Predicting consumer credit risk Failure models Survival analysis for credit risk modelling Data analysis Estimating survival models Index. décimale : 001.424 Résumé : In the consumer credit industry, assessment of default risk is critically important for the financial health of both the lender and the borrower. Methods for predicting risk for an applicant using credit bureau and application data, typically based on logistic regression or survival analysis, are universally employed by credit card companies. Because of the manner in which the predictive models are fit using large historical sets of existing customer data that extend over many years, default trends, anomalies, and other temporal phenomena that result from dynamic economic conditions are not brought to light. We introduce a modification of the proportional hazards survival model that includes a time-dependency mechanism for capturing temporal phenomena, and we develop a maximum likelihood algorithm for fitting the model. Using a very large, real data set, we demonstrate that incorporating the time dependency can provide more accurate risk scoring, as well as important insight into dynamic market effects that can inform and enhance related decision making. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n3/abs/jors201134a.html
in Journal of the operational research society (JORS) > Vol. 63 N° 3 (Mars 2012) . - pp. 322–338
Titre : Pairwise opposite matrix and its cognitive prioritization operators : comparisons with pairwise reciprocal matrix and analytic prioritization operators Type de document : texte imprimé Auteurs : K. K. F. Yuen, Auteur Année de publication : 2012 Article en page(s) : pp. 322–338 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Decision analysis Utility theory Analytic hierarchy/network process (AHP/ANP) Cognitive decision system Optimization Index. décimale : 001.424 Résumé : The pairwise reciprocal matrix (PRM) of the analytic hierarchy/network process has been investigated by many scholars. However, there are significant queries about the appropriateness of using the PRM to represent the pairwise comparison. This research proposes a pairwise opposite matrix (POM) as the ideal alternative with respect to the human linguistic cognition of the rating scale of the paired comparison. Several cognitive prioritization operators (CPOs) are proposed to derive the individual utility vector (or priority vector) of the POM. Not only are the rigorous mathematical proofs of the new models demonstrated, but solutions of the CPOs are also illustrated by the presentation of graph theory. The comprehensive numerical analyses show how the POM performs better than the PRM. POM and CPOs, which correct the fallacy of the PRM associated with its prioritization operators, should be the ideal solutions for multi-criteria decision-making problems in various fields. DEWEY : 001.424 ISSN : 0160-5682 En ligne : www.palgrave-journals.com/jors/journal/v63/n3/abs/jors201133a.html [article] Pairwise opposite matrix and its cognitive prioritization operators : comparisons with pairwise reciprocal matrix and analytic prioritization operators [texte imprimé] / K. K. F. Yuen, Auteur . - 2012 . - pp. 322–338.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 63 N° 3 (Mars 2012) . - pp. 322–338
Mots-clés : Decision analysis Utility theory Analytic hierarchy/network process (AHP/ANP) Cognitive decision system Optimization Index. décimale : 001.424 Résumé : The pairwise reciprocal matrix (PRM) of the analytic hierarchy/network process has been investigated by many scholars. However, there are significant queries about the appropriateness of using the PRM to represent the pairwise comparison. This research proposes a pairwise opposite matrix (POM) as the ideal alternative with respect to the human linguistic cognition of the rating scale of the paired comparison. Several cognitive prioritization operators (CPOs) are proposed to derive the individual utility vector (or priority vector) of the POM. Not only are the rigorous mathematical proofs of the new models demonstrated, but solutions of the CPOs are also illustrated by the presentation of graph theory. The comprehensive numerical analyses show how the POM performs better than the PRM. POM and CPOs, which correct the fallacy of the PRM associated with its prioritization operators, should be the ideal solutions for multi-criteria decision-making problems in various fields. DEWEY : 001.424 ISSN : 0160-5682 En ligne : www.palgrave-journals.com/jors/journal/v63/n3/abs/jors201133a.html
in Journal of the operational research society (JORS) > Vol. 63 N° 3 (Mars 2012) . - pp. 339–353
Titre : Implementation of lean six sigma in small- and medium-sized manufacturing enterprises in the Netherlands Type de document : texte imprimé Auteurs : W. Timans, Auteur ; J. Antony, Auteur ; K. Ahaus, Auteur Année de publication : 2012 Article en page(s) : pp. 339–353 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Lean six sigma Manufacturing/engineering SME Critical success factors Impeding factors Index. décimale : 001.424 Résumé : In this paper we provide an exploration and analysis of Lean Six Sigma (LSS) implementation in Dutch manufacturing/engineering small- and medium-sized enterprises (SMEs). Critical success factors (CSFs) and impeding factors are identified and analysed. Exploratory empirical evidence about LSS implementation in Dutch SMEs was collected from a survey study on Dutch SMEs. Statistical testing was applied to validate the ranking of the CSFs. To deepen insight in how organizations translate CSFs into practice and cope with impeding factors, additional in-depth qualitative information was gathered from six case studies. Linking to customer, vision and plan statement, communication and management involvement and participation are the highest ranked CSFs. Internal resistance, the availability of resources, changing business focus and lack of leadership are the strongest impeding factors. The case studies confirmed the importance of the CSFs and revealed three new CSFs: personal LSS-experience of Top management, development of the project leader's soft skills and supply chain focus. SMEs in the Netherlands make no distinct separation between lean manufacturing and Six Sigma, but rather apply both approaches intertwined. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n3/abs/jors201147a.html [article] Implementation of lean six sigma in small- and medium-sized manufacturing enterprises in the Netherlands [texte imprimé] / W. Timans, Auteur ; J. Antony, Auteur ; K. Ahaus, Auteur . - 2012 . - pp. 339–353.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 63 N° 3 (Mars 2012) . - pp. 339–353
Mots-clés : Lean six sigma Manufacturing/engineering SME Critical success factors Impeding factors Index. décimale : 001.424 Résumé : In this paper we provide an exploration and analysis of Lean Six Sigma (LSS) implementation in Dutch manufacturing/engineering small- and medium-sized enterprises (SMEs). Critical success factors (CSFs) and impeding factors are identified and analysed. Exploratory empirical evidence about LSS implementation in Dutch SMEs was collected from a survey study on Dutch SMEs. Statistical testing was applied to validate the ranking of the CSFs. To deepen insight in how organizations translate CSFs into practice and cope with impeding factors, additional in-depth qualitative information was gathered from six case studies. Linking to customer, vision and plan statement, communication and management involvement and participation are the highest ranked CSFs. Internal resistance, the availability of resources, changing business focus and lack of leadership are the strongest impeding factors. The case studies confirmed the importance of the CSFs and revealed three new CSFs: personal LSS-experience of Top management, development of the project leader's soft skills and supply chain focus. SMEs in the Netherlands make no distinct separation between lean manufacturing and Six Sigma, but rather apply both approaches intertwined. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n3/abs/jors201147a.html
in Journal of the operational research society (JORS) > Vol. 63 N° 3 (Mars 2012) . - pp. 354–367
Titre : The optimal quantity discount that a supplier should offer Type de document : texte imprimé Auteurs : G. Y. Ke, Auteur ; J. H. Bookbinder, Auteur Année de publication : 2012 Article en page(s) : pp. 354–367 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Coordination Quantity discount Price elasticity of demand Game theory Multiobjective decision making Index. décimale : 001.424 Résumé : Quantity discounts are a useful mechanism for coordination. Here we investigate such discounts from the supplier's perspective, both from a non-cooperative game-theoretical approach and a joint decision model. Taking into account the price elasticity of demand, this analysis aids a sole supplier in establishing an all-unit quantity discount policy in light of the buyer's best reaction. The Stackelberg equilibrium and Pareto optimal solution set are derived for the non-cooperative and joint-decision cases, respectively. Our research indicates that channel efficiency can be improved significantly if the quantity discount decision is made jointly rather than non-cooperatively. Moreover, we extend our model in three directions: (1) the product is transported by a private fleet; (2) the buyer may choose to offer her customers a different percentage discount than that she obtained from the supplier; and (3) the case of heterogeneous buyers. Numerical case studies are employed throughout the paper to illustrate the practical applications of the models presented and the sensitivity to model parameters. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n3/abs/jors201135a.html [article] The optimal quantity discount that a supplier should offer [texte imprimé] / G. Y. Ke, Auteur ; J. H. Bookbinder, Auteur . - 2012 . - pp. 354–367.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 63 N° 3 (Mars 2012) . - pp. 354–367
Mots-clés : Coordination Quantity discount Price elasticity of demand Game theory Multiobjective decision making Index. décimale : 001.424 Résumé : Quantity discounts are a useful mechanism for coordination. Here we investigate such discounts from the supplier's perspective, both from a non-cooperative game-theoretical approach and a joint decision model. Taking into account the price elasticity of demand, this analysis aids a sole supplier in establishing an all-unit quantity discount policy in light of the buyer's best reaction. The Stackelberg equilibrium and Pareto optimal solution set are derived for the non-cooperative and joint-decision cases, respectively. Our research indicates that channel efficiency can be improved significantly if the quantity discount decision is made jointly rather than non-cooperatively. Moreover, we extend our model in three directions: (1) the product is transported by a private fleet; (2) the buyer may choose to offer her customers a different percentage discount than that she obtained from the supplier; and (3) the case of heterogeneous buyers. Numerical case studies are employed throughout the paper to illustrate the practical applications of the models presented and the sensitivity to model parameters. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n3/abs/jors201135a.html
in Journal of the operational research society (JORS) > Vol. 63 N° 3 (Mars 2012) . - pp. 368–378
Titre : An evolutionary approach for tuning parametric Esau and Williams heuristics Type de document : texte imprimé Auteurs : M. Battarra, Auteur ; T. Öncan, Auteur ; Altinel, I. K., Auteur Année de publication : 2012 Article en page(s) : pp. 368–378 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Capacitated minimum spanning tree problem Evolutionary algorithms Parameter tuning Index. décimale : 001.424 Résumé : Owing to its inherent difficulty, many heuristic solution methods have been proposed for the capacitated minimum spanning tree problem. On the basis of recent developments, it is clear that the best metaheuristic implementations outperform classical heuristics. Unfortunately, they require long computing times and may not be very easy to implement, which explains the popularity of the Esau and Williams heuristic in practice, and the motivation behind its enhancements. Some of these enhancements involve parameters and their accuracy becomes nearly competitive with the best metaheuristics when they are tuned properly, which is usually done using a grid search within given search intervals for the parameters. In this work, we propose a genetic algorithm parameter setting procedure. Computational results show that the new method is even more accurate than an enumerative approach, and much more efficient. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n3/abs/jors201136a.html [article] An evolutionary approach for tuning parametric Esau and Williams heuristics [texte imprimé] / M. Battarra, Auteur ; T. Öncan, Auteur ; Altinel, I. K., Auteur . - 2012 . - pp. 368–378.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 63 N° 3 (Mars 2012) . - pp. 368–378
Mots-clés : Capacitated minimum spanning tree problem Evolutionary algorithms Parameter tuning Index. décimale : 001.424 Résumé : Owing to its inherent difficulty, many heuristic solution methods have been proposed for the capacitated minimum spanning tree problem. On the basis of recent developments, it is clear that the best metaheuristic implementations outperform classical heuristics. Unfortunately, they require long computing times and may not be very easy to implement, which explains the popularity of the Esau and Williams heuristic in practice, and the motivation behind its enhancements. Some of these enhancements involve parameters and their accuracy becomes nearly competitive with the best metaheuristics when they are tuned properly, which is usually done using a grid search within given search intervals for the parameters. In this work, we propose a genetic algorithm parameter setting procedure. Computational results show that the new method is even more accurate than an enumerative approach, and much more efficient. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n3/abs/jors201136a.html
in Journal of the operational research society (JORS) > Vol. 63 N° 3 (Mars 2012) . - pp. 379–391
Titre : Solving an optimization packing problem of circles and non-convex polygons with rotations into a multiply connected region Type de document : texte imprimé Auteurs : Y. G. Stoyan, Auteur ; M. V. Zlotnik, Auteur ; A. M. Chugay, Auteur Année de publication : 2012 Article en page(s) : pp. 379–391 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Cutting stock problem Optimization Non-linear programming Index. décimale : 001.424 Résumé : This paper deals with the packing problem of circles and non-convex polygons, which can be both translated and rotated into a strip with prohibited regions. Using the Φ-function technique, a mathematical model of the problem is constructed and its characteristics are investigated. Based on the characteristics, a solution approach to the problem is offered. The approach includes the following methods: an optimization method by groups of variables to construct starting points, a modification of the Zoutendijk feasible direction method to search for local minima and a special non-exhaustive search of local minima to find an approximation to a global minimum. A number of numerical results are given. The numerical results are compared with the best known ones. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n3/abs/jors201141a.html [article] Solving an optimization packing problem of circles and non-convex polygons with rotations into a multiply connected region [texte imprimé] / Y. G. Stoyan, Auteur ; M. V. Zlotnik, Auteur ; A. M. Chugay, Auteur . - 2012 . - pp. 379–391.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 63 N° 3 (Mars 2012) . - pp. 379–391
Mots-clés : Cutting stock problem Optimization Non-linear programming Index. décimale : 001.424 Résumé : This paper deals with the packing problem of circles and non-convex polygons, which can be both translated and rotated into a strip with prohibited regions. Using the Φ-function technique, a mathematical model of the problem is constructed and its characteristics are investigated. Based on the characteristics, a solution approach to the problem is offered. The approach includes the following methods: an optimization method by groups of variables to construct starting points, a modification of the Zoutendijk feasible direction method to search for local minima and a special non-exhaustive search of local minima to find an approximation to a global minimum. A number of numerical results are given. The numerical results are compared with the best known ones. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n3/abs/jors201141a.html
in Journal of the operational research society (JORS) > Vol. 63 N° 3 (Mars 2012) . - pp. 392–405
Titre : An empirical study of hyperheuristics for managing very large sets of low level heuristics Type de document : texte imprimé Auteurs : S. Remde, Auteur ; P. Cowling, Auteur ; K. Dahal, Auteur Année de publication : 2012 Article en page(s) : pp. 392–405 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Computational analysis Heuristics Hyperheuristics Machine learning Optimisation Scheduling Tabu search Index. décimale : 001.424 Résumé : Hyperheuristics give us the appealing possibility of abstracting the solution method from the problem, since our hyperheuristic, at each decision point, chooses between different low level heuristics rather than different solutions as is usually the case for metaheuristics. By assembling low level heuristics from parameterised components we may create hundreds or thousands of low level heuristics, and there is increasing evidence that this is effective in dealing with every eventuality that may arise when solving different combinatorial optimisation problem instances since at each iteration the solution landscape is amenable to at least one of the low level heuristics. However, the large number of low level heuristics means that the hyperheuristic has to intelligently select the correct low level heuristic to use, to make best use of available CPU time. This paper empirically investigates several hyperheuristics designed for large collections of low level heuristics and adapts other hyperheuristics from the literature to cope with these large sets of low level heuristics on a difficult real-world workforce scheduling problem. In the process we empirically investigate a wide range of approaches for setting tabu tenure in hyperheuristic methods, for a complex real-world problem. The results show that the hyperheuristic methods described provide a good way to trade off CPU time and solution quality. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n3/abs/jors201148a.html [article] An empirical study of hyperheuristics for managing very large sets of low level heuristics [texte imprimé] / S. Remde, Auteur ; P. Cowling, Auteur ; K. Dahal, Auteur . - 2012 . - pp. 392–405.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 63 N° 3 (Mars 2012) . - pp. 392–405
Mots-clés : Computational analysis Heuristics Hyperheuristics Machine learning Optimisation Scheduling Tabu search Index. décimale : 001.424 Résumé : Hyperheuristics give us the appealing possibility of abstracting the solution method from the problem, since our hyperheuristic, at each decision point, chooses between different low level heuristics rather than different solutions as is usually the case for metaheuristics. By assembling low level heuristics from parameterised components we may create hundreds or thousands of low level heuristics, and there is increasing evidence that this is effective in dealing with every eventuality that may arise when solving different combinatorial optimisation problem instances since at each iteration the solution landscape is amenable to at least one of the low level heuristics. However, the large number of low level heuristics means that the hyperheuristic has to intelligently select the correct low level heuristic to use, to make best use of available CPU time. This paper empirically investigates several hyperheuristics designed for large collections of low level heuristics and adapts other hyperheuristics from the literature to cope with these large sets of low level heuristics on a difficult real-world workforce scheduling problem. In the process we empirically investigate a wide range of approaches for setting tabu tenure in hyperheuristic methods, for a complex real-world problem. The results show that the hyperheuristic methods described provide a good way to trade off CPU time and solution quality. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n3/abs/jors201148a.html
in Journal of the operational research society (JORS) > Vol. 63 N° 3 (Mars 2012) . - pp. 406–417
Titre : Adjusted spherical frontier model: allocating input via parametric DEA Type de document : texte imprimé Auteurs : E. C. C. Guedes, Auteur ; Milioni, A. Z., Auteur ; de Avellar, J. V. G., Auteur Année de publication : 2012 Article en page(s) : pp. 406–417 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : DEA Parametric DEA Input allocation Fixed cost allocation Index. décimale : 001.424 Résumé : This paper presents the adjusted spherical frontier model (ASFM), a parametric data envelopment analysis (DEA) model for input allocation. Following a common principle from other solutions found in the literature, ASFM considers that the process of allocating the new input is fair if it ends in such a way that all decision-making units will become DEA-CCR efficient. ASFM's main assumption is the spherical shape of the efficiency frontier. It is because of that assumption that ASFM is called a parametric DEA model. Numeric examples are presented showing that, within the context of sensitivity analysis, ASFM reaches more coherent results than other models found in the literature. This numeric evidence leads to a theorem which formally states this more coherent behaviour. The proof of this theorem is included in this paper. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n3/abs/jors201142a.html [article] Adjusted spherical frontier model: allocating input via parametric DEA [texte imprimé] / E. C. C. Guedes, Auteur ; Milioni, A. Z., Auteur ; de Avellar, J. V. G., Auteur . - 2012 . - pp. 406–417.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 63 N° 3 (Mars 2012) . - pp. 406–417
Mots-clés : DEA Parametric DEA Input allocation Fixed cost allocation Index. décimale : 001.424 Résumé : This paper presents the adjusted spherical frontier model (ASFM), a parametric data envelopment analysis (DEA) model for input allocation. Following a common principle from other solutions found in the literature, ASFM considers that the process of allocating the new input is fair if it ends in such a way that all decision-making units will become DEA-CCR efficient. ASFM's main assumption is the spherical shape of the efficiency frontier. It is because of that assumption that ASFM is called a parametric DEA model. Numeric examples are presented showing that, within the context of sensitivity analysis, ASFM reaches more coherent results than other models found in the literature. This numeric evidence leads to a theorem which formally states this more coherent behaviour. The proof of this theorem is included in this paper. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n3/abs/jors201142a.html
in Journal of the operational research society (JORS) > Vol. 63 N° 3 (Mars 2012) . - pp. 418–430
Titre : Using the Viable Systems Model to examine multi-agency arrangements for combatting transnational organised crime Type de document : texte imprimé Auteurs : J. Brocklesby, Auteur Année de publication : 2012 Article en page(s) : pp. 418–430 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Cybernetics Management Modelling Viable systems Policing Index. décimale : 001.424 Résumé : Traditionally, most operational research applications in the area of law enforcement and criminal justice have used quantitative techniques to forecast patterns and levels of offending and to optimise various police, judicial and prison processes. This paper seeks to examine the role that more qualitative modelling approaches might contribute in this important application area. Specifically, the paper examines the role that cybernetic theory and viable systems modelling can contribute in helping government bodies and law enforcement agencies to think through how, organisationally, they can best respond to the increasingly complex problem of transnational organised crime. Focussing on new multi-agency collaborative arrangements, the paper argues that there is a need for more informed debate that can account for the complexity of the challenge and point towards more holistic and integrated solutions. Against this background, the paper argues that the viable systems modelling approach has much to offer because it is theoretically grounded in the management of complexity; because its flexibility allows it to accommodate the trend for law enforcement agencies to work more closely with partner agencies, and to do so at multiple organisational levels; and because its user-friendly annotated diagramming conventions allow stakeholders to focus discussion and work towards outcomes that make sense in particular settings. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n3/abs/jors201143a.html [article] Using the Viable Systems Model to examine multi-agency arrangements for combatting transnational organised crime [texte imprimé] / J. Brocklesby, Auteur . - 2012 . - pp. 418–430.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 63 N° 3 (Mars 2012) . - pp. 418–430
Mots-clés : Cybernetics Management Modelling Viable systems Policing Index. décimale : 001.424 Résumé : Traditionally, most operational research applications in the area of law enforcement and criminal justice have used quantitative techniques to forecast patterns and levels of offending and to optimise various police, judicial and prison processes. This paper seeks to examine the role that more qualitative modelling approaches might contribute in this important application area. Specifically, the paper examines the role that cybernetic theory and viable systems modelling can contribute in helping government bodies and law enforcement agencies to think through how, organisationally, they can best respond to the increasingly complex problem of transnational organised crime. Focussing on new multi-agency collaborative arrangements, the paper argues that there is a need for more informed debate that can account for the complexity of the challenge and point towards more holistic and integrated solutions. Against this background, the paper argues that the viable systems modelling approach has much to offer because it is theoretically grounded in the management of complexity; because its flexibility allows it to accommodate the trend for law enforcement agencies to work more closely with partner agencies, and to do so at multiple organisational levels; and because its user-friendly annotated diagramming conventions allow stakeholders to focus discussion and work towards outcomes that make sense in particular settings. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n3/abs/jors201143a.html
Exemplaires
| Code-barres | Cote | Support | Localisation | Section | Disponibilité |
|---|---|---|---|---|---|
| aucun exemplaire | |||||
