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 panierA DEA approach to derive individual lower and upper bounds for the technical and allocative components of the overall profit efficiency / J. L. Ruiz in Journal of the operational research society (JORS), Vol. 62 N° 11 (Novembre 2011)
in Journal of the operational research society (JORS) > Vol. 62 N° 11 (Novembre 2011) . - pp. 1907–1916
Titre : A DEA approach to derive individual lower and upper bounds for the technical and allocative components of the overall profit efficiency Type de document : texte imprimé Auteurs : J. L. Ruiz, Auteur ; I. Sirvent, Auteur Année de publication : 2011 Article en page(s) : pp. 1907–1916 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Data envelopment analysis Profit efficiency Overall efficiency Technical efficiency Allocative efficiency Minimum distance to the frontier models Index. décimale : 001.424 Résumé : In this paper, we propose a slack-based data envelopment analysis approach to be used in economic efficiency analyses when the objective is profit maximization. The focus is on the measurement of the technical component of the overall efficiency with the purpose of guaranteeing the achievement of the Pareto efficiency. As a result, we will be able to estimate correctly the allocative component in the sense that this latter only reflects the improvements that can be accomplished by reallocations along the Pareto-efficient frontier. Some new measures of technical and allocative efficiency in terms of both profit ratios and differences of profits are defined. We do not make any assumption on the way the technical efficiency is to be measured, that is, we do not use, for example, either a hyperbolic measure or a directional distance function, which allows us to extend this approach and derive individual lower and upper bounds for these efficiency components. To do it, we use novel models of minimum distance to the frontier. This broadens the range of possibilities for the explanation of the overall efficiency in terms of technical and allocative inefficiencies. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n11/abs/jors2010140a.html [article] A DEA approach to derive individual lower and upper bounds for the technical and allocative components of the overall profit efficiency [texte imprimé] / J. L. Ruiz, Auteur ; I. Sirvent, Auteur . - 2011 . - pp. 1907–1916.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 62 N° 11 (Novembre 2011) . - pp. 1907–1916
Mots-clés : Data envelopment analysis Profit efficiency Overall efficiency Technical efficiency Allocative efficiency Minimum distance to the frontier models Index. décimale : 001.424 Résumé : In this paper, we propose a slack-based data envelopment analysis approach to be used in economic efficiency analyses when the objective is profit maximization. The focus is on the measurement of the technical component of the overall efficiency with the purpose of guaranteeing the achievement of the Pareto efficiency. As a result, we will be able to estimate correctly the allocative component in the sense that this latter only reflects the improvements that can be accomplished by reallocations along the Pareto-efficient frontier. Some new measures of technical and allocative efficiency in terms of both profit ratios and differences of profits are defined. We do not make any assumption on the way the technical efficiency is to be measured, that is, we do not use, for example, either a hyperbolic measure or a directional distance function, which allows us to extend this approach and derive individual lower and upper bounds for these efficiency components. To do it, we use novel models of minimum distance to the frontier. This broadens the range of possibilities for the explanation of the overall efficiency in terms of technical and allocative inefficiencies. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n11/abs/jors2010140a.html
in Journal of the operational research society (JORS) > Vol. 62 N° 11 (Novembre 2011) . - pp. 1917–1930
Titre : Packing circles in the smallest circle: an adaptive hybrid algorithm Type de document : texte imprimé Auteurs : I. Al-Mudahka, Auteur ; M. Hifi, Auteur ; R. M'Hallah, Auteur Année de publication : 2011 Article en page(s) : pp. 1917–1930 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Heuristics Tabu search Non-linear programming Circular packing Nested partitioning Index. décimale : 001.424 Résumé : The circular packing problem (CPP) consists of packing n circles Ci of known radii ri, i∈N={1, …, n}, into the smallest containing circle ℂ. The objective is to determine the coordinates (xi, yi) of the centre of Ci, i∈N, as well as the radius r and centre (x, y) of ℂ. CPP, which is a variant of the two-dimensional open-dimension problem, is NP hard. This paper presents an adaptive algorithm that incorporates nested partitioning within a tabu search and applies some diversification strategies to obtain a (near) global optimum. The tabu search is to identify the n circles’ ordering, whereas the nested partitioning is to determine the n circles’ positions that yield the smallest r. The computational results show the efficiency of the proposed algorithm. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n11/abs/jors2010157a.html [article] Packing circles in the smallest circle: an adaptive hybrid algorithm [texte imprimé] / I. Al-Mudahka, Auteur ; M. Hifi, Auteur ; R. M'Hallah, Auteur . - 2011 . - pp. 1917–1930.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 62 N° 11 (Novembre 2011) . - pp. 1917–1930
Mots-clés : Heuristics Tabu search Non-linear programming Circular packing Nested partitioning Index. décimale : 001.424 Résumé : The circular packing problem (CPP) consists of packing n circles Ci of known radii ri, i∈N={1, …, n}, into the smallest containing circle ℂ. The objective is to determine the coordinates (xi, yi) of the centre of Ci, i∈N, as well as the radius r and centre (x, y) of ℂ. CPP, which is a variant of the two-dimensional open-dimension problem, is NP hard. This paper presents an adaptive algorithm that incorporates nested partitioning within a tabu search and applies some diversification strategies to obtain a (near) global optimum. The tabu search is to identify the n circles’ ordering, whereas the nested partitioning is to determine the n circles’ positions that yield the smallest r. The computational results show the efficiency of the proposed algorithm. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n11/abs/jors2010157a.html
in Journal of the operational research society (JORS) > Vol. 62 N° 11 (Novembre 2011) . - pp. 1931–1940
Titre : An analysis of strategy in the first three innings in test cricket: declaration and the follow-on Type de document : texte imprimé Auteurs : P. Scarf, Auteur ; S. Akhtar, Auteur Année de publication : 2011 Article en page(s) : pp. 1931–1940 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Cricket Multinomial logistic regression Strategy Index. décimale : 001.424 Résumé : This paper analyses declaration and the follow-on decisions in test cricket. We model the match outcome given the end of first, second and third innings positions; data on 391 test matches, from the period 1997 to 2007, are used to fit the models. We then investigate how declaration strategy should vary from innings to innings, and how the nature and strength of the covariate effects vary. As the match progresses, the explanatory power of the covariates increases (from 44% at the end of the first innings to 80% at the end of the third). Home advantage and the effects of team strengths decrease. Overs-remaining, or equivalently overs used, and the number of runs by which the reference team lead their opponents remain important throughout. The follow-on decision problem is also briefly considered, and surprisingly, we find that the decision to enforce the follow-on or otherwise has no effect on match outcome. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n11/abs/jors2010169a.html [article] An analysis of strategy in the first three innings in test cricket: declaration and the follow-on [texte imprimé] / P. Scarf, Auteur ; S. Akhtar, Auteur . - 2011 . - pp. 1931–1940.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 62 N° 11 (Novembre 2011) . - pp. 1931–1940
Mots-clés : Cricket Multinomial logistic regression Strategy Index. décimale : 001.424 Résumé : This paper analyses declaration and the follow-on decisions in test cricket. We model the match outcome given the end of first, second and third innings positions; data on 391 test matches, from the period 1997 to 2007, are used to fit the models. We then investigate how declaration strategy should vary from innings to innings, and how the nature and strength of the covariate effects vary. As the match progresses, the explanatory power of the covariates increases (from 44% at the end of the first innings to 80% at the end of the third). Home advantage and the effects of team strengths decrease. Overs-remaining, or equivalently overs used, and the number of runs by which the reference team lead their opponents remain important throughout. The follow-on decision problem is also briefly considered, and surprisingly, we find that the decision to enforce the follow-on or otherwise has no effect on match outcome. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n11/abs/jors2010169a.html
in Journal of the operational research society (JORS) > Vol. 62 N° 11 (Novembre 2011) . - pp. 1941–1950
Titre : Ranking residential properties by a multicriteria single price model Type de document : texte imprimé Auteurs : R. Cervelló, Auteur ; F. García, Auteur ; F. Guijarro, Auteur Année de publication : 2011 Article en page(s) : pp. 1941–1950 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Full ranking Multicriteria decision making Compromise programming Equilibrium set Index. décimale : 001.424 Résumé : This study describes an application of the multicriteria single price model (Ballestero) to the ranking of alternatives. By a generalization of the original model, the equilibrium set of alternatives can be characterized from the viewpoints, respectively, of the demander and the supplier, and from that the efficiency index can be calculated. We demonstrate how, in a state of equilibrium, the two viewpoints result inevitably in inverse orders of ranking. In contrast with other proposals for full ranking of alternatives, the method used in the present study (i) assumes a moderate attitude on the part of the decision maker towards risk, with a robust axiomatic basis; (ii) assigns weights to the criteria independently of which alternative is being evaluated and the attitude (optimistic or pessimistic) of the decision maker; (iii) produces a cardinal hierarchy of the alternatives and not just an ordinal one. The model is illustrated by a sample of residential properties in the city of Valencia, Spain. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n11/abs/jors2010170a.html [article] Ranking residential properties by a multicriteria single price model [texte imprimé] / R. Cervelló, Auteur ; F. García, Auteur ; F. Guijarro, Auteur . - 2011 . - pp. 1941–1950.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 62 N° 11 (Novembre 2011) . - pp. 1941–1950
Mots-clés : Full ranking Multicriteria decision making Compromise programming Equilibrium set Index. décimale : 001.424 Résumé : This study describes an application of the multicriteria single price model (Ballestero) to the ranking of alternatives. By a generalization of the original model, the equilibrium set of alternatives can be characterized from the viewpoints, respectively, of the demander and the supplier, and from that the efficiency index can be calculated. We demonstrate how, in a state of equilibrium, the two viewpoints result inevitably in inverse orders of ranking. In contrast with other proposals for full ranking of alternatives, the method used in the present study (i) assumes a moderate attitude on the part of the decision maker towards risk, with a robust axiomatic basis; (ii) assigns weights to the criteria independently of which alternative is being evaluated and the attitude (optimistic or pessimistic) of the decision maker; (iii) produces a cardinal hierarchy of the alternatives and not just an ordinal one. The model is illustrated by a sample of residential properties in the city of Valencia, Spain. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n11/abs/jors2010170a.html
in Journal of the operational research society (JORS) > Vol. 62 N° 11 (Novembre 2011) . - pp. 1951–1957
Titre : Duckworth–Lewis and Twenty20 cricket Type de document : texte imprimé Auteurs : R. Bhattacharya, Auteur ; P. S. Gill, Auteur ; T. B. Swartz, Auteur Année de publication : 2011 Article en page(s) : pp. 1951–1957 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Duckworth–Lewis method Gibbs sampling Isotonic regression Twenty20 cricket Index. décimale : 001.424 Résumé : Originally designed for 1-day cricket, this paper considers the use of the Duckworth–Lewis method as an approach to resetting targets in interrupted Twenty20 cricket matches. The Duckworth–Lewis table is reviewed and an alternative resource table is presented. The alternative table is constructed using observed scoring rates from international Twenty20 matches. A desideratum of a resource table is monotonicity in both the rows and columns corresponding to wickets and overs respectively. Consequently, a Gibbs sampling scheme related to isotonic regression is applied to the observed scoring rates to provide a non-parametric resource table. Taking into account the more aggressive batting style of Twenty20 compared to 1-day cricket, the resultant resource table is seen to possess sensible features. A discussion is provided concerning the use of the Duckworth–Lewis method applied to Twenty20. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n11/abs/jors2010175a.html [article] Duckworth–Lewis and Twenty20 cricket [texte imprimé] / R. Bhattacharya, Auteur ; P. S. Gill, Auteur ; T. B. Swartz, Auteur . - 2011 . - pp. 1951–1957.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 62 N° 11 (Novembre 2011) . - pp. 1951–1957
Mots-clés : Duckworth–Lewis method Gibbs sampling Isotonic regression Twenty20 cricket Index. décimale : 001.424 Résumé : Originally designed for 1-day cricket, this paper considers the use of the Duckworth–Lewis method as an approach to resetting targets in interrupted Twenty20 cricket matches. The Duckworth–Lewis table is reviewed and an alternative resource table is presented. The alternative table is constructed using observed scoring rates from international Twenty20 matches. A desideratum of a resource table is monotonicity in both the rows and columns corresponding to wickets and overs respectively. Consequently, a Gibbs sampling scheme related to isotonic regression is applied to the observed scoring rates to provide a non-parametric resource table. Taking into account the more aggressive batting style of Twenty20 compared to 1-day cricket, the resultant resource table is seen to possess sensible features. A discussion is provided concerning the use of the Duckworth–Lewis method applied to Twenty20. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n11/abs/jors2010175a.html
in Journal of the operational research society (JORS) > Vol. 62 N° 11 (Novembre 2011) . - pp. 1958–1970
Titre : A portfolio approach to managing procurement risk using multi-stage stochastic programming Type de document : texte imprimé Auteurs : Y. Shi, Auteur ; F. Wu, Auteur ; L. K. Chu, Auteur Année de publication : 2011 Article en page(s) : pp. 1958–1970 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Portfolio procurement approach Procurement risk Risk mitigation Stochastic programming Index. décimale : 001.424 Résumé : Procurement is a critical supply chain management function that is susceptible to risk, due mainly to uncertain customer demand and purchase price volatility. A procurement approach in the form of a portfolio that incorporates the common procurement means is proposed. Such means include long-term contracts, spot procurements and option-based supply contracts. The objective is to explore possible synergies among the various procurement means, and so be able to produce optimal or near optimal results in profit while mitigating risk. The implementation of the portfolio approach is based on a multi-stage stochastic programming model in which replenishment decisions are made at various stages along a time horizon, with replenishment quantities being determined by simultaneously considering the stochastic demand and the price volatility of the spot market. The model attempts to minimise the risk exposure of procurement decisions measured as conditional value-at-risk. Numerical experiments to test the effectiveness of the proposed model are performed using demand data from a large air conditioner manufacturer in China and price volatility data from the Shanghai steel market. The results indicate that the proposed model can fairly reliably outperform other approaches, especially when either the demand and/or prices exhibit significant variability. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n11/abs/jors2010149a.html [article] A portfolio approach to managing procurement risk using multi-stage stochastic programming [texte imprimé] / Y. Shi, Auteur ; F. Wu, Auteur ; L. K. Chu, Auteur . - 2011 . - pp. 1958–1970.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 62 N° 11 (Novembre 2011) . - pp. 1958–1970
Mots-clés : Portfolio procurement approach Procurement risk Risk mitigation Stochastic programming Index. décimale : 001.424 Résumé : Procurement is a critical supply chain management function that is susceptible to risk, due mainly to uncertain customer demand and purchase price volatility. A procurement approach in the form of a portfolio that incorporates the common procurement means is proposed. Such means include long-term contracts, spot procurements and option-based supply contracts. The objective is to explore possible synergies among the various procurement means, and so be able to produce optimal or near optimal results in profit while mitigating risk. The implementation of the portfolio approach is based on a multi-stage stochastic programming model in which replenishment decisions are made at various stages along a time horizon, with replenishment quantities being determined by simultaneously considering the stochastic demand and the price volatility of the spot market. The model attempts to minimise the risk exposure of procurement decisions measured as conditional value-at-risk. Numerical experiments to test the effectiveness of the proposed model are performed using demand data from a large air conditioner manufacturer in China and price volatility data from the Shanghai steel market. The results indicate that the proposed model can fairly reliably outperform other approaches, especially when either the demand and/or prices exhibit significant variability. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n11/abs/jors2010149a.html
in Journal of the operational research society (JORS) > Vol. 62 N° 11 (Novembre 2011) . - pp. 1971–1982
Titre : A simulation optimization-based decision support tool for mitigating traffic congestion Type de document : texte imprimé Auteurs : S. H. Melouk, Auteur ; B. B. Keskin, Auteur ; C. Armbrester, Auteur Année de publication : 2011 Article en page(s) : pp. 1971–1982 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Heuristics Simulation Traffic Decision support systems Strategic planning Practice of OR Index. décimale : 001.424 Résumé : Traffic congestion has grown considerably in the United States over the past 20 years. In this paper, we develop a robust decision support tool based on simulation optimization to evaluate and recommend congestion mitigation strategies to transportation system decision-makers. A tabu search-based optimizer determines different network design strategies on the road network while a traffic simulator evaluates the goodness of fit. The tool is tested with real-world traffic data. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n11/abs/jors2010168a.html [article] A simulation optimization-based decision support tool for mitigating traffic congestion [texte imprimé] / S. H. Melouk, Auteur ; B. B. Keskin, Auteur ; C. Armbrester, Auteur . - 2011 . - pp. 1971–1982.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 62 N° 11 (Novembre 2011) . - pp. 1971–1982
Mots-clés : Heuristics Simulation Traffic Decision support systems Strategic planning Practice of OR Index. décimale : 001.424 Résumé : Traffic congestion has grown considerably in the United States over the past 20 years. In this paper, we develop a robust decision support tool based on simulation optimization to evaluate and recommend congestion mitigation strategies to transportation system decision-makers. A tabu search-based optimizer determines different network design strategies on the road network while a traffic simulator evaluates the goodness of fit. The tool is tested with real-world traffic data. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n11/abs/jors2010168a.html
in Journal of the operational research society (JORS) > Vol. 62 N° 11 (Novembre 2011) . - pp. 1983–1991
Titre : Single-machine scheduling of proportionally deteriorating jobs by two agents Type de document : texte imprimé Auteurs : S. Gawiejnowicz, Auteur ; W-C. Lee, Auteur ; C.L. Lin, Auteur Année de publication : 2011 Article en page(s) : pp. 1983–1991 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Agent scheduling Deteriorating jobs Total tardiness The number of tardy jobs Branch-and-bound algorithm Evolutionary algorithm Index. décimale : 001.424 Résumé : We consider a problem of scheduling a set of independent jobs by two agents on a single machine. Every agent has its own subset of jobs to be scheduled and uses its own optimality criterion. The processing time of each job proportionally deteriorates with respect to the starting time of the job. The problem is to find a schedule that minimizes the total tardiness of the first agent, provided that no tardy job is allowed for the second agent. We prove basic properties of the problem and give a lower bound on the optimal value of the total tardiness criterion. On the basis of these results, we propose a branch-and-bound algorithm and an evolutionary algorithm for the problem. Computational experiments show that the exact algorithm solves instances up to 50 jobs in a reasonably short time and that solutions obtained by the metaheuristic are close to optimal ones. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n11/abs/jors2010171a.html [article] Single-machine scheduling of proportionally deteriorating jobs by two agents [texte imprimé] / S. Gawiejnowicz, Auteur ; W-C. Lee, Auteur ; C.L. Lin, Auteur . - 2011 . - pp. 1983–1991.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 62 N° 11 (Novembre 2011) . - pp. 1983–1991
Mots-clés : Agent scheduling Deteriorating jobs Total tardiness The number of tardy jobs Branch-and-bound algorithm Evolutionary algorithm Index. décimale : 001.424 Résumé : We consider a problem of scheduling a set of independent jobs by two agents on a single machine. Every agent has its own subset of jobs to be scheduled and uses its own optimality criterion. The processing time of each job proportionally deteriorates with respect to the starting time of the job. The problem is to find a schedule that minimizes the total tardiness of the first agent, provided that no tardy job is allowed for the second agent. We prove basic properties of the problem and give a lower bound on the optimal value of the total tardiness criterion. On the basis of these results, we propose a branch-and-bound algorithm and an evolutionary algorithm for the problem. Computational experiments show that the exact algorithm solves instances up to 50 jobs in a reasonably short time and that solutions obtained by the metaheuristic are close to optimal ones. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n11/abs/jors2010171a.html
in Journal of the operational research society (JORS) > Vol. 62 N° 11 (Novembre 2011) . - pp. 1992–2001
Titre : On channel coordination under price-dependent revenue-sharing : can eBay's fee structure coordinate the channel? Type de document : texte imprimé Auteurs : J-M. Chen, Auteur ; H-L. Cheng, Auteur ; I-C. Lin, Auteur Année de publication : 2011 Article en page(s) : pp. 1992–2001 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Decision analysis Game theory Inventory Channel coordination Revenue-sharing Index. décimale : 001.424 Résumé : This article deals with the problem of coordinating a vertically separated channel under consignment contracts with a price-dependent revenue-sharing (R-S) function. We consider the retailer being a channel leader who offers the vendor a leave-it-or-take-it contract, and the vendor being a price-setting firm who sells the one-of-a-kind goods through the exclusive channel. Under such a setting, the retailer decides on the term of R-S contract, and the vendor determines the retail price of the product. For each item sold, the retailer deducts an agreed-upon percentage from the price and remits the balance to the vendor. We model the decision-making of the two firms as a Stackelberg game, and carry out equilibrium analysis for both the centralized and decentralized regimes of the channel with consideration of three kinds of contracts: the fixed, the price-increasing, and the price-decreasing R-S percentage. Our analysis reveals that the contract with a price-decreasing R-S function, for example, the fee structure adopted by eBay.com, performs worse than the others. It persists in a consistent bias: the price-decreasing R-S induces the vendor to choose a higher price, and the retailer tends to receive a lower R-S percentage, which leads to less demand quantity, less profit, and channel inefficiency. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n11/abs/jors2010174a.html [article] On channel coordination under price-dependent revenue-sharing : can eBay's fee structure coordinate the channel? [texte imprimé] / J-M. Chen, Auteur ; H-L. Cheng, Auteur ; I-C. Lin, Auteur . - 2011 . - pp. 1992–2001.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 62 N° 11 (Novembre 2011) . - pp. 1992–2001
Mots-clés : Decision analysis Game theory Inventory Channel coordination Revenue-sharing Index. décimale : 001.424 Résumé : This article deals with the problem of coordinating a vertically separated channel under consignment contracts with a price-dependent revenue-sharing (R-S) function. We consider the retailer being a channel leader who offers the vendor a leave-it-or-take-it contract, and the vendor being a price-setting firm who sells the one-of-a-kind goods through the exclusive channel. Under such a setting, the retailer decides on the term of R-S contract, and the vendor determines the retail price of the product. For each item sold, the retailer deducts an agreed-upon percentage from the price and remits the balance to the vendor. We model the decision-making of the two firms as a Stackelberg game, and carry out equilibrium analysis for both the centralized and decentralized regimes of the channel with consideration of three kinds of contracts: the fixed, the price-increasing, and the price-decreasing R-S percentage. Our analysis reveals that the contract with a price-decreasing R-S function, for example, the fee structure adopted by eBay.com, performs worse than the others. It persists in a consistent bias: the price-decreasing R-S induces the vendor to choose a higher price, and the retailer tends to receive a lower R-S percentage, which leads to less demand quantity, less profit, and channel inefficiency. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n11/abs/jors2010174a.html
in Journal of the operational research society (JORS) > Vol. 62 N° 11 (Novembre 2011) . - pp. 2002–2012
Titre : Discrete cooperative covering problems Type de document : texte imprimé Auteurs : O. Berman, Auteur ; Z. Drezner, Auteur ; D. Krass, Auteur Année de publication : 2011 Article en page(s) : pp. 2002–2012 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Cooperative cover Facility location Multiple facilities Index. décimale : 001.424 Résumé : A family of discrete cooperative covering problems is analysed in this paper. Each facility emits a signal that decays by the distance and each demand point observes the total signal emitted by all facilities. A demand point is covered if its cumulative signal exceeds a given threshold. We wish to maximize coverage by selecting locations for p facilities from a given set of potential sites. Two other problems that can be solved by the max-cover approach are the equivalents to set covering and p-centre problems. The problems are formulated, analysed and solved on networks. Optimal and heuristic algorithms are proposed and extensive computational experiments reported. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n11/abs/jors2010176a.html [article] Discrete cooperative covering problems [texte imprimé] / O. Berman, Auteur ; Z. Drezner, Auteur ; D. Krass, Auteur . - 2011 . - pp. 2002–2012.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 62 N° 11 (Novembre 2011) . - pp. 2002–2012
Mots-clés : Cooperative cover Facility location Multiple facilities Index. décimale : 001.424 Résumé : A family of discrete cooperative covering problems is analysed in this paper. Each facility emits a signal that decays by the distance and each demand point observes the total signal emitted by all facilities. A demand point is covered if its cumulative signal exceeds a given threshold. We wish to maximize coverage by selecting locations for p facilities from a given set of potential sites. Two other problems that can be solved by the max-cover approach are the equivalents to set covering and p-centre problems. The problems are formulated, analysed and solved on networks. Optimal and heuristic algorithms are proposed and extensive computational experiments reported. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n11/abs/jors2010176a.html
in Journal of the operational research society (JORS) > Vol. 62 N° 11 (Novembre 2011) . - pp. 2013–2022
Titre : Hybrid metaheuristics for the profitable arc tour problem Type de document : texte imprimé Auteurs : J. Euchi, Auteur ; Chabchoub, H., Auteur Année de publication : 2011 Article en page(s) : pp. 2013–2022 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Vehicle routing Profitable arc tour problem Metaheuristics Index. décimale : 001.424 Résumé : The profitable arc tour problem is a variant in the vehicle routing problems. It is included in the family of the vehicle routing with profit problems in which a set of vehicle tours are constructed. The objective is to find a set of cycles in the vehicle tours that maximize the collection of profits minus travel costs, subject to constraints limiting the length of cycles that profit is available on arcs. To solve this variant we adopted two metaheuristics based on adaptive memory. We show that our algorithms provide good results in terms of solution quality and running times. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n11/abs/jors2010179a.html [article] Hybrid metaheuristics for the profitable arc tour problem [texte imprimé] / J. Euchi, Auteur ; Chabchoub, H., Auteur . - 2011 . - pp. 2013–2022.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 62 N° 11 (Novembre 2011) . - pp. 2013–2022
Mots-clés : Vehicle routing Profitable arc tour problem Metaheuristics Index. décimale : 001.424 Résumé : The profitable arc tour problem is a variant in the vehicle routing problems. It is included in the family of the vehicle routing with profit problems in which a set of vehicle tours are constructed. The objective is to find a set of cycles in the vehicle tours that maximize the collection of profits minus travel costs, subject to constraints limiting the length of cycles that profit is available on arcs. To solve this variant we adopted two metaheuristics based on adaptive memory. We show that our algorithms provide good results in terms of solution quality and running times. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n11/abs/jors2010179a.html
in Journal of the operational research society (JORS) > Vol. 62 N° 11 (Novembre 2011) . - pp. 2023–2033
Titre : Set partitioning and packing versus assignment formulations for subassembly matching problems Type de document : texte imprimé Auteurs : A. Ghoniem, Auteur ; Sherali, H. D., Auteur Année de publication : 2011 Article en page(s) : pp. 2023–2033 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Set partitioning Set packing Column generation Symmetry-defeating constraints Selective assembly Index. décimale : 001.424 Résumé : This paper addresses alternative formulations and model enhancements for two combinatorial optimization problems that arise in subassembly matching problems. The first problem seeks to minimize the total deviation in certain quality characteristics for the resulting final products from a vector of target values, whereas the second aims at maximizing the throughput under specified tolerance restrictions. We propose set partitioning and packing models in concert with a specialized column generation (CG) procedure that significantly outperform alternative assignment-based formulations presented in the literature, even when the latter are enhanced via tailored symmetry-defeating strategies. In particular, we emphasize the critical importance of incorporating a complementary CG feature to consistently produce near-optimal solutions to the proposed set partitioning and packing models. Extensive computational results are presented to demonstrate the relative effectiveness of the different proposed modelling and algorithmic strategies. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n11/abs/jors2010165a.html [article] Set partitioning and packing versus assignment formulations for subassembly matching problems [texte imprimé] / A. Ghoniem, Auteur ; Sherali, H. D., Auteur . - 2011 . - pp. 2023–2033.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 62 N° 11 (Novembre 2011) . - pp. 2023–2033
Mots-clés : Set partitioning Set packing Column generation Symmetry-defeating constraints Selective assembly Index. décimale : 001.424 Résumé : This paper addresses alternative formulations and model enhancements for two combinatorial optimization problems that arise in subassembly matching problems. The first problem seeks to minimize the total deviation in certain quality characteristics for the resulting final products from a vector of target values, whereas the second aims at maximizing the throughput under specified tolerance restrictions. We propose set partitioning and packing models in concert with a specialized column generation (CG) procedure that significantly outperform alternative assignment-based formulations presented in the literature, even when the latter are enhanced via tailored symmetry-defeating strategies. In particular, we emphasize the critical importance of incorporating a complementary CG feature to consistently produce near-optimal solutions to the proposed set partitioning and packing models. Extensive computational results are presented to demonstrate the relative effectiveness of the different proposed modelling and algorithmic strategies. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n11/abs/jors2010165a.html
in Journal of the operational research society (JORS) > Vol. 62 N° 11 (Novembre 2011) . - pp. 2034–2046
Titre : Scatter tabu search for multiobjective clustering problems Type de document : texte imprimé Auteurs : R. Caballero, Auteur ; M. Laguna, Auteur ; R. Martí, Auteur Année de publication : 2011 Article en page(s) : pp. 2034–2046 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : SSPMO Multiobjective optimization Scatter and tabu search Combinatorial data analysis Partitioning Index. décimale : 001.424 Résumé : We propose a hybrid heuristic procedure based on scatter search and tabu search for the problem of clustering objects to optimize multiple criteria. Our goal is to search for good approximations of the efficient frontier for this class of problems and provide a means for improving decision making in multiple application areas. Our procedure can be viewed as an extension of SSPMO (a scatter search application to nonlinear multiobjective optimization) to which we add new elements and strategies specially suited for combinatorial optimization problems. Clustering problems have been the subject of numerous studies; however, most of the work has focused on single-objective problems. Clustering using multiple criteria and/or multiple data sources has received limited attention in the operational research literature. Our scatter tabu search implementation is general and tackles several problems classes within this area of combinatorial data analysis. We conduct extensive experimentation to show that our method is capable of delivering good approximations of the efficient frontier for improved analysis and decision making. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n11/abs/jors2010180a.html [article] Scatter tabu search for multiobjective clustering problems [texte imprimé] / R. Caballero, Auteur ; M. Laguna, Auteur ; R. Martí, Auteur . - 2011 . - pp. 2034–2046.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 62 N° 11 (Novembre 2011) . - pp. 2034–2046
Mots-clés : SSPMO Multiobjective optimization Scatter and tabu search Combinatorial data analysis Partitioning Index. décimale : 001.424 Résumé : We propose a hybrid heuristic procedure based on scatter search and tabu search for the problem of clustering objects to optimize multiple criteria. Our goal is to search for good approximations of the efficient frontier for this class of problems and provide a means for improving decision making in multiple application areas. Our procedure can be viewed as an extension of SSPMO (a scatter search application to nonlinear multiobjective optimization) to which we add new elements and strategies specially suited for combinatorial optimization problems. Clustering problems have been the subject of numerous studies; however, most of the work has focused on single-objective problems. Clustering using multiple criteria and/or multiple data sources has received limited attention in the operational research literature. Our scatter tabu search implementation is general and tackles several problems classes within this area of combinatorial data analysis. We conduct extensive experimentation to show that our method is capable of delivering good approximations of the efficient frontier for improved analysis and decision making. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n11/abs/jors2010180a.html
Exemplaires
| Code-barres | Cote | Support | Localisation | Section | Disponibilité |
|---|---|---|---|---|---|
| aucun exemplaire | |||||
