2013
DOI: 10.1007/978-3-642-44927-7_11
|View full text |Cite
|
Sign up to set email alerts
|

An Efficient Route Minimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Agent Negotiation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
1
1
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 26 publications
0
1
0
Order By: Relevance
“…The literature of this so-called Vehicle Routing Problem is rich [1,2,3,4,5,6,7,8]. Most of the literature deals with complex scenarios in which vehicles have different capabilities and carry varying loads, as they are required to visit several locations.…”
Section: The Routing Problemmentioning
confidence: 99%
“…The literature of this so-called Vehicle Routing Problem is rich [1,2,3,4,5,6,7,8]. Most of the literature deals with complex scenarios in which vehicles have different capabilities and carry varying loads, as they are required to visit several locations.…”
Section: The Routing Problemmentioning
confidence: 99%