Algorithm for Vehicle Routing Problem with Time Windows Based on Agent Negotiation

@inproceedings{Kalina2012AlgorithmFV,
  title={Algorithm for Vehicle Routing Problem with Time Windows Based on Agent Negotiation},
  author={Petr Kalina},
  year={2012}
}
We suggest an efficient algorithm for the vehicle routing problem with time windows (VRPTW) based on agent negotiation. The algorithm is based on a set of generic negotiation methods and state-of-the-art insertion heuristics. Experimental results on well known Solomon’s and HombergerGehring benchmarks demonstrate that the algorithm outperforms previous agent based algorithms. The relevance of the algorithm with respect to the state-of-the-art centralized solvers is discussed within a… CONTINUE READING
3 Extracted Citations
17 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-3 of 3 extracted citations

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 17 references

Pěchouček. Abstract architecture for task-oriented multi-agent problem solving. Systems, Man, and Cybernetics, Part C: Applications and Reviews

  • J. Vokř́ınek, A. Komenda
  • IEEE Transactions on,
  • 2011
2 Excerpts

Agents towards vehicle routing problems

  • A. Komenda J. Vokř́ınek
  • 2010

Pěchouček. Agents towards vehicle routing problems. In Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1

  • J. Vokř́ınek, A. Komenda
  • Volume 1,
  • 2010
2 Excerpts

Similar Papers

Loading similar papers…