Paper Abstract and Keywords |
Presentation |
2023-03-16 11:00
A Method of Solving Posting Poster Problem for Public Office Election Using Min-max Type Objective Function Fengkai Guo, Honami Tsushima (Tokyo univ. of science), Jun Adachi, Takafumi Matsuura, Takayuki Kimura (Nippon Institute of Technology), Tohru Ikeguchi (Tokyo univ. of science) MSS2022-83 NLP2022-128 |
Abstract |
(in Japanese) |
(See Japanese page) |
(in English) |
To realize effective posting process of posters in public office elections, we have already proposed the Posting Poster Problem for Public Office Election. The objective function of this problem is to find the shortest total route distance of vehicles when we use multiple vehicles to post posters. However, it has been found that if we focus on minimizing the total route distance, the route distances of the vehicles are unbalanced. Therefore, in this report, we changed our strategy by introducing the min-max type objective function: we minimized the length of the longest route of vehicles to reduce obtain balanced route length of the vehicles. In addition, we proposed a local search method for sloving this problem. Results of numerical experiments show that it is possible to construct balanced routes by changing the strategy. |
Keyword |
(in Japanese) |
(See Japanese page) |
(in English) |
Public office election / posting poster / combinatorial optimization / vehicle routing problem / / / / |
Reference Info. |
IEICE Tech. Rep., vol. 122, no. 436, NLP2022-128, pp. 104-109, March 2023. |
Paper # |
NLP2022-128 |
Date of Issue |
2023-03-08 (MSS, NLP) |
ISSN |
Online edition: ISSN 2432-6380 |
Copyright and reproduction |
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
Download PDF |
MSS2022-83 NLP2022-128 |
|