[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"doc-detail-118664-en":3,"doc-seo-118664-105":30,"detail-sidebar-cat-0-en-105":91},{"code":4,"msg":5,"data":6},0,"success",{"doc_id":7,"user_id":8,"nickname":9,"user_avatar":10,"doc_module":4,"category_id":11,"category_name":12,"doc_title":13,"doc_description":14,"doc_content":15,"file_id":16,"file_url":17,"file_type":18,"file_size":19,"view_count":4,"is_deleted":4,"is_public":20,"is_downloadable":20,"audit_status":20,"page_count":21,"language":22,"language_code":23,"site_id":24,"html_lang":23,"table_of_contents":25,"faqs":26,"seo_title":27,"seo_description":14,"update_tm":28,"read_time":29},118664,13056703020460,"Valentina","https://ap-avatar.wpscdn.com/avatar/be000253dac470eee5d?_k=1778207105932848923",8,"Research & Report","Estimating Taxi Fares Using Machine Learning - Master Thesis - 2024","This master’s thesis examines how Artificial Intelligence algorithms can estimate taxi fares across different zones of a city to enhance taxi fleet synchronization and reduce passenger waiting times. The work focuses on the Random Forest machine learning approach for predictive fare estimation and includes a literature review on AI developments in market analysis and price estimation. Model development covers data preparation, configuring and justifying the architecture, training, validation, and evaluation across scenarios, with an emphasis on avoiding overfitting.","Estimating Taxi Fares Using Machine  \nLearning  \nPierre Pascal Bian Theke  \nMaster Thesis  \n2024  \nI hereby declare that:  \n• I understand that by submitting my Master´s thesis, I agree to the publication of my work according to Law No. 111/1998, Coll., On Universities and on changes and amendments to other acts (e.g. the Universities Act), as amended by subsequent legislation, without regard to the results of the defence of the thesis.  \n• I understand that my Master´s Thesis will be stored electronically in the university information system and be made available for on-site inspection, and that a copy of the Master´s Thesis will be stored in the Reference Library of the Faculty of Applied Informatics, Tomas Bata University in Zlín, and that a copy shall be deposited with my Supervisor.  \n• I am aware of the fact that my Master´s Thesis is fully covered by Act No. 121/2000 Coll. On Copyright, and Rights Related to Copyright, as amended by some other laws (e.g. the Copyright Act), as amended by subsequent legislation; and especially, by §35, Para. 3.  \n• I understand that, according to §60, Para. 1 of the Copyright Act, TBU in Zlín has the right to conclude licensing agreements relating to the use of scholastic work within the full extent of §12, Para. 4, of the Copyright Act.  \n• I understand that, according to §60, Para. 2, and Para. 3, of the Copyright Act, I may use my work-Master´s Thesis, or grant a license for its use, only if permitted by the licensing agreement concluded between myself and Tomas Bata University in Zlín with a view to the fact that Tomas Bata University in Zlín must be compensated for any reasonable contribution to covering such expenses/costs as invested by them in the creation of the thesis (up until the full actual amount) shall also be a subject of this licensing agreement.  \n• I understand that, should the elaboration of the Master´s Thesis include the use of software provided by Tomas Bata University in Zlín or other such entities strictly for study and research purposes (i.e. only for non-commercial use), the results of my master’s Thesis cannot be used for commercial purposes.  \n• I understand that, if the output of my Master´s Thesis is any software product(s), this/these shall equally be considered as part of the thesis, as well as any source codes, or files from which the project is composed. Not submitting any part of this/these component(s) may be a reason for the non-defence of my thesis.  \nI herewith declare that:  \n• I have worked on my thesis alone and duly cited any literature I have used. In the case of the publication of the results of my thesis, I shall be listed as co-author.  \n• That the submitted version of the thesis and its electronic version uploaded to IS/STAG are both identical.  \nIn Zlín; dated:    \nStudent´s Sign  \nABSTRAKT  \nTato diplomová práce se zaměřuje na využití algoritmů umělé inteligence (AI) pro odhad cenjízdného v taxislužbě . Odhadováním jízdného v různých zónách města pomocí těchtoalgoritmů lze zlepšit synchronizaci vozového parku taxislužby, což by následně zkrátilo čekací doby. Práce konkrétně analyzuje použití metody strojového učení Random Forest pro tento účel. Je uveden přehled literatury o vývoji umělé inteligence v oblasti analýzy trhu a odhaducen. Zdůrazňuje posun směrem ke strojovému učení pro komplexní průzkum trhu. Procesvývoje přesných prediktivních modelů zahrnuje zpracování složitých souborů dat a zamezení overfittingu. K dosažení tohoto cíle metodika zahrnuje konfiguraci modelu a zdůvodnění jeho architektury. Implementace modelu zahrnuje předběžné zpracování dat, jeho trénování a ověřování a analýzu jeho výkonnosti v různých scénářích. V závěru práce je kritickyzhodnocena přesnost modelu Random Forest a jeho interpretovatelnost, jakož i jeho účinnost při odhadu jízdného. Přitomje zdůrazněna schopnost umělé inteligence změnit cenové strategie v odvětví taxislužby.  \nKlíčová slova: Umělá inteligence, strojové učení, algoritmus Random Forest, pre","cbCaikCvU9FnAHON","https://ap.wps.com/l/cbCaikCvU9FnAHON","pdf",2586611,1,84,"English","en",105,"# Abstract\n## Method and model development\n## Evaluation and conclusions\n# Keywords","[{\"question\":\"What problem does the thesis address in taxi services?\",\"answer\":\"It addresses improving fare estimation across city zones so that taxi fleet synchronization can improve, reducing waiting times.\"},{\"question\":\"Which machine learning method is analyzed?\",\"answer\":\"The thesis specifically analyzes the Random Forest machine learning approach for taxi fare estimation.\"},{\"question\":\"How is the predictive model developed and validated?\",\"answer\":\"The methodology includes data pre-processing, configuring and justifying the model architecture, training, validating, and evaluating performance under different scenarios while avoiding overfitting.\"}]","Estimating Taxi Fares Using Machine Learning - Master Thesis - 2024 | PDF",1785684796,212,{"code":4,"msg":31,"data":32},"ok",{"site_id":24,"language":23,"slug":33,"title":13,"keywords":34,"description":14,"schema_data":35,"social_meta":86,"head_meta":88,"extra_data":90,"updated_unix":28},"estimating-taxi-fares-using-machine-learning-master-thesis-2024","",{"@graph":36,"@context":85},[37,54,68],{"@type":38,"itemListElement":39},"BreadcrumbList",[40,44,48,51],{"item":41,"name":42,"@type":43,"position":20},"https://docshare.wps.com","Home","ListItem",{"item":45,"name":46,"@type":43,"position":47},"https://docshare.wps.com/document/","Document",2,{"item":49,"name":12,"@type":43,"position":50},"https://docshare.wps.com/document/research-report/",3,{"item":52,"name":13,"@type":43,"position":53},"https://docshare.wps.com/document/estimating-taxi-fares-using-machine-learning-master-thesis-2024/118664/",4,{"url":52,"name":13,"@type":55,"author":56,"headline":13,"publisher":58,"fileFormat":61,"inLanguage":23,"description":14,"dateModified":62,"datePublished":62,"encodingFormat":61,"isAccessibleForFree":63,"interactionStatistic":64},"DigitalDocument",{"name":9,"@type":57},"Person",{"url":41,"name":59,"@type":60},"DocShare","Organization","application/pdf","2026-08-02",true,{"@type":65,"interactionType":66,"userInteractionCount":4},"InteractionCounter",{"@type":67},"ViewAction",{"@type":69,"mainEntity":70},"FAQPage",[71,77,81],{"name":72,"@type":73,"acceptedAnswer":74},"What problem does the thesis address in taxi services?","Question",{"text":75,"@type":76},"It addresses improving fare estimation across city zones so that taxi fleet synchronization can improve, reducing waiting times.","Answer",{"name":78,"@type":73,"acceptedAnswer":79},"Which machine learning method is analyzed?",{"text":80,"@type":76},"The thesis specifically analyzes the Random Forest machine learning approach for taxi fare estimation.",{"name":82,"@type":73,"acceptedAnswer":83},"How is the predictive model developed and validated?",{"text":84,"@type":76},"The methodology includes data pre-processing, configuring and justifying the model architecture, training, validating, and evaluating performance under different scenarios while avoiding overfitting.","https://schema.org",{"og:url":52,"og:type":87,"og:title":13,"og:site_name":59,"og:description":14},"article",{"robots":89,"canonical":52},"index,follow",{"doc_id":7,"site_id":24},{"code":4,"msg":5,"data":92},[93,97,101,105,110,115,120,123,128,131,135],{"id":20,"doc_module":4,"doc_module_name":46,"category_name":94,"show_sort_weight":95,"slug":96},"Story & Novel",90,"story-novel",{"id":47,"doc_module":4,"doc_module_name":46,"category_name":98,"show_sort_weight":99,"slug":100},"Literature",80,"literature",{"id":53,"doc_module":4,"doc_module_name":46,"category_name":102,"show_sort_weight":103,"slug":104},"Exam",70,"exam",{"id":106,"doc_module":4,"doc_module_name":46,"category_name":107,"show_sort_weight":108,"slug":109},5,"Comic",60,"comic",{"id":111,"doc_module":4,"doc_module_name":46,"category_name":112,"show_sort_weight":113,"slug":114},6,"Technology",50,"technology",{"id":116,"doc_module":4,"doc_module_name":46,"category_name":117,"show_sort_weight":118,"slug":119},7,"Healthcare",40,"healthcare",{"id":11,"doc_module":4,"doc_module_name":46,"category_name":12,"show_sort_weight":121,"slug":122},30,"research-report",{"id":124,"doc_module":4,"doc_module_name":46,"category_name":125,"show_sort_weight":126,"slug":127},9,"Religion & Spirituality",20,"religion-spirituality",{"id":126,"doc_module":4,"doc_module_name":46,"category_name":129,"show_sort_weight":126,"slug":130},"World Cup","world-cup",{"id":132,"doc_module":4,"doc_module_name":46,"category_name":133,"show_sort_weight":132,"slug":134},10,"Lifestyle","lifestyle",{"id":136,"doc_module":4,"doc_module_name":46,"category_name":137,"show_sort_weight":106,"slug":138},19,"General","general"]