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 spreadsheet decision support optimization model for railcar storage at Canadian Pacific Railway / R. L. Espey in Journal of the operational research society (JORS), Vol. 63 N° 2 (Fevrier 2012)
in Journal of the operational research society (JORS) > Vol. 63 N° 2 (Fevrier 2012) . - pp. 139–150
Titre : A spreadsheet decision support optimization model for railcar storage at Canadian Pacific Railway Type de document : texte imprimé Auteurs : R. L. Espey, Auteur ; J. Balakrishnan, Auteur Année de publication : 2012 Article en page(s) : pp. 139–150 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Aggregate planning Storage Spreadsheet optimization Mathematical programming Railways Transport Index. décimale : 001.424 Résumé : Canadian railway companies operate in a capital-intensive segment of the transportation industry. In most railway companies, the covered hopper railcar fleet is one of the larger fleets due to its use in moving grain and potash, commodities that move large volumes of product. This railcar fleet is also difficult to manage due to demand seasonality and joint commodity use. This paper demonstrates how an aggregate planning model can be used to support decision making related to optimization of covered hopper railcar storage. Exploratory research prior to model development involved interviews with company personnel. The model was developed through quantitative research and implemented using spreadsheet optimization. The results indicate that using this model can reduce the total cost of storage through effective planning. The model also provided insight to improve railcar storage such as the elimination of excess storage locations and the need to do further investigation. The company is in the process of implementing suggestions from this paper. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n2/abs/jors2010178a.html [article] A spreadsheet decision support optimization model for railcar storage at Canadian Pacific Railway [texte imprimé] / R. L. Espey, Auteur ; J. Balakrishnan, Auteur . - 2012 . - pp. 139–150.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 63 N° 2 (Fevrier 2012) . - pp. 139–150
Mots-clés : Aggregate planning Storage Spreadsheet optimization Mathematical programming Railways Transport Index. décimale : 001.424 Résumé : Canadian railway companies operate in a capital-intensive segment of the transportation industry. In most railway companies, the covered hopper railcar fleet is one of the larger fleets due to its use in moving grain and potash, commodities that move large volumes of product. This railcar fleet is also difficult to manage due to demand seasonality and joint commodity use. This paper demonstrates how an aggregate planning model can be used to support decision making related to optimization of covered hopper railcar storage. Exploratory research prior to model development involved interviews with company personnel. The model was developed through quantitative research and implemented using spreadsheet optimization. The results indicate that using this model can reduce the total cost of storage through effective planning. The model also provided insight to improve railcar storage such as the elimination of excess storage locations and the need to do further investigation. The company is in the process of implementing suggestions from this paper. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n2/abs/jors2010178a.html
in Journal of the operational research society (JORS) > Vol. 63 N° 2 (Fevrier 2012) . - pp. 151–159
Titre : A stochastic dynamic programming model for valuing exclusivity from encroachment in franchising Type de document : texte imprimé Auteurs : S. Tikoo, Auteur ; S. Liu, Auteur ; S. K. Nair, Auteur Année de publication : 2012 Article en page(s) : pp. 151–159 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Franchising Territorial encroachment Exclusivity Stochastic dynamic programming Index. décimale : 001.424 Résumé : Valuing territorial exclusivity in franchising is difficult because of the uncertainty associated with variables such as future franchise sales and brand strength. We present a stochastic dynamic programming model to value the exclusivity option from the perspective of both the franchisor and the franchisee. When there is positive value to the franchisor of including the exclusivity option in the contract, and to the franchisee of purchasing this option, the likelihood of franchisor-franchisee encroachment-related conflict is reduced. We also discuss structural results and explain our results using a numerical example. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n2/abs/jors2010184a.html [article] A stochastic dynamic programming model for valuing exclusivity from encroachment in franchising [texte imprimé] / S. Tikoo, Auteur ; S. Liu, Auteur ; S. K. Nair, Auteur . - 2012 . - pp. 151–159.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 63 N° 2 (Fevrier 2012) . - pp. 151–159
Mots-clés : Franchising Territorial encroachment Exclusivity Stochastic dynamic programming Index. décimale : 001.424 Résumé : Valuing territorial exclusivity in franchising is difficult because of the uncertainty associated with variables such as future franchise sales and brand strength. We present a stochastic dynamic programming model to value the exclusivity option from the perspective of both the franchisor and the franchisee. When there is positive value to the franchisor of including the exclusivity option in the contract, and to the franchisee of purchasing this option, the likelihood of franchisor-franchisee encroachment-related conflict is reduced. We also discuss structural results and explain our results using a numerical example. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n2/abs/jors2010184a.html
in Journal of the operational research society (JORS) > Vol. 63 N° 2 (Fevrier 2012) . - pp. 160–167
Titre : Scheduling an unbounded batching machine with family jobs and setup times Type de document : texte imprimé Auteurs : R. Zheng, Auteur ; H. Li, Auteur ; X. Zhang, Auteur Année de publication : 2012 Article en page(s) : pp. 160–167 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Scheduling Batching machine Family jobs Setup times Dynamic programming Index. décimale : 001.424 Résumé : We consider the problem of scheduling n jobs on an unbounded batching machine that can process any number of jobs belonging to the same family simultaneously in the same batch. All jobs in the same batch complete at the same time. Jobs belonging to different families cannot be processed in the same batch, and setup times are required to switch between batches that process jobs from different families. For a fixed number of families m, we present a generic forward dynamic programming algorithm that solves the problem of minimizing an arbitrary regular cost function in pseudopolynomial time. We also present a polynomial-time backward dynamic programming algorithm with time complexity O (mn(n/m+1)m) for minimizing any additive regular minsum objective function and any incremental regular minmax objective function. The effectiveness of our dynamic programming algorithm is shown by computational experiments based on the scheduling of the heat-treating process in a steel manufacturing plant. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n2/abs/jors2010187a.html [article] Scheduling an unbounded batching machine with family jobs and setup times [texte imprimé] / R. Zheng, Auteur ; H. Li, Auteur ; X. Zhang, Auteur . - 2012 . - pp. 160–167.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 63 N° 2 (Fevrier 2012) . - pp. 160–167
Mots-clés : Scheduling Batching machine Family jobs Setup times Dynamic programming Index. décimale : 001.424 Résumé : We consider the problem of scheduling n jobs on an unbounded batching machine that can process any number of jobs belonging to the same family simultaneously in the same batch. All jobs in the same batch complete at the same time. Jobs belonging to different families cannot be processed in the same batch, and setup times are required to switch between batches that process jobs from different families. For a fixed number of families m, we present a generic forward dynamic programming algorithm that solves the problem of minimizing an arbitrary regular cost function in pseudopolynomial time. We also present a polynomial-time backward dynamic programming algorithm with time complexity O (mn(n/m+1)m) for minimizing any additive regular minsum objective function and any incremental regular minmax objective function. The effectiveness of our dynamic programming algorithm is shown by computational experiments based on the scheduling of the heat-treating process in a steel manufacturing plant. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n2/abs/jors2010187a.html
in Journal of the operational research society (JORS) > Vol. 63 N° 2 (Fevrier 2012) . - pp. 168–182
Titre : A hybrid shifting bottleneck procedure algorithm for the parallel-machine job-shop scheduling problem Type de document : texte imprimé Auteurs : S-Q. Liu, Auteur ; E. Kozan, Auteur Année de publication : 2012 Article en page(s) : pp. 168–182 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Scheduling Heuristics Parallel-machine Job-shop Shifting bottleneck procedure Metaheuristics Index. décimale : 001.424 Résumé : In practice, parallel-machine job-shop scheduling (PMJSS) is very useful in the development of standard modelling approaches and generic solution techniques for many real-world scheduling problems. In this paper, based on the analysis of structural properties in an extended disjunctive graph model, a hybrid shifting bottleneck procedure (HSBP) algorithm combined with Tabu Search (TS) metaheuristic algorithm is developed to deal with the PMJSS problem. The original-version shifting bottleneck procedure (SBP) algorithm for the job-shop scheduling (JSS) has been significantly improved to solve the PMJSS problem with four novelties: (i) a topological-sequence algorithm is proposed to decompose the PMJSS problem in a set of single-machine scheduling (SMS) and/or parallel-machine scheduling subproblems; (ii) a modified Carlier algorithm based on the proposed lemmas and the proofs is developed to solve the SMS subproblem; (iii) the Jackson rule is extended to solve the PMS subproblem; (iv) a TS metaheuristic algorithm is embedded under the framework of SBP to optimise the JSS and PMJSS cases. The computational experiments show that the proposed HSBP is very efficient in solving the JSS and PMJSS problems. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n2/abs/jors20114a.html [article] A hybrid shifting bottleneck procedure algorithm for the parallel-machine job-shop scheduling problem [texte imprimé] / S-Q. Liu, Auteur ; E. Kozan, Auteur . - 2012 . - pp. 168–182.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 63 N° 2 (Fevrier 2012) . - pp. 168–182
Mots-clés : Scheduling Heuristics Parallel-machine Job-shop Shifting bottleneck procedure Metaheuristics Index. décimale : 001.424 Résumé : In practice, parallel-machine job-shop scheduling (PMJSS) is very useful in the development of standard modelling approaches and generic solution techniques for many real-world scheduling problems. In this paper, based on the analysis of structural properties in an extended disjunctive graph model, a hybrid shifting bottleneck procedure (HSBP) algorithm combined with Tabu Search (TS) metaheuristic algorithm is developed to deal with the PMJSS problem. The original-version shifting bottleneck procedure (SBP) algorithm for the job-shop scheduling (JSS) has been significantly improved to solve the PMJSS problem with four novelties: (i) a topological-sequence algorithm is proposed to decompose the PMJSS problem in a set of single-machine scheduling (SMS) and/or parallel-machine scheduling subproblems; (ii) a modified Carlier algorithm based on the proposed lemmas and the proofs is developed to solve the SMS subproblem; (iii) the Jackson rule is extended to solve the PMS subproblem; (iv) a TS metaheuristic algorithm is embedded under the framework of SBP to optimise the JSS and PMJSS cases. The computational experiments show that the proposed HSBP is very efficient in solving the JSS and PMJSS problems. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n2/abs/jors20114a.html
in Journal of the operational research society (JORS) > Vol. 63 N° 2 (Fevrier 2012) . - pp. 183–200
Titre : Generating unconstrained two-dimensional non-guillotine cutting patterns by a Recursive Partitioning Algorithm Type de document : texte imprimé Auteurs : E. G. Birgin, Auteur ; R. D. Lobato, Auteur ; R. Morabito, Auteur Année de publication : 2012 Article en page(s) : pp. 183–200 Note générale : Recherche opérationne183–200lle Langues : Anglais (eng) Mots-clés : Cutting and packing Two-dimensional non-guillotine cutting pattern Dynamic programming Recursive approach Distributor's pallet loading problem Index. décimale : 001.424 Résumé : In this study, a dynamic programming approach to deal with the unconstrained two-dimensional non-guillotine cutting problem is presented. The method extends the recently introduced recursive partitioning approach for the manufacturer's pallet loading problem. The approach involves two phases and uses bounds based on unconstrained two-staged and non-staged guillotine cutting. The method is able to find the optimal cutting pattern of a large number of pro blem instances of moderate sizes known in the literature and a counterexample for which the approach fails to find known optimal solutions was not found. For the instances that the required computer runtime is excessive, the approach is combined with simple heuristics to reduce its running time. Detailed numerical experiments show the reliability of the method. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n2/abs/jors20116a.html [article] Generating unconstrained two-dimensional non-guillotine cutting patterns by a Recursive Partitioning Algorithm [texte imprimé] / E. G. Birgin, Auteur ; R. D. Lobato, Auteur ; R. Morabito, Auteur . - 2012 . - pp. 183–200.
Recherche opérationne183–200lle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 63 N° 2 (Fevrier 2012) . - pp. 183–200
Mots-clés : Cutting and packing Two-dimensional non-guillotine cutting pattern Dynamic programming Recursive approach Distributor's pallet loading problem Index. décimale : 001.424 Résumé : In this study, a dynamic programming approach to deal with the unconstrained two-dimensional non-guillotine cutting problem is presented. The method extends the recently introduced recursive partitioning approach for the manufacturer's pallet loading problem. The approach involves two phases and uses bounds based on unconstrained two-staged and non-staged guillotine cutting. The method is able to find the optimal cutting pattern of a large number of pro blem instances of moderate sizes known in the literature and a counterexample for which the approach fails to find known optimal solutions was not found. For the instances that the required computer runtime is excessive, the approach is combined with simple heuristics to reduce its running time. Detailed numerical experiments show the reliability of the method. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n2/abs/jors20116a.html
in Journal of the operational research society (JORS) > Vol. 63 N° 2 (Fevrier 2012) . - pp. 201–206
Titre : Modelling lost demand in competitive facility location Type de document : texte imprimé Auteurs : Drezner, T., Auteur ; Z. Drezner, Auteur Année de publication : 2012 Article en page(s) : pp. 201–206 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Facility location Competitive Lost demand Elastic demand Index. décimale : 001.424 Résumé : In this paper, we propose a simple new approach to model lost demand (also referred to as elastic demand) in competitive facility location. A ‘dummy’ competing facility that attracts the lost demand is added to the list of competing facilities. All competitive facility location models, regardless of their complexity or assumptions, can be modified to include lost demand and be solved by the same algorithms designed for standard models once the dummy facility is added to the data as an additional competitor. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n2/abs/jors201110a.html [article] Modelling lost demand in competitive facility location [texte imprimé] / Drezner, T., Auteur ; Z. Drezner, Auteur . - 2012 . - pp. 201–206.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 63 N° 2 (Fevrier 2012) . - pp. 201–206
Mots-clés : Facility location Competitive Lost demand Elastic demand Index. décimale : 001.424 Résumé : In this paper, we propose a simple new approach to model lost demand (also referred to as elastic demand) in competitive facility location. A ‘dummy’ competing facility that attracts the lost demand is added to the list of competing facilities. All competitive facility location models, regardless of their complexity or assumptions, can be modified to include lost demand and be solved by the same algorithms designed for standard models once the dummy facility is added to the data as an additional competitor. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n2/abs/jors201110a.html
in Journal of the operational research society (JORS) > Vol. 63 N° 2 (Fevrier 2012) . - pp. 207–217
Titre : The travelling salesperson problem with hotel selection Type de document : texte imprimé Auteurs : P. Vansteenwegen, Auteur ; W. Souffriau, Auteur ; K. Sörensen, Auteur Année de publication : 2012 Article en page(s) : pp. 207–217 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Travelling salesperson problem Hotel selection Heuristic Index. décimale : 001.424 Résumé : In this paper, we present the travelling salesperson problem with hotel selection (TSPHS), an extension of the TSP with a number of interesting applications. We present a mathematical formulation, explain the difference with related optimization problems and indicate what makes this problem inherently more difficult. We develop a simple but efficient heuristic that uses two constructive initialization procedures and an improvement procedure consisting of several neighbourhood search operators designed specifically for this problem, as well as some typical neighbourhoods from the literature. We generate several benchmark instances of varying sizes and compare the performance of our heuristic with CPLEX (10.0). We also generate some problems with known optimal solutions and use these to further demonstrate that our heuristic achieves good results in very limited computation times. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n2/abs/jors201118a.html [article] The travelling salesperson problem with hotel selection [texte imprimé] / P. Vansteenwegen, Auteur ; W. Souffriau, Auteur ; K. Sörensen, Auteur . - 2012 . - pp. 207–217.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 63 N° 2 (Fevrier 2012) . - pp. 207–217
Mots-clés : Travelling salesperson problem Hotel selection Heuristic Index. décimale : 001.424 Résumé : In this paper, we present the travelling salesperson problem with hotel selection (TSPHS), an extension of the TSP with a number of interesting applications. We present a mathematical formulation, explain the difference with related optimization problems and indicate what makes this problem inherently more difficult. We develop a simple but efficient heuristic that uses two constructive initialization procedures and an improvement procedure consisting of several neighbourhood search operators designed specifically for this problem, as well as some typical neighbourhoods from the literature. We generate several benchmark instances of varying sizes and compare the performance of our heuristic with CPLEX (10.0). We also generate some problems with known optimal solutions and use these to further demonstrate that our heuristic achieves good results in very limited computation times. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n2/abs/jors201118a.html
in Journal of the operational research society (JORS) > Vol. 63 N° 2 (Fevrier 2012) . - pp. 218–231
Titre : FMMSIC: a hybrid fuzzy based decision support system for MMS (in order to estimate interrelationships between criteria) Type de document : texte imprimé Auteurs : F. Samimi Namin, Auteur ; K. Shahriar, Auteur ; A. Bascetin, Auteur Année de publication : 2012 Article en page(s) : pp. 218–231 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Hybrid decision support system Fuzzy entropy Fuzzy ANP Modified TOPSIS Mining method selection FMMSIC Index. décimale : 001.424 Résumé : One of the main tasks in exploitation of ore-body is to select a suitable mining method. In mining method selection (MMS) problems, a decision procedure has to choose the best exploitation method that satisfies the evaluation criteria. It is generally hard to find a mining method that meets all the criteria simultaneously, therefore a good compromise solution is preferred as the final selection. Furthermore, the MMS problem is an inherently uncertain activity. To deal with the uncertainty, this paper presents an hybrid decision support system based on the fuzzy multi attribute decision making, named the fuzzy mining method selection with interrelation criteria (FMMSIC). FMMSIC models the relative weights of criteria by combining the fuzzy analytic network process and fuzzy entropy, and discusses using these hybrid techniques to determine the overall weights. Subsequently, the technique for order preference by similarity to an ideal solution method was modified by various normalization norms according to the MMS problem condition. Finally, to illustrate how the FMMSIC is used for the MMS problems, an empirical study of a real case is conducted. It shows by means of an application that the FMMSIC is well suited as a decision support system for the MMS. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n2/abs/jors201124a.html [article] FMMSIC: a hybrid fuzzy based decision support system for MMS (in order to estimate interrelationships between criteria) [texte imprimé] / F. Samimi Namin, Auteur ; K. Shahriar, Auteur ; A. Bascetin, Auteur . - 2012 . - pp. 218–231.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 63 N° 2 (Fevrier 2012) . - pp. 218–231
Mots-clés : Hybrid decision support system Fuzzy entropy Fuzzy ANP Modified TOPSIS Mining method selection FMMSIC Index. décimale : 001.424 Résumé : One of the main tasks in exploitation of ore-body is to select a suitable mining method. In mining method selection (MMS) problems, a decision procedure has to choose the best exploitation method that satisfies the evaluation criteria. It is generally hard to find a mining method that meets all the criteria simultaneously, therefore a good compromise solution is preferred as the final selection. Furthermore, the MMS problem is an inherently uncertain activity. To deal with the uncertainty, this paper presents an hybrid decision support system based on the fuzzy multi attribute decision making, named the fuzzy mining method selection with interrelation criteria (FMMSIC). FMMSIC models the relative weights of criteria by combining the fuzzy analytic network process and fuzzy entropy, and discusses using these hybrid techniques to determine the overall weights. Subsequently, the technique for order preference by similarity to an ideal solution method was modified by various normalization norms according to the MMS problem condition. Finally, to illustrate how the FMMSIC is used for the MMS problems, an empirical study of a real case is conducted. It shows by means of an application that the FMMSIC is well suited as a decision support system for the MMS. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n2/abs/jors201124a.html
in Journal of the operational research society (JORS) > Vol. 63 N° 2 (Fevrier 2012) . - pp. 232–244
Titre : An incremental tabu search heuristic for the generalized vehicle routing problem with time windows Type de document : texte imprimé Auteurs : L. Moccia, Auteur ; J.-F. Cordeau, Auteur ; G. Laporte, Auteur Année de publication : 2012 Article en page(s) : pp. 232–244 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Generalized vehicle routing problem Time windows Tabu search Large neighbourhood search Index. décimale : 001.424 Résumé : This paper describes an incremental neighbourhood tabu search heuristic for the generalized vehicle routing problem with time windows. The purpose of this work is to offer a general tool that can be successfully applied to a wide variety of specific problems. The algorithm builds upon a previously developed tabu search heuristic by replacing its neighbourhood structure. The new neighbourhood is exponential in size, but the proposed evaluation procedure has polynomial complexity. Computational results are presented and demonstrate the effectiveness of the approach. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n2/abs/jors201125a.html [article] An incremental tabu search heuristic for the generalized vehicle routing problem with time windows [texte imprimé] / L. Moccia, Auteur ; J.-F. Cordeau, Auteur ; G. Laporte, Auteur . - 2012 . - pp. 232–244.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 63 N° 2 (Fevrier 2012) . - pp. 232–244
Mots-clés : Generalized vehicle routing problem Time windows Tabu search Large neighbourhood search Index. décimale : 001.424 Résumé : This paper describes an incremental neighbourhood tabu search heuristic for the generalized vehicle routing problem with time windows. The purpose of this work is to offer a general tool that can be successfully applied to a wide variety of specific problems. The algorithm builds upon a previously developed tabu search heuristic by replacing its neighbourhood structure. The new neighbourhood is exponential in size, but the proposed evaluation procedure has polynomial complexity. Computational results are presented and demonstrate the effectiveness of the approach. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n2/abs/jors201125a.html
in Journal of the operational research society (JORS) > Vol. 63 N° 2 (Fevrier 2012) . - pp. 245–260
Titre : Applying min–max k postmen problems to the routing of security guards Type de document : texte imprimé Auteurs : E. J. Willemse, Auteur ; J. W. Joubert, Auteur Année de publication : 2012 Article en page(s) : pp. 245–260 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Arc routing Chinese postman problem Rural postman problem Tabu search algorithm Security guard routing Index. décimale : 001.424 Résumé : The most essential and alluring characteristic of a security estate is the estate's ability to provide 24-h security to its residents, of which the continual patrolling of roads and paths is vital. The objective of this paper is to address the lack of sufficient patrol route design procedures by presenting a tabu search algorithm capable of generating multiple patrol routes for an estate's security guards. The paper shows that the problem of designing these routes can be modelled as an Arc Routing Problem, specifically as min–max k postmen problems. The algorithm is illustrated with a real problem instance from an estate in Gauteng, South Africa. The patrol routes generated by the algorithm provide a significant improvement in the even patrolling of the road network, and a more balanced work distribution among guards. The algorithm is also tested on several benchmark problems from literature. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n2/abs/jors201126a.html [article] Applying min–max k postmen problems to the routing of security guards [texte imprimé] / E. J. Willemse, Auteur ; J. W. Joubert, Auteur . - 2012 . - pp. 245–260.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 63 N° 2 (Fevrier 2012) . - pp. 245–260
Mots-clés : Arc routing Chinese postman problem Rural postman problem Tabu search algorithm Security guard routing Index. décimale : 001.424 Résumé : The most essential and alluring characteristic of a security estate is the estate's ability to provide 24-h security to its residents, of which the continual patrolling of roads and paths is vital. The objective of this paper is to address the lack of sufficient patrol route design procedures by presenting a tabu search algorithm capable of generating multiple patrol routes for an estate's security guards. The paper shows that the problem of designing these routes can be modelled as an Arc Routing Problem, specifically as min–max k postmen problems. The algorithm is illustrated with a real problem instance from an estate in Gauteng, South Africa. The patrol routes generated by the algorithm provide a significant improvement in the even patrolling of the road network, and a more balanced work distribution among guards. The algorithm is also tested on several benchmark problems from literature. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n2/abs/jors201126a.html
in Journal of the operational research society (JORS) > Vol. 63 N° 2 (Fevrier 2012) . - pp. 261–277
Titre : A column generation-based heuristic for rostering with work patterns Type de document : texte imprimé Auteurs : R. Lusby, Auteur ; A. Dohn, Auteur ; T. M. Range, Auteur Année de publication : 2012 Article en page(s) : pp. 261–277 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Manpower planning Optimization Cutting stock problem Column generation Index. décimale : 001.424 Résumé : This paper addresses the Ground Crew Rostering Problem with Work Patterns, an important manpower planning problem arising in the ground operations of airline companies. We present a cutting stock-based integer programming formulation of the problem and describe a powerful heuristic decomposition approach, which utilizes column generation and variable fixing, to construct efficient rosters for a six-month time horizon. The time horizon is divided into smaller blocks, where overlaps between the blocks ensure continuity. The proposed methodology is able to circumvent one step of the conventional roster construction process by generating rosters directly based on the estimated workload. We demonstrate that this approach has the additional advantage of being able to easily incorporate robustness in the roster. Computational results on real-life instances confirm the efficiency of the approach. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n2/abs/jors201127a.html [article] A column generation-based heuristic for rostering with work patterns [texte imprimé] / R. Lusby, Auteur ; A. Dohn, Auteur ; T. M. Range, Auteur . - 2012 . - pp. 261–277.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 63 N° 2 (Fevrier 2012) . - pp. 261–277
Mots-clés : Manpower planning Optimization Cutting stock problem Column generation Index. décimale : 001.424 Résumé : This paper addresses the Ground Crew Rostering Problem with Work Patterns, an important manpower planning problem arising in the ground operations of airline companies. We present a cutting stock-based integer programming formulation of the problem and describe a powerful heuristic decomposition approach, which utilizes column generation and variable fixing, to construct efficient rosters for a six-month time horizon. The time horizon is divided into smaller blocks, where overlaps between the blocks ensure continuity. The proposed methodology is able to circumvent one step of the conventional roster construction process by generating rosters directly based on the estimated workload. We demonstrate that this approach has the additional advantage of being able to easily incorporate robustness in the roster. Computational results on real-life instances confirm the efficiency of the approach. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n2/abs/jors201127a.html
in Journal of the operational research society (JORS) > Vol. 63 N° 2 (Fevrier 2012) . - pp. 278–292
Titre : An Australian approach to concept development and experimentation : linking strategy to capability Type de document : texte imprimé Auteurs : C. van Antwerpen, Auteur ; D. K. Bowley, Auteur Année de publication : 2012 Article en page(s) : pp. 278–292 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Defence studies Gaming Military Practice of OR Index. décimale : 001.424 Résumé : Defence forces continue to evolve as new technologies, approaches to warfare and roles are introduced. With defence being a significant ongoing investment for any nation, and with the typical longevity of the capabilities involved, there are challenges in developing a robust force able to meet its national interests against a backdrop of a changing strategic landscape and constrained budgets. In an effort to address these challenges, an analytical construct has been developed for experimentation that provides a traceable linkage from government guidance through to the capability implications. A key component of the construct is to provide those involved in experimentation exercises with a suitable representation of an active dynamic adversary who is able to stress their responses and expose key vulnerabilities and potential capability tipping points. The principle adopted is that more is learnt by examining the breaking points of the system. This paper outlines the framework and some of the tools and techniques developed in its support. The proposed construct also incorporates a level of scrutiny to establish confidence in results obtained. The framework has been successfully applied to the Australian Defence Capability Program. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n2/abs/jors201128a.html [article] An Australian approach to concept development and experimentation : linking strategy to capability [texte imprimé] / C. van Antwerpen, Auteur ; D. K. Bowley, Auteur . - 2012 . - pp. 278–292.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 63 N° 2 (Fevrier 2012) . - pp. 278–292
Mots-clés : Defence studies Gaming Military Practice of OR Index. décimale : 001.424 Résumé : Defence forces continue to evolve as new technologies, approaches to warfare and roles are introduced. With defence being a significant ongoing investment for any nation, and with the typical longevity of the capabilities involved, there are challenges in developing a robust force able to meet its national interests against a backdrop of a changing strategic landscape and constrained budgets. In an effort to address these challenges, an analytical construct has been developed for experimentation that provides a traceable linkage from government guidance through to the capability implications. A key component of the construct is to provide those involved in experimentation exercises with a suitable representation of an active dynamic adversary who is able to stress their responses and expose key vulnerabilities and potential capability tipping points. The principle adopted is that more is learnt by examining the breaking points of the system. This paper outlines the framework and some of the tools and techniques developed in its support. The proposed construct also incorporates a level of scrutiny to establish confidence in results obtained. The framework has been successfully applied to the Australian Defence Capability Program. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n2/abs/jors201128a.html
Exemplaires
| Code-barres | Cote | Support | Localisation | Section | Disponibilité |
|---|---|---|---|---|---|
| aucun exemplaire | |||||
