Dépouillements

Motif detection inspired by immune memory / Wilson, W. in Journal of the operational research society (JORS), Vol. 62 N° 2 Special issue (Fevrier 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 2 Special issue (Fevrier 2011) . - pp. 253–265 Titre : Motif detection inspired by immune memory Type de document : texte imprimé Auteurs : Wilson, W., Auteur ; Birkin, P., Auteur ; Aickelin, U., Auteur Année de publication : 2011 Article en page(s) : pp. 253–265 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Heuristics  Time  series  Motif  detection  Artificial  immune  systems  Immune  memory Index. décimale : 001.424 Résumé : The search for patterns or motifs in data represents an area of key interest to many researchers. In this paper we present the motif tracking algorithm (MTA), a novel immune-inspired pattern identification tool that is able to identify variable length unknown motifs that repeat within time series data. The algorithm searches from a neutral perspective that is independent of the data being analysed and the underlying motifs. In this paper we test the flexibility of the MTA by applying it to the search for patterns in two industrial data sets. The algorithm is able to identify a population of meaningful motifs in both cases, and the value of these motifs is discussed. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n2/abs/jors201081a.html [article] Motif detection inspired by immune memory [texte imprimé] / Wilson, W., Auteur ; Birkin, P., Auteur ; Aickelin, U., Auteur . - 2011 . - pp. 253–265. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 2 Special issue (Fevrier 2011) . - pp. 253–265 Mots-clés : Heuristics  Time  series  Motif  detection  Artificial  immune  systems  Immune  memory Index. décimale : 001.424 Résumé : The search for patterns or motifs in data represents an area of key interest to many researchers. In this paper we present the motif tracking algorithm (MTA), a novel immune-inspired pattern identification tool that is able to identify variable length unknown motifs that repeat within time series data. The algorithm searches from a neutral perspective that is independent of the data being analysed and the underlying motifs. In this paper we test the flexibility of the MTA by applying it to the search for patterns in two industrial data sets. The algorithm is able to identify a population of meaningful motifs in both cases, and the value of these motifs is discussed. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n2/abs/jors201081a.html

Comparing local search metaheuristics for the maximum diversity problem / Aringhier, R. in Journal of the operational research society (JORS), Vol. 62 N° 2 Special issue (Fevrier 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 2 Special issue (Fevrier 2011) . - pp. 266–280 Titre : Comparing local search metaheuristics for the maximum diversity problem Type de document : texte imprimé Auteurs : Aringhier, R., Auteur ; Cordone, R., Auteur Année de publication : 2011 Article en page(s) : pp. 266–280 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Maximum  diversity  problem  Tabu  search  Scatter  scarch  Variable  neighbourhood  search  Random  restart  comparisons Index. décimale : 001.424 Résumé : The Maximum Diversity Problem (MDP) requires to extract a subset M of given cardinality from a set N, maximising the sum of the pair-wise diversities between the extracted elements. The MDP has recently been the subject of much research, and several sophisticated heuristics have been proposed to solve it. The present work compares four local search metaheuristics for the MDP, all based on the same Tabu Search procedure, with the aim to identify what additional elements provide the strongest improvement. The four metaheuristics are an Exploring Tabu Search, a Scatter Search, a Variable Neighbourhood Search and a simple Random Restart algorithm. All of them prove competitive with the best algorithms proposed in the literature. Quite surprisingly, the best ones are the simple Random Restart algorithm and a Variable Neighbourhood Search algorithm with an unusual parameter setting, which makes it quite close to random restart. Although this is probably related to the elementary structure of the MDP, it also suggests that, more often than expected, simpler algorithms might be better. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n2/abs/jors2010104a.html [article] Comparing local search metaheuristics for the maximum diversity problem [texte imprimé] / Aringhier, R., Auteur ; Cordone, R., Auteur . - 2011 . - pp. 266–280. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 2 Special issue (Fevrier 2011) . - pp. 266–280 Mots-clés : Maximum  diversity  problem  Tabu  search  Scatter  scarch  Variable  neighbourhood  search  Random  restart  comparisons Index. décimale : 001.424 Résumé : The Maximum Diversity Problem (MDP) requires to extract a subset M of given cardinality from a set N, maximising the sum of the pair-wise diversities between the extracted elements. The MDP has recently been the subject of much research, and several sophisticated heuristics have been proposed to solve it. The present work compares four local search metaheuristics for the MDP, all based on the same Tabu Search procedure, with the aim to identify what additional elements provide the strongest improvement. The four metaheuristics are an Exploring Tabu Search, a Scatter Search, a Variable Neighbourhood Search and a simple Random Restart algorithm. All of them prove competitive with the best algorithms proposed in the literature. Quite surprisingly, the best ones are the simple Random Restart algorithm and a Variable Neighbourhood Search algorithm with an unusual parameter setting, which makes it quite close to random restart. Although this is probably related to the elementary structure of the MDP, it also suggests that, more often than expected, simpler algorithms might be better. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n2/abs/jors2010104a.html

Learning agents for the multi-mode project scheduling problem / Wauters, T. in Journal of the operational research society (JORS), Vol. 62 N° 2 Special issue (Fevrier 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 2 Special issue (Fevrier 2011) . - pp. 281–290 Titre : Learning agents for the multi-mode project scheduling problem Type de document : texte imprimé Auteurs : Wauters, T., Auteur ; Verbeeck, K., Auteur ; Vanden Berghe, G., Auteur Année de publication : 2011 Article en page(s) : pp. 281–290 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Project  scheduling  Multi-agent  reinforcement  learning  Learning  automata Index. décimale : 001.424 Résumé : Intelligent optimization refers to the promising technique of integrating learning mechanisms into (meta-)heuristic search. In this paper, we use multi-agent reinforcement learning for building high-quality solutions for the multi-mode resource-constrained project scheduling problem (MRCPSP). We use a network of distributed reinforcement learning agents that cooperate to jointly learn a well-performing constructive heuristic. Each agent, being responsible for one activity, uses two simple learning devices, called learning automata, that learn to select a successor activity order and a mode, respectively. By coupling the reward signals for both learning tasks, we can clearly show the advantage of using reinforcement learning in search. We present some comparative results, to show that our method can compete with the best performing algorithms for the MRCPSP, yet using only simple learning schemes without the burden of complex fine-tuning. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n2/abs/jors2010101a.html [article] Learning agents for the multi-mode project scheduling problem [texte imprimé] / Wauters, T., Auteur ; Verbeeck, K., Auteur ; Vanden Berghe, G., Auteur . - 2011 . - pp. 281–290. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 2 Special issue (Fevrier 2011) . - pp. 281–290 Mots-clés : Project  scheduling  Multi-agent  reinforcement  learning  Learning  automata Index. décimale : 001.424 Résumé : Intelligent optimization refers to the promising technique of integrating learning mechanisms into (meta-)heuristic search. In this paper, we use multi-agent reinforcement learning for building high-quality solutions for the multi-mode resource-constrained project scheduling problem (MRCPSP). We use a network of distributed reinforcement learning agents that cooperate to jointly learn a well-performing constructive heuristic. Each agent, being responsible for one activity, uses two simple learning devices, called learning automata, that learn to select a successor activity order and a mode, respectively. By coupling the reward signals for both learning tasks, we can clearly show the advantage of using reinforcement learning in search. We present some comparative results, to show that our method can compete with the best performing algorithms for the MRCPSP, yet using only simple learning schemes without the burden of complex fine-tuning. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n2/abs/jors2010101a.html

Exact and heuristic methods for cell suppression in multi-dimensional linked tables / Roehrig, S. F. in Journal of the operational research society (JORS), Vol. 62 N° 2 Special issue (Fevrier 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 2 Special issue (Fevrier 2011) . - pp. 291–304 Titre : Exact and heuristic methods for cell suppression in multi-dimensional linked tables Type de document : texte imprimé Auteurs : Roehrig, S. F., Auteur ; Padman, R., Auteur ; Krishnan, R., Auteur Année de publication : 2011 Article en page(s) : pp. 291–304 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Privacy  Confidentiality  Heuristics  Inferential  disclosure  Cell  suppression  Tabu  search Index. décimale : 001.424 Résumé : The increasing demand for information, coupled with the increasing capability of computer systems, has compelled information providers to reassess their procedures for preventing disclosure of confidential information. This paper considers the problem of protecting an unpublished, sensitive table by suppressing cells in related, published tables. A conventional integer programming technique for two-dimensional tables is extended to find an optimal suppression set for the public tables. This can be used to protect the confidentiality of sensitive data in three- and higher-dimensional tables. More importantly, heuristics that are intimately related to the structure of the problem are also presented to mitigate the computational difficulty of the integer program. An example is drawn from healthcare management. Data tables are randomly generated to assess the computational time/space restrictions of the IP model, and to evaluate the heuristics. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n2/abs/jors2010133a.html [article] Exact and heuristic methods for cell suppression in multi-dimensional linked tables [texte imprimé] / Roehrig, S. F., Auteur ; Padman, R., Auteur ; Krishnan, R., Auteur . - 2011 . - pp. 291–304. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 2 Special issue (Fevrier 2011) . - pp. 291–304 Mots-clés : Privacy  Confidentiality  Heuristics  Inferential  disclosure  Cell  suppression  Tabu  search Index. décimale : 001.424 Résumé : The increasing demand for information, coupled with the increasing capability of computer systems, has compelled information providers to reassess their procedures for preventing disclosure of confidential information. This paper considers the problem of protecting an unpublished, sensitive table by suppressing cells in related, published tables. A conventional integer programming technique for two-dimensional tables is extended to find an optimal suppression set for the public tables. This can be used to protect the confidentiality of sensitive data in three- and higher-dimensional tables. More importantly, heuristics that are intimately related to the structure of the problem are also presented to mitigate the computational difficulty of the integer program. An example is drawn from healthcare management. Data tables are randomly generated to assess the computational time/space restrictions of the IP model, and to evaluate the heuristics. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n2/abs/jors2010133a.html

Revisiting the big valley search space structure in the TSP / Hains, D. R. in Journal of the operational research society (JORS), Vol. 62 N° 2 Special issue (Fevrier 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 2 Special issue (Fevrier 2011) . - pp. 305–312 Titre : Revisiting the big valley search space structure in the TSP Type de document : texte imprimé Auteurs : Hains, D. R., Auteur ; Whitley, L. D., Auteur ; Howe, A. E., Auteur Année de publication : 2011 Article en page(s) : pp. 305–312 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Combinatorial  optimization  Local  search  Travelling  salesman  problem Index. décimale : 001.424 Résumé : The solution space of the travelling salesman problem under 2-opt moves has been characterized as having a big-valley structure, in which the evaluation of a tour is positively correlated to the distance of the tour from the global optimum. We examine the big-valley hypothesis more closely and show that while the big-valley structure does appear in much of the solution space, it breaks down around local optima that have solutions whose evaluation is very close to that of the global optimum; multiple funnels appear around local optima with evaluations close to the global optimum. The appearance of multiple funnels explains why certain iterated local search heuristics can quickly find high-quality solutions, but fail to consistently find the global optimum. We then investigate a novel search operator, which is demonstrated to have the ability to escape funnels at evaluations close to the global optimum. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n2/abs/jors2010116a.html [article] Revisiting the big valley search space structure in the TSP [texte imprimé] / Hains, D. R., Auteur ; Whitley, L. D., Auteur ; Howe, A. E., Auteur . - 2011 . - pp. 305–312. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 2 Special issue (Fevrier 2011) . - pp. 305–312 Mots-clés : Combinatorial  optimization  Local  search  Travelling  salesman  problem Index. décimale : 001.424 Résumé : The solution space of the travelling salesman problem under 2-opt moves has been characterized as having a big-valley structure, in which the evaluation of a tour is positively correlated to the distance of the tour from the global optimum. We examine the big-valley hypothesis more closely and show that while the big-valley structure does appear in much of the solution space, it breaks down around local optima that have solutions whose evaluation is very close to that of the global optimum; multiple funnels appear around local optima with evaluations close to the global optimum. The appearance of multiple funnels explains why certain iterated local search heuristics can quickly find high-quality solutions, but fail to consistently find the global optimum. We then investigate a novel search operator, which is demonstrated to have the ability to escape funnels at evaluations close to the global optimum. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n2/abs/jors2010116a.html

Solving multi-objective multicast routing problems by evolutionary multi-objective simulated annealing algorithms with variable neighbourhoods / Xu, Y. in Journal of the operational research society (JORS), Vol. 62 N° 2 Special issue (Fevrier 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 2 Special issue (Fevrier 2011) . - pp. 313–325 Titre : Solving multi-objective multicast routing problems by evolutionary multi-objective simulated annealing algorithms with variable neighbourhoods Type de document : texte imprimé Auteurs : Xu, Y., Auteur ; Qu, R., Auteur Année de publication : 2011 Article en page(s) : pp. 313–325 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Multi-objective  optimisation  Evolutionary  multi-objective  simulated  annealing  Variable  neighbourhood  search  Multicast  routing Index. décimale : 001.424 Résumé : This paper presents the investigation of an evolutionary multi-objective simulated annealing (EMOSA) algorithm with variable neighbourhoods to solve the multi-objective multicast routing problems in telecommunications. The hybrid algorithm aims to carry out a more flexible and adaptive exploration in the complex search space by using features of the variable neighbourhood search to find more non-dominated solutions in the Pareto front. Different neighbourhood strictures have been designed with regard to the set of objectives, aiming to drive the search towards optimising all objectives simultaneously. A large number of simulations have been carried out on benchmark instances and random networks with real world features including cost, delay and link utilisations. Experimental results demonstrate that the proposed EMOSA algorithm with variable neighbourhoods is able to find high-quality non-dominated solutions for the problems tested. In particular, the neighbourhood structures that are specifically designed for each objective significantly improved the performance of the proposed algorithm compared with variants of the algorithm with a single neighbourhood. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n2/abs/jors2010138a.html [article] Solving multi-objective multicast routing problems by evolutionary multi-objective simulated annealing algorithms with variable neighbourhoods [texte imprimé] / Xu, Y., Auteur ; Qu, R., Auteur . - 2011 . - pp. 313–325. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 2 Special issue (Fevrier 2011) . - pp. 313–325 Mots-clés : Multi-objective  optimisation  Evolutionary  multi-objective  simulated  annealing  Variable  neighbourhood  search  Multicast  routing Index. décimale : 001.424 Résumé : This paper presents the investigation of an evolutionary multi-objective simulated annealing (EMOSA) algorithm with variable neighbourhoods to solve the multi-objective multicast routing problems in telecommunications. The hybrid algorithm aims to carry out a more flexible and adaptive exploration in the complex search space by using features of the variable neighbourhood search to find more non-dominated solutions in the Pareto front. Different neighbourhood strictures have been designed with regard to the set of objectives, aiming to drive the search towards optimising all objectives simultaneously. A large number of simulations have been carried out on benchmark instances and random networks with real world features including cost, delay and link utilisations. Experimental results demonstrate that the proposed EMOSA algorithm with variable neighbourhoods is able to find high-quality non-dominated solutions for the problems tested. In particular, the neighbourhood structures that are specifically designed for each objective significantly improved the performance of the proposed algorithm compared with variants of the algorithm with a single neighbourhood. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n2/abs/jors2010138a.html

Tabu search with ejection chains for the vehicle routing problem with private fleet and common carrier / Potvin, J.-Y. in Journal of the operational research society (JORS), Vol. 62 N° 2 Special issue (Fevrier 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 2 Special issue (Fevrier 2011) . - pp. 326–336 Titre : Tabu search with ejection chains for the vehicle routing problem with private fleet and common carrier Type de document : texte imprimé Auteurs : Potvin, J.-Y., Auteur ; Naud, M.-A., Auteur Année de publication : 2011 Article en page(s) : pp. 326–336 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Vehicle  routing  Private  fleet  Common  carrier  Tabu  search  Ejection  chains Index. décimale : 001.424 Résumé : The problem reported in this paper is a variant of the classical vehicle routing problem, where customer requests for a transportation company can be served either by its private fleet of vehicles or assigned to an external common carrier. The latter case occurs if the demand exceeds the total capacity of the private fleet or if it is more economical to do so. Accordingly, the objective is to minimize the variable and fixed costs of the private fleet plus the costs charged by the common carrier. A tabu search heuristic with a neighbourhood structure based on ejection chains is proposed to solve this problem. It is empirically demonstrated that this algorithm outperforms the best approaches reported in the literature on a set of benchmark instances with both homogeneous and heterogeneous fleets. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n2/abs/jors2010102a.html [article] Tabu search with ejection chains for the vehicle routing problem with private fleet and common carrier [texte imprimé] / Potvin, J.-Y., Auteur ; Naud, M.-A., Auteur . - 2011 . - pp. 326–336. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 2 Special issue (Fevrier 2011) . - pp. 326–336 Mots-clés : Vehicle  routing  Private  fleet  Common  carrier  Tabu  search  Ejection  chains Index. décimale : 001.424 Résumé : The problem reported in this paper is a variant of the classical vehicle routing problem, where customer requests for a transportation company can be served either by its private fleet of vehicles or assigned to an external common carrier. The latter case occurs if the demand exceeds the total capacity of the private fleet or if it is more economical to do so. Accordingly, the objective is to minimize the variable and fixed costs of the private fleet plus the costs charged by the common carrier. A tabu search heuristic with a neighbourhood structure based on ejection chains is proposed to solve this problem. It is empirically demonstrated that this algorithm outperforms the best approaches reported in the literature on a set of benchmark instances with both homogeneous and heterogeneous fleets. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n2/abs/jors2010102a.html

An advanced tabu search for solving the mixed payload airlift loading problem / Nance, R. L. in Journal of the operational research society (JORS), Vol. 62 N° 2 Special issue (Fevrier 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 2 Special issue (Fevrier 2011) . - pp. 337–347 Titre : An advanced tabu search for solving the mixed payload airlift loading problem Type de document : texte imprimé Auteurs : Nance, R. L., Auteur ; Roesener, A. G., Auteur ; Moore, J. T, Auteur Année de publication : 2011 Article en page(s) : pp. 337–347 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Military  Heuristic  Logistics Index. décimale : 001.424 Résumé : This article describes a new, two-dimensional bin packing algorithm that feasibly loads a set of cargo items on a minimal set of airlift aircraft. The problem under consideration is called the Mixed Payload Airlift Loading Problem (MPALP). The heuristic algorithm, called the Mixed Payload Airlift Loading Problem Tabu Search (MPALPTS), surpasses previous research conducted in this area because, in addition to pure pallet cargo loads, MPALPTS can accommodate rolling stock cargo (ie tanks, trucks, HMMMVs, etc) while still maintaining feasibility. To demonstrate its effectiveness, the load plans generated by MPALPTS are directly compared to those generated by the Automated Air Load Planning Software (AALPS) for a given cargo set; AALPS is the load planning software currently mandated for use in all Department of Defense load planning. While more time consuming than AALPS, MPALPTS required the same or fewer aircraft than AALPS in all test scenarios. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n2/abs/jors2010119a.html [article] An advanced tabu search for solving the mixed payload airlift loading problem [texte imprimé] / Nance, R. L., Auteur ; Roesener, A. G., Auteur ; Moore, J. T, Auteur . - 2011 . - pp. 337–347. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 2 Special issue (Fevrier 2011) . - pp. 337–347 Mots-clés : Military  Heuristic  Logistics Index. décimale : 001.424 Résumé : This article describes a new, two-dimensional bin packing algorithm that feasibly loads a set of cargo items on a minimal set of airlift aircraft. The problem under consideration is called the Mixed Payload Airlift Loading Problem (MPALP). The heuristic algorithm, called the Mixed Payload Airlift Loading Problem Tabu Search (MPALPTS), surpasses previous research conducted in this area because, in addition to pure pallet cargo loads, MPALPTS can accommodate rolling stock cargo (ie tanks, trucks, HMMMVs, etc) while still maintaining feasibility. To demonstrate its effectiveness, the load plans generated by MPALPTS are directly compared to those generated by the Automated Air Load Planning Software (AALPS) for a given cargo set; AALPS is the load planning software currently mandated for use in all Department of Defense load planning. While more time consuming than AALPS, MPALPTS required the same or fewer aircraft than AALPS in all test scenarios. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n2/abs/jors2010119a.html

Hybrid approach for Pareto front expansion in heuristics / Yapicioglu, H. in Journal of the operational research society (JORS), Vol. 62 N° 2 Special issue (Fevrier 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 2 Special issue (Fevrier 2011) . - pp. 348–359 Titre : Hybrid approach for Pareto front expansion in heuristics Type de document : texte imprimé Auteurs : Yapicioglu, H., Auteur ; Liu, H., Auteur ; Smith, A. E., Auteur Année de publication : 2011 Article en page(s) : pp. 348–359 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Kriging  General  regression  neural  network  Multi-objective  optimization  Heuristic  search  Hybrid  methods Index. décimale : 001.424 Résumé : Heuristic search can be an effective multi-objective optimization tool; however, the required frequent function evaluations can exhaust computational sources. This paper explores using a hybrid approach with statistical interpolation methods to expand optimal solutions obtained by multiple criteria heuristic search. The goal is to significantly increase the number of Pareto optimal solutions while limiting computational effort. The interpolation approaches studied are kriging and general regression neural networks. This paper develops a hybrid methodology combining an interpolator with a heuristic, and examines performance on several non-linear bi-objective example problems. Computational experience shows this approach successfully expands and enriches the Pareto fronts of multi-objective optimization problems. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n2/abs/jors2010151a.html [article] Hybrid approach for Pareto front expansion in heuristics [texte imprimé] / Yapicioglu, H., Auteur ; Liu, H., Auteur ; Smith, A. E., Auteur . - 2011 . - pp. 348–359. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 2 Special issue (Fevrier 2011) . - pp. 348–359 Mots-clés : Kriging  General  regression  neural  network  Multi-objective  optimization  Heuristic  search  Hybrid  methods Index. décimale : 001.424 Résumé : Heuristic search can be an effective multi-objective optimization tool; however, the required frequent function evaluations can exhaust computational sources. This paper explores using a hybrid approach with statistical interpolation methods to expand optimal solutions obtained by multiple criteria heuristic search. The goal is to significantly increase the number of Pareto optimal solutions while limiting computational effort. The interpolation approaches studied are kriging and general regression neural networks. This paper develops a hybrid methodology combining an interpolator with a heuristic, and examines performance on several non-linear bi-objective example problems. Computational experience shows this approach successfully expands and enriches the Pareto fronts of multi-objective optimization problems. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n2/abs/jors2010151a.html

Progress control in iterated local search for nurse rostering / Burke, E. K. in Journal of the operational research society (JORS), Vol. 62 N° 2 Special issue (Fevrier 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 2 Special issue (Fevrier 2011) . - pp. 360–367 Titre : Progress control in iterated local search for nurse rostering Type de document : texte imprimé Auteurs : Burke, E. K., Auteur ; Curtois, T., Auteur ; van Draat, L. F., Auteur Année de publication : 2011 Article en page(s) : pp. 360–367 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Local  search  Iterated  local  search  Nurse  rostering Index. décimale : 001.424 Résumé : This paper describes an approach in which a local search technique is alternated with a process which ‘jumps’ to another point in the search space. After each ‘jump’ a (time-intensive) local search is used to obtain a new local optimum. The focus of the paper is in monitoring the progress of this technique on a set of real world nurse rostering problems. We propose a model for estimating the quality of this new local optimum. We can then decide whether to end the local search based on the predicted quality. The fact that we avoid searching these bad neighbourhoods enables us to reach better solutions in the same amount of time. We evaluate the approach on five highly constrained problems in nurse rostering. These problems represent complex and challenging real world rostering situations and the approach described here has been developed during a commercial implementation project by ORTEC bv. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n2/abs/jors201086a.html [article] Progress control in iterated local search for nurse rostering [texte imprimé] / Burke, E. K., Auteur ; Curtois, T., Auteur ; van Draat, L. F., Auteur . - 2011 . - pp. 360–367. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 2 Special issue (Fevrier 2011) . - pp. 360–367 Mots-clés : Local  search  Iterated  local  search  Nurse  rostering Index. décimale : 001.424 Résumé : This paper describes an approach in which a local search technique is alternated with a process which ‘jumps’ to another point in the search space. After each ‘jump’ a (time-intensive) local search is used to obtain a new local optimum. The focus of the paper is in monitoring the progress of this technique on a set of real world nurse rostering problems. We propose a model for estimating the quality of this new local optimum. We can then decide whether to end the local search based on the predicted quality. The fact that we avoid searching these bad neighbourhoods enables us to reach better solutions in the same amount of time. We evaluate the approach on five highly constrained problems in nurse rostering. These problems represent complex and challenging real world rostering situations and the approach described here has been developed during a commercial implementation project by ORTEC bv. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n2/abs/jors201086a.html

Flexible aircraft fleeting and routing at TunisAir / Zeghal, F. M. in Journal of the operational research society (JORS), Vol. 62 N° 2 Special issue (Fevrier 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 2 Special issue (Fevrier 2011) . - pp. 368–380 Titre : Flexible aircraft fleeting and routing at TunisAir Type de document : texte imprimé Auteurs : Zeghal, F. M., Auteur ; Haouari, M., Auteur ; Sherali, H. D., Auteur Année de publication : 2011 Article en page(s) : pp. 368–380 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : OR  in  airlines  Airline  fleet  assignment  Aircraft  routing  Flexible  fleet  Flexible  flight  schedule  Column  generation Index. décimale : 001.424 Résumé : This paper addresses a Flexible Aircraft Fleeting and Routing Problem, which is motivated by the Tunisian national carrier TunisAir. A solution to this problem specifies the departure time of each flight, the subset of aircraft to be chartered or rented out, the individual aircraft assigned to each flight, as well as the sequence of flights to be flown by each aircraft. The objective is to maximize the expected total net profit, while satisfying activity constraints and long-term maintenance requirements. Tailored optimization-based heuristics are developed for solving this complex integrated problem. Computational experiments conducted on real data demonstrate that the proposed procedures are effective and robust, and significantly improve upon TunisAir's solutions. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n2/abs/jors2010100a.html [article] Flexible aircraft fleeting and routing at TunisAir [texte imprimé] / Zeghal, F. M., Auteur ; Haouari, M., Auteur ; Sherali, H. D., Auteur . - 2011 . - pp. 368–380. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 2 Special issue (Fevrier 2011) . - pp. 368–380 Mots-clés : OR  in  airlines  Airline  fleet  assignment  Aircraft  routing  Flexible  fleet  Flexible  flight  schedule  Column  generation Index. décimale : 001.424 Résumé : This paper addresses a Flexible Aircraft Fleeting and Routing Problem, which is motivated by the Tunisian national carrier TunisAir. A solution to this problem specifies the departure time of each flight, the subset of aircraft to be chartered or rented out, the individual aircraft assigned to each flight, as well as the sequence of flights to be flown by each aircraft. The objective is to maximize the expected total net profit, while satisfying activity constraints and long-term maintenance requirements. Tailored optimization-based heuristics are developed for solving this complex integrated problem. Computational experiments conducted on real data demonstrate that the proposed procedures are effective and robust, and significantly improve upon TunisAir's solutions. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n2/abs/jors2010100a.html

On the automatic discovery of variants of the NEH procedure for flow shop scheduling using genetic programming / Vázquez-Rodríguez, J. A. in Journal of the operational research society (JORS), Vol. 62 N° 2 Special issue (Fevrier 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 2 Special issue (Fevrier 2011) . - pp. 381–396 Titre : On the automatic discovery of variants of the NEH procedure for flow shop scheduling using genetic programming Type de document : texte imprimé Auteurs : Vázquez-Rodríguez, J. A., Auteur ; Ochoa, G., Auteur Année de publication : 2011 Article en page(s) : pp. 381–396 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Heuristics  Production  Genetic  programming  Genetic  algorithms  Hyper-heuristics Index. décimale : 001.424 Résumé : We use genetic programming to find variants of the well-known Nawaz, En-score and Ham (NEH) heuristic for the permutation flow shop problem. Each variant uses a different ranking function to prioritize operations during schedule construction. We have tested our ideas on problems where jobs have release times, due dates, and weights and have considered five objective functions: makespan, sum of tardiness, sum of weighted tardiness, sum of completion times and sum of weighted completion times. The implemented genetic programming system has been carefully tuned and used to generate one variant of NEH for each objective function. The new NEHs, obtained with genetic programming, have been compared with the original NEH and randomized NEH versions on a large set of benchmark problems. Our results indicate that the NEH variants discovered by genetic programming are superior to the original NEH and its stochastic version on most of the problems investigated. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n2/abs/jors2010132a.html [article] On the automatic discovery of variants of the NEH procedure for flow shop scheduling using genetic programming [texte imprimé] / Vázquez-Rodríguez, J. A., Auteur ; Ochoa, G., Auteur . - 2011 . - pp. 381–396. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 2 Special issue (Fevrier 2011) . - pp. 381–396 Mots-clés : Heuristics  Production  Genetic  programming  Genetic  algorithms  Hyper-heuristics Index. décimale : 001.424 Résumé : We use genetic programming to find variants of the well-known Nawaz, En-score and Ham (NEH) heuristic for the permutation flow shop problem. Each variant uses a different ranking function to prioritize operations during schedule construction. We have tested our ideas on problems where jobs have release times, due dates, and weights and have considered five objective functions: makespan, sum of tardiness, sum of weighted tardiness, sum of completion times and sum of weighted completion times. The implemented genetic programming system has been carefully tuned and used to generate one variant of NEH for each objective function. The new NEHs, obtained with genetic programming, have been compared with the original NEH and randomized NEH versions on a large set of benchmark problems. Our results indicate that the NEH variants discovered by genetic programming are superior to the original NEH and its stochastic version on most of the problems investigated. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n2/abs/jors2010132a.html

Applying GRASP to solve the multi-item three-echelon uncapacitated facility location problem / Montoya-Torres, J. R. in Journal of the operational research society (JORS), Vol. 62 N° 2 Special issue (Fevrier 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 2 Special issue (Fevrier 2011) . - pp. 397–406 Titre : Applying GRASP to solve the multi-item three-echelon uncapacitated facility location problem Type de document : texte imprimé Auteurs : Montoya-Torres, J. R., Auteur ; Aponte, A., Auteur ; Rosas, P., Auteur Année de publication : 2011 Article en page(s) : pp. 397–406 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Facility  location  GRASP  Heuristic  Experiments Index. décimale : 001.424 Résumé : This paper considers a production–distribution problem that consists of defining the flow of produced products from manufacturing plants to clients (markets) via a set of warehouses. The problem also consists of defining the location of such warehouses that have unlimited storage capacity. This problem is known in the literature as the three-echelon uncapacitated facility location problem (TUFLP), and is known to be NP-hard when the objective function is to minimize the total cost of warehouse location and production and distribution of products. This paper proposes a Greedy Randomized Adaptive Search Procedure (GRASP) to solve the multi-item version of the TUFLP. Computational experiments are conducted using known instances from the literature. Solutions obtained using GRASP are compared against both optimal solutions and lower bounds obtained using mathematical programming. Results show that proposed algorithm performs well, obtaining good solutions (and even the optimal values) in less computational time than the mixed-integer linear programming model. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n2/abs/jors2010134a.html [article] Applying GRASP to solve the multi-item three-echelon uncapacitated facility location problem [texte imprimé] / Montoya-Torres, J. R., Auteur ; Aponte, A., Auteur ; Rosas, P., Auteur . - 2011 . - pp. 397–406. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 2 Special issue (Fevrier 2011) . - pp. 397–406 Mots-clés : Facility  location  GRASP  Heuristic  Experiments Index. décimale : 001.424 Résumé : This paper considers a production–distribution problem that consists of defining the flow of produced products from manufacturing plants to clients (markets) via a set of warehouses. The problem also consists of defining the location of such warehouses that have unlimited storage capacity. This problem is known in the literature as the three-echelon uncapacitated facility location problem (TUFLP), and is known to be NP-hard when the objective function is to minimize the total cost of warehouse location and production and distribution of products. This paper proposes a Greedy Randomized Adaptive Search Procedure (GRASP) to solve the multi-item version of the TUFLP. Computational experiments are conducted using known instances from the literature. Solutions obtained using GRASP are compared against both optimal solutions and lower bounds obtained using mathematical programming. Results show that proposed algorithm performs well, obtaining good solutions (and even the optimal values) in less computational time than the mixed-integer linear programming model. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n2/abs/jors2010134a.html

Exemplaires

Bibliothèque Ecole Nationale Polytechnique d'Alger

Accueil

Se connecter

Météo

Adresse