2012 IEEE International Conference on Systems, Man, and Cybernetics (SMC) 2012
DOI: 10.1109/icsmc.2012.6377958
|View full text |Cite
|
Sign up to set email alerts
|

Parallel solver for vehicle routing and pickup and delivery problems with time windows based on agent negotiation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
9
0

Year Published

2013
2013
2017
2017

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 19 publications
(10 citation statements)
references
References 12 publications
0
9
0
Order By: Relevance
“…These advantages are high flexibility, adaptability, scalability, and robustness in decentralized systems, which are achieved by problem decomposition and the proactive, reactive, and adap-tive behavior of intelligent agents. Multiagent systems are mature sophisticated technology to implement autonomous industrial processes [25], [26] and they are also used in route planing [27].…”
Section: Related Workmentioning
confidence: 99%
“…These advantages are high flexibility, adaptability, scalability, and robustness in decentralized systems, which are achieved by problem decomposition and the proactive, reactive, and adap-tive behavior of intelligent agents. Multiagent systems are mature sophisticated technology to implement autonomous industrial processes [25], [26] and they are also used in route planing [27].…”
Section: Related Workmentioning
confidence: 99%
“…On the other hand, improvement heuristics modify an initial solution (very often of a low quality) by applying local search moves (thus, by exploring the neighborhood of this solution) [15], [16]. A number of metaheuristics have been adopted for solving rich VRPs throughout the years, including various tabu searches [4], variable neighborhood searches [17], greedy randomized adaptive search procedures, populationbased [18], [19], [20], and agent-based approaches [21], guided ejection searches [22], simulated annealing [16], and more [23].…”
Section: A Solving the Pickup And Delivery With Time Windowsmentioning
confidence: 99%
“…Parallel heuristic algorithms have been explored for solving a bunch of different optimization problems [24], including various VRPs [21], [25]. Co-operative strategies in such parallel heuristic techniques have been discussed and classified in several taxonomies, with the one presented by Crainic et al being the best established [26], which encompasses three dimensions.…”
Section: B Parallel Heuristic Algorithmsmentioning
confidence: 99%
“…They are either evaluated on static benchmarks (cf. [4,13]) or by case studies, which are generally performed in cooperation with an industrial partner (cf. [11,12]).…”
Section: Multiagent Systems In Transport Processesmentioning
confidence: 99%
“…The goal of this investigation is to compare the dispAgent system solutions to the best-known solutions. Similarly to [13], we measure the result quality by the following equation:…”
Section: A Benchmark Evaluationmentioning
confidence: 99%