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 M. Caramia
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