| Autor |
dc.contributor.author |
Cabrera G G. |
|
| Autor |
dc.contributor.author |
Peralta F. |
|
| Fecha Ingreso |
dc.date.accessioned |
2014-04-05T00:16:52Z |
|
| Fecha Disponible |
dc.date.available |
2014-04-05T00:16:52Z |
|
| Fecha en Repositorio |
dc.date.issued |
2014-04-04 |
|
|
dc.identifier |
10.1109/ICCIT.2009.264 |
|
|
dc.description.abstract |
Due to the increased demands for distribution/redistribution, recycling and repacking, there has been a significant change in the logistics process. This article presented an Ant Colony System (ACS) algorithm to solve a Vehicle Routing Problem with Simultaneous Delivery and Pickup (VRPSDP). The objective of this problem is to determine the optimal set of routes to totally satisfy both the delivery and pickup demand of the customer population. To solve the VRPSDP model, ACS approach is based in the pheromone strategy, inspired in the natural Ants behavior. This behavior is assigned to vehicles, which move along the route on which the pheromone intensity is strong. The ACS algorithm provides good solutions and shows that it is a competitive method related with other heuristics or meta-heuristics that have been proposed in literature. © 2009 IEEE. |
en_US |
|
dc.source |
ICCIT 2009 - 4th International Conference on Computer Sciences and Convergence Information Technology |
|
| Link Descarga |
dc.source.uri |
http://www.scopus.com/inward/record.url?eid=2-s2.0-77749252620&partnerID=40&md5=89f5b9731a25e88e2935607a0b9dc909 |
|
| Title |
dc.title |
Ant colony system algorithm for the vehicle routing problem with simultaneous delivery and pick-up |
en_US |
| Tipo |
dc.type |
Conference Paper |
|
|
dc.description.keywords |
Ant colony system algorithms; Ant colony systems; Logistics process; Meta heuristics; Optimal sets; Pheromone strategy; Vehicle Routing Problems; Computer science; Information technology; Logistics; Pickups; Routing algorithms; Vehicles |
en_US |