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 R. Mansini
Documents disponibles écrits par cet auteur
Affiner la rechercheComparison of policies in dynamic routing problems / E. Angelelli in Journal of the operational research society (JORS), Vol. 61 N° 4 (Avril 2010)
[article]
in Journal of the operational research society (JORS) > Vol. 61 N° 4 (Avril 2010) . - pp. 686–695
Titre : Comparison of policies in dynamic routing problems Type de document : texte imprimé Auteurs : E. Angelelli, Auteur ; N. Bianchessi, Auteur ; R. Mansini, Auteur Année de publication : 2010 Article en page(s) : pp. 686–695 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Dynamic multi-period routing problems Postponable requests Management policies Index. décimale : 001.424 Résumé : We consider a company that has to satisfy customers' pick-up requests arriving over time every day. The overall objective of the company is to serve as many requests as possible at a minimum operational cost. When organizing its business the company has to fix some features of the service that may affect both service quality and operational costs. Some of these features concern the time a request is taken into account to plan its service, the associated deadline and the way requests are managed when the system is overloaded. In this paper we analyse several policies that can be implemented by the management of a carrier company in a multi-period context. For example, a company might reject all the requests that cannot be feasibly scheduled or accept all the requests and rely on a backup service in order to serve requests that are difficult to handle. Another interesting issue considered in this paper is the impact of collaborative service where two or more carrier companies, with their own customers, decide to share customers in order to optimize the overall costs. We set up a general framework to allow comparison of alternative service policies. Extensive computational results evaluating the number of lost requests and the distance travelled provide interesting insights. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n4/abs/jors200917a.html [article] Comparison of policies in dynamic routing problems [texte imprimé] / E. Angelelli, Auteur ; N. Bianchessi, Auteur ; R. Mansini, Auteur . - 2010 . - pp. 686–695.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 61 N° 4 (Avril 2010) . - pp. 686–695
Mots-clés : Dynamic multi-period routing problems Postponable requests Management policies Index. décimale : 001.424 Résumé : We consider a company that has to satisfy customers' pick-up requests arriving over time every day. The overall objective of the company is to serve as many requests as possible at a minimum operational cost. When organizing its business the company has to fix some features of the service that may affect both service quality and operational costs. Some of these features concern the time a request is taken into account to plan its service, the associated deadline and the way requests are managed when the system is overloaded. In this paper we analyse several policies that can be implemented by the management of a carrier company in a multi-period context. For example, a company might reject all the requests that cannot be feasibly scheduled or accept all the requests and rely on a backup service in order to serve requests that are difficult to handle. Another interesting issue considered in this paper is the impact of collaborative service where two or more carrier companies, with their own customers, decide to share customers in order to optimize the overall costs. We set up a general framework to allow comparison of alternative service policies. Extensive computational results evaluating the number of lost requests and the distance travelled provide interesting insights. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n4/abs/jors200917a.html