2016
DOI: 10.1155/2016/9071394
|View full text |Cite
|
Sign up to set email alerts
|

Vehicle Coordinated Strategy for Vehicle Routing Problem with Fuzzy Demands

Abstract: 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 twovehicle-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 propose… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 29 publications
0
1
0
Order By: Relevance
“…Bean and Joubert [16] analyzed the coordination between several actors, in this case considering the mutual interaction and responses of the carrier and customers, also finding improvements in the distribution performance. Liu et al [17] formulated a coordination strategy using two vehicles that can complement their planed routes, producing a decrease in the travel distance and optimizing the problem using a hybrid ant colony heuristic. Gutierrez et al [18] use a memetic algorithm to tackle the uncertainties in the routing problem improving the service and travel times.…”
Section: Introductionmentioning
confidence: 99%
“…Bean and Joubert [16] analyzed the coordination between several actors, in this case considering the mutual interaction and responses of the carrier and customers, also finding improvements in the distribution performance. Liu et al [17] formulated a coordination strategy using two vehicles that can complement their planed routes, producing a decrease in the travel distance and optimizing the problem using a hybrid ant colony heuristic. Gutierrez et al [18] use a memetic algorithm to tackle the uncertainties in the routing problem improving the service and travel times.…”
Section: Introductionmentioning
confidence: 99%