DocumentCode
3185748
Title
Inner Random Restart Genetic Algorithm to optimize delivery schedule
Author
Sakurai, Yoshitaka ; Takada, Kouhei ; Tsukamoto, Natsuki ; Onoyama, Takashi ; Knauf, Rainer ; Tsuruta, Setsuo
Author_Institution
Sch. of Inf. Environ., Tokyo Denki Univ., Chiba, Japan
fYear
2010
fDate
10-13 Oct. 2010
Firstpage
263
Lastpage
270
Abstract
A delivery route optimization system greatly improves the real time delivery efficiency. To realize such an optimization, its distribution network requires solving several tens to hundreds (maximum 2 thousands or so) cities Traveling Salesman Problems (TSP) within interactive response time (around 3 seconds) with expert-level accuracy (below 3% level of error rate). To meet these requirements, an Inner Random Restart Genetic Algorithm (Irr-GA) method is proposed. This method combines random restart and GA that has different types of simple heuristics such as 2-opt and NI (Nearest Insertion). Including these heuristics, field experts and field engineers can easily understand the way and use it. Using the tool applying their method, they can easily create/modify the solutions or conditions interactively depending on their field needs. Experimental results proved that the method meets the above-mentioned delivery scheduling requirements more than other methods from the viewpoint of optimality as well as simplicity.
Keywords
genetic algorithms; scheduling; travelling salesman problems; delivery route optimization system; delivery schedule; inner random restart genetic algorithm; nearest insertion; traveling salesman problems; Computational modeling; Gallium; Delivery Route Scheduling System; Genetic Algorithm (GA); Heuristics; Traveling Salesman Problems (TSP);
fLanguage
English
Publisher
ieee
Conference_Titel
Systems Man and Cybernetics (SMC), 2010 IEEE International Conference on
Conference_Location
Istanbul
ISSN
1062-922X
Print_ISBN
978-1-4244-6586-6
Type
conf
DOI
10.1109/ICSMC.2010.5642248
Filename
5642248
Link To Document