Proceedings of the Genetic and Evolutionary Computation Conference
巻, 号, ページ
pp. 1372 - 1379
出版年月
2007年7月
出版者
和文:
英文:
会議名称
和文:
英文:
Genetic and Evolutionary Computation Conference
開催地
和文:
英文:
London, UK
アブストラクト
We propose a protocol for a local search and a genetic algorithmfor the distributed traveling salesman problem (TSP).In the distributed TSP, information regarding the cost functionsuch as traveling costs between cities and cities to bevisited are separately possessed by distributed parties andboth are kept private each other. We propose a protocol thatsecurely solves the distributed TSP by means of a combinationof genetic algorithms and a cryptographic technique,called the secure multiparty computation. The computationtime required for the privacy preserving optimization ispractical at some level even when the city-size is more thana thousand.