Formulas for Estimating Average Distance Traveled in Vehicle Routing Problems in Elliptic Zones

Home | About RECERCAT | Contact

Català | Castellano

All of RECERCAT

By Communities &
Collections By Defense Date By Authors By Titles By Subject

This Collection

By Defense Date By Authors By Titles By Subject

Statistics

View Statistics All RECERCAT

My RECERCAT

Other repositories directory

RECERCAT Home > Universitat Politècnica de Catalunya > Documents de recerca > View document

To access the full text documents, please follow this link: http://hdl.handle.net/2117/2524

dc.contributor	Universitat Politècnica de Catalunya. Departament d'Infraestructura del Transport i del Territori
dc.contributor.author	Robusté Antón, Francesc
dc.contributor.author	Estrada Romeu, Miguel Ángel
dc.contributor.author	López Pita, Andrés
dc.date	2004
dc.identifier.citation	Robusté, F.; Estrada, M.; López-Pita, A. Formulas for Estimating Average Distance Traveled in Vehicle Routing Problems in Elliptic Zones. Transportation Research Record. 2004, no. 1873, pp. 64-69.
dc.identifier.uri	http://hdl.handle.net/2117/2524
dc.language.iso	eng
dc.publisher	Transportation Research Board of the National Academies
dc.relation	http://trb.metapress.com/content/5738p53822627w00/?p=2744f121deeb4868b438cd9be15f7ec0&pi=1
dc.rights	Attribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights	info:eu-repo/semantics/openAccess
dc.rights	http://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subject	Àrees temàtiques de la UPC::Enginyeria civil::Infraestructures i modelització dels transports::Trànsit
dc.subject	Traffic
dc.subject	Elliptic zones
dc.subject	Routing problems
dc.subject	Trànsit -- Intensitat
dc.title	Formulas for Estimating Average Distance Traveled in Vehicle Routing Problems in Elliptic Zones
dc.type	info:eu-repo/semantics/article
dc.description.abstract	This paper defines some compact expressions to evaluate the average distance traveled in VRP problems in circular and elliptic zones. These formulas have been carried out empirically from the results obtained by the application to a set of problems of heuristic algorithms (Clarke & Wright, Fisher & Jaikumar and Gillet & Miller) and Daganzo’s method based on continuous approximations of the demand spatial distribution. The problems are solved and designed automatically by a computer. Vehicle capacity has been the only constraint considered in the tour design. If N is the number of points and C is the vehicle capacity, it has been shown that the Clarke and Wright algorithm provides the best solutions especially when N<50 or N/C<14. On the other hand, solutions with Daganzo’s method are not adequate when N/C≤3.
dc.description.abstract	Peer Reviewed

Show simple item record

All of RECERCAT

This Collection

Statistics

My RECERCAT

Related documents

Other documents of the same author