huawei-delivery-optimization
🚚 "2021 Huawei Delivery Optimization Competition" - Using a genetic model to minimize the multi-vehicle transportation cost with vehicle capacity constraints.（“2021华为配送优化竞赛” - 使用遗传算法在车辆运力限制下最小化多车辆的运输成本。）
Science Score: 44.0%
This score indicates how likely this project is to be science-related based on various indicators:
-
✓CITATION.cff file
Found CITATION.cff file -
✓codemeta.json file
Found codemeta.json file -
✓.zenodo.json file
Found .zenodo.json file -
○DOI references
-
○Academic publication links
-
○Academic email domains
-
○Institutional organization owner
-
○JOSS paper metadata
-
○Scientific vocabulary similarity
Low similarity (8.0%) to scientific vocabulary
Keywords
Repository
🚚 "2021 Huawei Delivery Optimization Competition" - Using a genetic model to minimize the multi-vehicle transportation cost with vehicle capacity constraints.（“2021华为配送优化竞赛” - 使用遗传算法在车辆运力限制下最小化多车辆的运输成本。）
Basic Info
Statistics
- Stars: 4
- Watchers: 1
- Forks: 1
- Open Issues: 0
- Releases: 0
Topics
Metadata Files
README.md
2021 Huawei Delivery Optimization Competition
Introduction
The task of 2021 Huawei Delivery Optimization Competition is to takes care of deliveries of consumables from a depot to customers.
- The depot has a given set of home vehicles, each with a certain capacity for carrying consumables.
- Customers are represented as nodes in a graph, in which edges have an associated transportation cost equal to the distance between the nodes.
- Each customer node has an associated demand for a consumable.
The target is to minimize the total transportation cost by determining a set of routes that meet the following requirements:
- Each vehicle has one route that starts and finishes at the depot.
- Each customer is visited exactly once.
- The total demand along each route is less than the vehicle capacity.
Model Design
We used the genetic algorithm as our main process. It simulates the process of natural selection which means those species who can adapt to changes in their environment are able to survive, reproduce and go to next generation.
Individual
For a task containing N customers and M vehicles, we used a permutation of N + M - 1 consecutive numbers (0-based) to represent a transportation plan, consisting of both customers and depots. M - 1 depots can split the customers into M segments. Each segment represents a route.
Mutation
In a mutation operation, we randomly swapped the order of two nodes.
Crossover
In a crossover operation, we executed ordered crossover on two parents to produce children.
Selection
We use tournament selection, keeping transportation plans with the highest fitness from randomly chosen candidates.
The fitness is the cost of a transportation plan. For overloaded plans, a large value is added to fitness as a penalty. This value increases as overload weight increases.
License
Distributed under the MIT License. See LICENSE for more information.
Owner
- Name: Zhuagenborn
- Login: Zhuagenborn
- Kind: organization
- Location: Ireland
- Repositories: 3
- Profile: https://github.com/Zhuagenborn
Software Development | Artificial Intelligence | Reverse Engineering.
Citation (CITATION.cff)
cff-version: 1.2.0 authors: - family-names: Chen given-names: Zhenshuo orcid: https://orcid.org/0000-0003-2091-4160 - family-names: Liu given-names: Guowen orcid: https://orcid.org/0000-0002-8375-5729 title: 2021 Huawei Delivery Optimization Competition date-released: 2022-01-19 url: https://github.com/Zhuagenborn/Huawei-Delivery-Optimization
GitHub Events
Total
- Watch event: 1
- Fork event: 1
Last Year
- Watch event: 1
- Fork event: 1
Issues and Pull Requests
Last synced: 12 months ago
All Time
- Total issues: 0
- Total pull requests: 0
- Average time to close issues: N/A
- Average time to close pull requests: N/A
- Total issue authors: 0
- Total pull request authors: 0
- Average comments per issue: 0
- Average comments per pull request: 0
- Merged pull requests: 0
- Bot issues: 0
- Bot pull requests: 0
Past Year
- Issues: 0
- Pull requests: 0
- Average time to close issues: N/A
- Average time to close pull requests: N/A
- Issue authors: 0
- Pull request authors: 0
- Average comments per issue: 0
- Average comments per pull request: 0
- Merged pull requests: 0
- Bot issues: 0
- Bot pull requests: 0