Documents disponibles écrits par cet auteur

An incremental tabu search heuristic for the generalized vehicle routing problem with time windows / L. Moccia in Journal of the operational research society (JORS), Vol. 63 N° 2 (Fevrier 2012) 

Public ISBD [article]  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

Automatic aircraft cargo load planning / S. Limbourg in Journal of the operational research society (JORS), Vol. 63 N° 9 (Septembre 2012) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 63 N° 9 (Septembre 2012) . - pp. 1271–1283 Titre : Automatic aircraft cargo load planning Type de document : texte imprimé Auteurs : S. Limbourg, Auteur ; M. Schyns, Auteur ; G. Laporte, Auteur Année de publication : 2012 Article en page(s) : pp. 1271–1283 Note générale : Operational research Langues : Anglais (eng) Mots-clés : Mixed  integer  programming  Cargo  aircraft  Unit  load  devices  Weight  and  balance  Moment  of  inertia  Fuel  economy Index. décimale : 001.424 Résumé : The goal of this paper is the development of a new mixed integer linear program designed for optimally loading a set of containers and pallets into a compartmentalised cargo aircraft. It is based on real-world problems submitted by a professional partner. This model takes into account strict technical and safety constraints. In addition to the standard goal of optimally positioning the centre of gravity, we also propose a new approach based on the moment of inertia. This double goal implies an increase in aircraft efficiency and a decrease in fuel consumption. Cargo loading generally remains a manual, or at best a computer-assisted, and time-consuming task. A fully automatic software was developed to quickly compute optimal solutions. Experimental results show that our approach achieves better solutions than manual planning, within only a few seconds. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n9/abs/jors2011134a.html [article] Automatic aircraft cargo load planning [texte imprimé] / S. Limbourg, Auteur ; M. Schyns, Auteur ; G. Laporte, Auteur . - 2012 . - pp. 1271–1283. Operational research Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 63 N° 9 (Septembre 2012) . - pp. 1271–1283 Mots-clés : Mixed  integer  programming  Cargo  aircraft  Unit  load  devices  Weight  and  balance  Moment  of  inertia  Fuel  economy Index. décimale : 001.424 Résumé : The goal of this paper is the development of a new mixed integer linear program designed for optimally loading a set of containers and pallets into a compartmentalised cargo aircraft. It is based on real-world problems submitted by a professional partner. This model takes into account strict technical and safety constraints. In addition to the standard goal of optimally positioning the centre of gravity, we also propose a new approach based on the moment of inertia. This double goal implies an increase in aircraft efficiency and a decrease in fuel consumption. Cargo loading generally remains a manual, or at best a computer-assisted, and time-consuming task. A fully automatic software was developed to quickly compute optimal solutions. Experimental results show that our approach achieves better solutions than manual planning, within only a few seconds. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n9/abs/jors2011134a.html

A concise guide to the Traveling Salesman Problem / G. Laporte in Journal of the operational research society (JORS), Vol. 61 N° 1 (Issue spécial) (Janvier 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 1 (Issue spécial) (Janvier 2010) . - pp. 35–40 Titre : A concise guide to the Traveling Salesman Problem Type de document : texte imprimé Auteurs : G. Laporte, Auteur Année de publication : 2011 Article en page(s) : pp. 35–40 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Traveling  salesman  problem  Exact  algorithms  Heuristics  Software Index. décimale : 001.424 Résumé : The Traveling Salesman Problem (TSP) is one of the most famous problems in combinatorial optimization. Hundreds of papers have been written on the TSP and several exact and heuristic algorithms are available for it. Their concise guide outlines the most important and best algorithms for the symmetric and asymmetric versions of the TSP. In several cases, references to publicly available software are provided. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n1/abs/jors200976a.html [article] A concise guide to the Traveling Salesman Problem [texte imprimé] / G. Laporte, Auteur . - 2011 . - pp. 35–40. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 1 (Issue spécial) (Janvier 2010) . - pp. 35–40 Mots-clés : Traveling  salesman  problem  Exact  algorithms  Heuristics  Software Index. décimale : 001.424 Résumé : The Traveling Salesman Problem (TSP) is one of the most famous problems in combinatorial optimization. Hundreds of papers have been written on the TSP and several exact and heuristic algorithms are available for it. Their concise guide outlines the most important and best algorithms for the symmetric and asymmetric versions of the TSP. In several cases, references to publicly available software are provided. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n1/abs/jors200976a.html

Reducing fuel emissions by optimizing speed on shipping routes / K. Fagerholt in Journal of the operational research society (JORS), Vol. 61 N° 3 (Mars 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 3 (Mars 2010) . - pp. 523–529 Titre : Reducing fuel emissions by optimizing speed on shipping routes Type de document : texte imprimé Auteurs : K. Fagerholt, Auteur ; G. Laporte, Auteur ; I. Norstad, Auteur Année de publication : 2011 Article en page(s) : pp. 523–529 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Shipping  routes  Fuel  emissions  Speed  optimization  Shortest  paths Index. décimale : 001.424 Résumé : Fuel consumption and emissions on a shipping route are typically a cubic function of speed. Given a shipping route consisting of a sequence of ports with a time window for the start of service, substantial savings can be achieved by optimizing the speed of each leg. This problem is cast as a non-linear continuous program, which can be solved by a non-linear programming solver. We propose an alternative solution methodology, in which the arrival times are discretized and the problem is solved as a shortest path problem on a directed acyclic graph. Extensive computational results confirm the superiority of the shortest path approach and the potential for fuel savings on shipping routes. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n3/abs/jors200977a.html [article] Reducing fuel emissions by optimizing speed on shipping routes [texte imprimé] / K. Fagerholt, Auteur ; G. Laporte, Auteur ; I. Norstad, Auteur . - 2011 . - pp. 523–529. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 3 (Mars 2010) . - pp. 523–529 Mots-clés : Shipping  routes  Fuel  emissions  Speed  optimization  Shortest  paths Index. décimale : 001.424 Résumé : Fuel consumption and emissions on a shipping route are typically a cubic function of speed. Given a shipping route consisting of a sequence of ports with a time window for the start of service, substantial savings can be achieved by optimizing the speed of each leg. This problem is cast as a non-linear continuous program, which can be solved by a non-linear programming solver. We propose an alternative solution methodology, in which the arrival times are discretized and the problem is solved as a shortest path problem on a directed acyclic graph. Extensive computational results confirm the superiority of the shortest path approach and the potential for fuel savings on shipping routes. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n3/abs/jors200977a.html

Scheduling ambulance crews for maximum coverage / Erdogan, G. in Journal of the operational research society (JORS), Vol. 61 N° 4 (Avril 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 4 (Avril 2010) . - pp. 543–550 Titre : Scheduling ambulance crews for maximum coverage Type de document : texte imprimé Auteurs : Erdogan, G., Auteur ; A. Ingolfsson, Auteur ; G. Laporte, Auteur Année de publication : 2010 Article en page(s) : pp. 543–550 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Ambulance  location  Shift  scheduling  Tabu  search  Integer  programming Index. décimale : 001.424 Résumé : This paper addresses the problem of scheduling ambulance crews in order to maximize the coverage throughout a planning horizon. The problem includes the subproblem of locating ambulances to maximize expected coverage with probabilistic response times, for which a tabu search algorithm is developed. The proposed tabu search algorithm is empirically shown to outperform previous approaches for this subproblem. Two integer programming models that use the output of the tabu search algorithm are constructed for the main problem. Computational experiments with real data are conducted. A comparison of the results of the models is presented. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n4/abs/jors2008163a.html [article] Scheduling ambulance crews for maximum coverage [texte imprimé] / Erdogan, G., Auteur ; A. Ingolfsson, Auteur ; G. Laporte, Auteur . - 2010 . - pp. 543–550. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 4 (Avril 2010) . - pp. 543–550 Mots-clés : Ambulance  location  Shift  scheduling  Tabu  search  Integer  programming Index. décimale : 001.424 Résumé : This paper addresses the problem of scheduling ambulance crews in order to maximize the coverage throughout a planning horizon. The problem includes the subproblem of locating ambulances to maximize expected coverage with probabilistic response times, for which a tabu search algorithm is developed. The proposed tabu search algorithm is empirically shown to outperform previous approaches for this subproblem. Two integer programming models that use the output of the tabu search algorithm are constructed for the main problem. Computational experiments with real data are conducted. A comparison of the results of the models is presented. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n4/abs/jors2008163a.html

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

Permalink

A tabu search heuristic for ship routing and scheduling / J. E. Korsvik in Journal of the operational research society (JORS), Vol. 61 N° 4 (Avril 2010) 

Permalink