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... |
Détail de l'auteur
Auteur F. Guerriero
Documents disponibles écrits par cet auteur
Affiner la rechercheA heuristic approach for the truck and trailer routing problem / M. Caramia in Journal of the operational research society (JORS), Vol. 61 N° 7 (Juillet 2010)
[article]
in Journal of the operational research society (JORS) > Vol. 61 N° 7 (Juillet 2010) . - pp. 1168–1180
Titre : A heuristic approach for the truck and trailer routing problem Type de document : texte imprimé Auteurs : M. Caramia, Auteur ; F. Guerriero, Auteur Année de publication : 2011 Article en page(s) : pp. 1168–1180 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Mathematical modeling Heuristic Routing Index. décimale : 001.424 Résumé : In this paper, we propose an approach based on mathematical programming and local search to cope with the truck and trailer vehicle routing problem. The mathematical programming framework models two subproblems that are solved sequentially, that is, the customer-route assignment problem (CAP), with the objective of minimizing the fleet size used to service clients, and the route definition problem, with the objective of minimizing the total tour length given the set of clients assigned to each vehicle. Since the route assignment model can return infeasible solutions, the local search plays the role of possibly retrieving a feasible solution. The mathematical formulations and the local search work iteratively, embedded in a multiple restarting mechanism able to diversify solutions by (i) identifying additional constraints for the CAP formulation to be taken into account during the algorithm progress, (ii) using a tabu like customer-route matrix to avoid assignments already analysed in the previous iterations of the algorithm. Also a lower bound to assess the solution quality is given. Experiments and comparison with competing approaches suggest that the results of the proposed machinery are promising, producing, on average, a smaller total tour lengths on benchmarks. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n7/abs/jors200959a.html [article] A heuristic approach for the truck and trailer routing problem [texte imprimé] / M. Caramia, Auteur ; F. Guerriero, Auteur . - 2011 . - pp. 1168–1180.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 61 N° 7 (Juillet 2010) . - pp. 1168–1180
Mots-clés : Mathematical modeling Heuristic Routing Index. décimale : 001.424 Résumé : In this paper, we propose an approach based on mathematical programming and local search to cope with the truck and trailer vehicle routing problem. The mathematical programming framework models two subproblems that are solved sequentially, that is, the customer-route assignment problem (CAP), with the objective of minimizing the fleet size used to service clients, and the route definition problem, with the objective of minimizing the total tour length given the set of clients assigned to each vehicle. Since the route assignment model can return infeasible solutions, the local search plays the role of possibly retrieving a feasible solution. The mathematical formulations and the local search work iteratively, embedded in a multiple restarting mechanism able to diversify solutions by (i) identifying additional constraints for the CAP formulation to be taken into account during the algorithm progress, (ii) using a tabu like customer-route matrix to avoid assignments already analysed in the previous iterations of the algorithm. Also a lower bound to assess the solution quality is given. Experiments and comparison with competing approaches suggest that the results of the proposed machinery are promising, producing, on average, a smaller total tour lengths on benchmarks. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n7/abs/jors200959a.html A revenue management approach to address a truck rental problem / S. Benigno in Journal of the operational research society (JORS), Vol. 63 N° 10 (Octobre 2012)
[article]
in Journal of the operational research society (JORS) > Vol. 63 N° 10 (Octobre 2012) . - pp. 1421–1433
Titre : A revenue management approach to address a truck rental problem Type de document : texte imprimé Auteurs : S. Benigno, Auteur ; F. Guerriero, Auteur ; G. Miglionico, Auteur Année de publication : 2012 Article en page(s) : pp. 1421–1433 Note générale : operational research Langues : Anglais (eng) Mots-clés : dynamic programming optimization; transportation problem; revenue management; integer linear programming; nonlinear model Index. décimale : 001.424 Résumé : This paper describes an application of revenue management techniques and policies in the field of logistics and distribution. In particular, the problem of transportation operators, who offer products for hire, is considered. A product is a truck of a given capacity, which can be rented for one or several time periods, throughout a multi-period planning horizon. The logistic operator can satisfy the demand of a given product with trucks with a capacity greater than that initially required, that is an ‘upgrade’ can take place. In this context, the logistic operator has to decide whether to accept or reject a request and which type of truck should be used to address it. For this purpose, a dynamic programming (DP) formulation of the problem under consideration is devised. The ‘course of dimensionality’ leads to the necessity of introducing different mathematical programming models to represent the problem. The mathematical models we presented are an extension of the well-known approximations for the DP of traditional network capacity management analysis. Based on these models and exploiting revenue management concepts, primal and dual acceptance policies are developed and compared in a computational study. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n10/abs/jors2011138a.html [article] A revenue management approach to address a truck rental problem [texte imprimé] / S. Benigno, Auteur ; F. Guerriero, Auteur ; G. Miglionico, Auteur . - 2012 . - pp. 1421–1433.
operational research
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 63 N° 10 (Octobre 2012) . - pp. 1421–1433
Mots-clés : dynamic programming optimization; transportation problem; revenue management; integer linear programming; nonlinear model Index. décimale : 001.424 Résumé : This paper describes an application of revenue management techniques and policies in the field of logistics and distribution. In particular, the problem of transportation operators, who offer products for hire, is considered. A product is a truck of a given capacity, which can be rented for one or several time periods, throughout a multi-period planning horizon. The logistic operator can satisfy the demand of a given product with trucks with a capacity greater than that initially required, that is an ‘upgrade’ can take place. In this context, the logistic operator has to decide whether to accept or reject a request and which type of truck should be used to address it. For this purpose, a dynamic programming (DP) formulation of the problem under consideration is devised. The ‘course of dimensionality’ leads to the necessity of introducing different mathematical programming models to represent the problem. The mathematical models we presented are an extension of the well-known approximations for the DP of traditional network capacity management analysis. Based on these models and exploiting revenue management concepts, primal and dual acceptance policies are developed and compared in a computational study. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n10/abs/jors2011138a.html