Show simple item record

dc.contributor.authorPalma-Blanco, Andres
dc.contributor.authorCassandro-De La Hoz, Daniela
dc.contributor.authorPaternina-Arboleda, Carlos
dc.date.accessioned2018-12-17T03:07:59Z
dc.date.accessioned2022-04-04T16:25:11Z
dc.date.available2018-12-17T03:07:59Z
dc.date.available2022-04-04T16:25:11Z
dc.date.issued2018-09
dc.identifier.isbn978-0-9993443-1-6
dc.identifier.issn2414-6390
dc.identifier.otherhttp://laccei.org/LACCEI2018-Lima/meta/FP293.html
dc.identifier.urihttp://dx.doi.org/10.18687/LACCEI2018.1.1.293
dc.identifier.urihttp://axces.info/handle/10.18687/2018102_293
dc.description.abstractThis paper considers a variant of the Vehicle Routing Problem (VRP) subject to time windows for every customer, multiple products and incompatibility between them. Since the problem is NP-hard, the approach to achieve feasible solutions is an Ant Colony System with Two-Pheromone with the objective of minimizing routing cost and vehicle fleet size. Experiments are carried out using instances from literature showing competitive solutions in relatively short computational times.en_US
dc.language.isoEnglishen_US
dc.publisherLACCEI Inc.en_US
dc.rightsLACCEI License
dc.rights.urihttps://laccei.org/blog/copyright-laccei-papers/
dc.subjectVehicle Routingen_US
dc.subjectTime Windowsen_US
dc.subjectMultiple Productsen_US
dc.subjectProduct Incompatibilityen_US
dc.subjectAnt Colony Metaheuristicen_US
dc.titleA Two-Pheromone Trail Ant Colony System Approach for the Vehicle Routing Problem with Time Windows, Multiple Products and Product Incompatibility
dc.typeArticleen_US
dc.description.countryColombiaen
dc.description.institutionUniversidad del Norteen
dc.description.trackEngineering Infrastructure, Construction Engineering, Logistics and Transportationen
dc.journal.referatopeerReview


Files in this item

Thumbnail

This item appears in the following Collection(s)

  • 2018 LACCEI - Lima, Perú
    The Sixteen LACCEI International Multi-Conference for Engineering, Education Caribbean Conference for Engineering and Technology.

Show simple item record