Year-end Sale % OFF 
Abstract
The ant system (AS) is a metaheuristic approach originally developed for solving the traveling salesman problem. AS has been successfully applied to various hard combinatorial optimization problems and different variants have been proposed in the literature. In this paper, we introduce a time-based pheromone approach for AS (TbAS). Due to this nature TbAS is applicable to routing problems involving time-windows. The novelty in TbAS is the multi-layer pheromone network structure which implicitly utilizes the service time information associated with the customers as a heuristic information. To investigate the performance of TbAS, we use the well-known vehicle routing problem with time-windows as our testbed and we conduct an extensive computational study using the Solomon (Algorithms for the vehicle routing and scheduling problems with time window constraints 35:254–265, 1987) instances. Our results reveal that the proposed time-based pheromone approach is effective in obtaining good quality solutions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
