Chemical reaction inspired approach for routing problems with hard time constraints
One of the most common issues in logistics and transportation planning is the vehicle routing problem. The objective is to find minimum cost-vehicle routes for serving a set of dispersed customers with deterministic demands while satisfying some constraints. In this paper, we focus on two main const...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2024-10-01
|
| Series: | Journal of Information and Telecommunication |
| Subjects: | |
| Online Access: | https://www.tandfonline.com/doi/10.1080/24751839.2024.2359180 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1846165901413449728 |
|---|---|
| author | Imen Boudali Marwa Ragmoun |
| author_facet | Imen Boudali Marwa Ragmoun |
| author_sort | Imen Boudali |
| collection | DOAJ |
| description | One of the most common issues in logistics and transportation planning is the vehicle routing problem. The objective is to find minimum cost-vehicle routes for serving a set of dispersed customers with deterministic demands while satisfying some constraints. In this paper, we focus on two main constraints, which are vehicle capacity and time windows for customers. We propose to tackle this NP-hard problem with a bio-inspired approach based on a hybridization of Chemical Reaction Optimization and local search method. The solving process of our approach mimics the chemical reactions between molecules to attain their stability with lowest energy. For more diversification of the search space, we involved in the initialization stage a local search method based on greedy adaptive procedure. The performances of our hybrid approach are assessed on the base of various benchmark instances. Simulation results show the good performances and the efficiency of the proposed approach. |
| format | Article |
| id | doaj-art-5388d5fc4a2e48c1bf6c8b196804951a |
| institution | Kabale University |
| issn | 2475-1839 2475-1847 |
| language | English |
| publishDate | 2024-10-01 |
| publisher | Taylor & Francis Group |
| record_format | Article |
| series | Journal of Information and Telecommunication |
| spelling | doaj-art-5388d5fc4a2e48c1bf6c8b196804951a2024-11-16T17:52:57ZengTaylor & Francis GroupJournal of Information and Telecommunication2475-18392475-18472024-10-018454856910.1080/24751839.2024.2359180Chemical reaction inspired approach for routing problems with hard time constraintsImen Boudali0Marwa Ragmoun1SERCOM Laboratory, University of Carthage, Carthage, TunisiaHigh Institute of Computer Sciences, University of Tunis El Manar, Tunis, TunisiaOne of the most common issues in logistics and transportation planning is the vehicle routing problem. The objective is to find minimum cost-vehicle routes for serving a set of dispersed customers with deterministic demands while satisfying some constraints. In this paper, we focus on two main constraints, which are vehicle capacity and time windows for customers. We propose to tackle this NP-hard problem with a bio-inspired approach based on a hybridization of Chemical Reaction Optimization and local search method. The solving process of our approach mimics the chemical reactions between molecules to attain their stability with lowest energy. For more diversification of the search space, we involved in the initialization stage a local search method based on greedy adaptive procedure. The performances of our hybrid approach are assessed on the base of various benchmark instances. Simulation results show the good performances and the efficiency of the proposed approach.https://www.tandfonline.com/doi/10.1080/24751839.2024.2359180Logistics and transportationrouting problembio-inspired approachgreedy adaptive procedurechemical reaction optimization |
| spellingShingle | Imen Boudali Marwa Ragmoun Chemical reaction inspired approach for routing problems with hard time constraints Journal of Information and Telecommunication Logistics and transportation routing problem bio-inspired approach greedy adaptive procedure chemical reaction optimization |
| title | Chemical reaction inspired approach for routing problems with hard time constraints |
| title_full | Chemical reaction inspired approach for routing problems with hard time constraints |
| title_fullStr | Chemical reaction inspired approach for routing problems with hard time constraints |
| title_full_unstemmed | Chemical reaction inspired approach for routing problems with hard time constraints |
| title_short | Chemical reaction inspired approach for routing problems with hard time constraints |
| title_sort | chemical reaction inspired approach for routing problems with hard time constraints |
| topic | Logistics and transportation routing problem bio-inspired approach greedy adaptive procedure chemical reaction optimization |
| url | https://www.tandfonline.com/doi/10.1080/24751839.2024.2359180 |
| work_keys_str_mv | AT imenboudali chemicalreactioninspiredapproachforroutingproblemswithhardtimeconstraints AT marwaragmoun chemicalreactioninspiredapproachforroutingproblemswithhardtimeconstraints |