Modeling and Solving the Multi-Objective Vehicle Routing Problem with Soft and Fuzzy Time Windows
In the distribution field, distribution costs and customer service satisfaction are extremely important issues for enterprises. However, both the Vehicle Routing Problem with Soft Time Windows (VRPSTW) and the Vehicle Routing Problem with Fuzzy Time Windows (VRPFTW) have certain deficiencies in desc...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2024-12-01
|
| Series: | Systems |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2079-8954/12/12/560 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1846102540663390208 |
|---|---|
| author | Ailing Chen Tianao Li |
| author_facet | Ailing Chen Tianao Li |
| author_sort | Ailing Chen |
| collection | DOAJ |
| description | In the distribution field, distribution costs and customer service satisfaction are extremely important issues for enterprises. However, both the Vehicle Routing Problem with Soft Time Windows (VRPSTW) and the Vehicle Routing Problem with Fuzzy Time Windows (VRPFTW) have certain deficiencies in describing real-world scenarios. Therefore, this paper considers both soft time windows and fuzzy time windows, improving upon the traditional VRPSTW and VRPFTW models to establish a more comprehensive and realistic model called the Vehicle Routing Problem with Soft Time Windows and Fuzzy Time Windows (VRPSFTW). Secondly, to solve the relevant problems, this paper proposes a Directed Mutation Genetic Algorithm integrated with Large Neighborhood Search (LDGA), which fully utilizes the advantages of the Genetic Algorithm (GA) in the early stages and appropriately adopts removal and re-insertion operators from the Large Neighborhood Search (LNS). This approach not only makes efficient use of computational resources but also compensates for the weaknesses of crossover and mutation operators in the later stages of the genetic algorithm. Thereby, it improves the overall efficiency and accuracy of the algorithm and achieves better solution results. In addition, in order to solve multi-objective problems, this paper employs a two-stage solution approach and designs two sets of algorithms based on the principles of “cost priority” and “service-level priority”. Simulation experiments demonstrated that the algorithms designed in this study achieved a more competitive solving performance. |
| format | Article |
| id | doaj-art-08a74b5aa92048e3aeaa9628c1d84870 |
| institution | Kabale University |
| issn | 2079-8954 |
| language | English |
| publishDate | 2024-12-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Systems |
| spelling | doaj-art-08a74b5aa92048e3aeaa9628c1d848702024-12-27T14:55:47ZengMDPI AGSystems2079-89542024-12-01121256010.3390/systems12120560Modeling and Solving the Multi-Objective Vehicle Routing Problem with Soft and Fuzzy Time WindowsAiling Chen0Tianao Li1School of Management Science and Engineering, Shandong University of Finance and Economics, Jinan 250014, ChinaSchool of Management Science and Engineering, Shandong University of Finance and Economics, Jinan 250014, ChinaIn the distribution field, distribution costs and customer service satisfaction are extremely important issues for enterprises. However, both the Vehicle Routing Problem with Soft Time Windows (VRPSTW) and the Vehicle Routing Problem with Fuzzy Time Windows (VRPFTW) have certain deficiencies in describing real-world scenarios. Therefore, this paper considers both soft time windows and fuzzy time windows, improving upon the traditional VRPSTW and VRPFTW models to establish a more comprehensive and realistic model called the Vehicle Routing Problem with Soft Time Windows and Fuzzy Time Windows (VRPSFTW). Secondly, to solve the relevant problems, this paper proposes a Directed Mutation Genetic Algorithm integrated with Large Neighborhood Search (LDGA), which fully utilizes the advantages of the Genetic Algorithm (GA) in the early stages and appropriately adopts removal and re-insertion operators from the Large Neighborhood Search (LNS). This approach not only makes efficient use of computational resources but also compensates for the weaknesses of crossover and mutation operators in the later stages of the genetic algorithm. Thereby, it improves the overall efficiency and accuracy of the algorithm and achieves better solution results. In addition, in order to solve multi-objective problems, this paper employs a two-stage solution approach and designs two sets of algorithms based on the principles of “cost priority” and “service-level priority”. Simulation experiments demonstrated that the algorithms designed in this study achieved a more competitive solving performance.https://www.mdpi.com/2079-8954/12/12/560soft time windowsfuzzy time windowsmulti-objective optimizationvehicle routing problem with soft time windows and fuzzy time windowsdirected mutation genetic algorithm integrated with large neighborhood searchtwo-stage algorithm |
| spellingShingle | Ailing Chen Tianao Li Modeling and Solving the Multi-Objective Vehicle Routing Problem with Soft and Fuzzy Time Windows Systems soft time windows fuzzy time windows multi-objective optimization vehicle routing problem with soft time windows and fuzzy time windows directed mutation genetic algorithm integrated with large neighborhood search two-stage algorithm |
| title | Modeling and Solving the Multi-Objective Vehicle Routing Problem with Soft and Fuzzy Time Windows |
| title_full | Modeling and Solving the Multi-Objective Vehicle Routing Problem with Soft and Fuzzy Time Windows |
| title_fullStr | Modeling and Solving the Multi-Objective Vehicle Routing Problem with Soft and Fuzzy Time Windows |
| title_full_unstemmed | Modeling and Solving the Multi-Objective Vehicle Routing Problem with Soft and Fuzzy Time Windows |
| title_short | Modeling and Solving the Multi-Objective Vehicle Routing Problem with Soft and Fuzzy Time Windows |
| title_sort | modeling and solving the multi objective vehicle routing problem with soft and fuzzy time windows |
| topic | soft time windows fuzzy time windows multi-objective optimization vehicle routing problem with soft time windows and fuzzy time windows directed mutation genetic algorithm integrated with large neighborhood search two-stage algorithm |
| url | https://www.mdpi.com/2079-8954/12/12/560 |
| work_keys_str_mv | AT ailingchen modelingandsolvingthemultiobjectivevehicleroutingproblemwithsoftandfuzzytimewindows AT tianaoli modelingandsolvingthemultiobjectivevehicleroutingproblemwithsoftandfuzzytimewindows |