Integrating Uncomfortable Intersection-Tur
Yasushi Kambayashi, Hidemi Yamachi, Yasuhiro Tsujimura, Hisashi Yamamoto · 2007
Routeselection isoneofthemostimportant intersections, maybetheonethat hasfewest traffic signals, problems foracarnavigation system. Givenapair oforigin and maybetheleast congested road, ormaybejust anarterial road. destination, there aremanypossible routes. Mostcurrent car Itdepends onthedriver's personal preference. Thus, tailoring navigation systems propose theshortest pathfromtheorigin to adriving route for one's specific preference isimportant. We thedestination. Selecting theshortest pathisnotahardproblem, haveengaged toconstruct amulti-objective genetic algorithm buttheshortest pathisnotalways whattheuserwants; whatthe userreally wants tohaveisthemostcomfortable route forhimor toselect subjectively optimal route forsuchproposal (2).In hertodrive. Inother words, thedriver wantstohaveacar thispaper,we reportour attemptto integrate navigation system topropose thesubjectively optimal route for uncomfortable-turns into theconditions ofourGA-based route himorher. Finding sucharoute requires enumerating allthe selection algorithm. possible routes, andisknownasaNP-hard problem. Inorder to Quite afewresearch worksonautomatic routeselection reduce computational complexity, wehaveemployed aGA to problems arereported intheliteratures suchasDuckmanand find a(subjectively) quasi optimal route forthedriver. InthisKulik that computes thesimplest pathinterms ofeaseof paper, wereport ourattempt tointegrate uncomfortable-turns