Vehicle coordinated strategy for vehicle routing problem with fuzzy demands (Q1793740)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Vehicle coordinated strategy for vehicle routing problem with fuzzy demands |
scientific article; zbMATH DE number 6953733
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Vehicle coordinated strategy for vehicle routing problem with fuzzy demands |
scientific article; zbMATH DE number 6953733 |
Statements
Vehicle coordinated strategy for vehicle routing problem with fuzzy demands (English)
0 references
12 October 2018
0 references
Summary: The vehicle routing problem with fuzzy demands (VRPFD) is considered. A fuzzy reasoning constrained program model is formulated for VRPFD, and a hybrid ant colony algorithm is proposed to minimize total travel distance. Specifically, the two-vehicle-paired loop coordinated strategy is presented to reduce the additional distance, unloading times, and waste capacity caused by the service failure due to the uncertain demands. Finally, numerical examples are presented to demonstrate the effectiveness of the proposed approaches.
0 references
0 references
0 references
0 references
