{"title":"司机偏好的“叫车”问题","authors":"Sana Ouasaid, Mohammed Saddoune","doi":"10.1109/ICOA51614.2021.9442667","DOIUrl":null,"url":null,"abstract":"The dial-a-ride problem (DARP) is an NP-Hard problem related to transportation on demand, that consists in a set of requests for pick-up and delivery from passengers that need to be served by a limited set of available vehicles. In this paper, We study a static version of DARP with a time window. The goal is to determine an optimized route for taxis in order to serve passengers. Using an objective function that imposes penalties to assess the preferences of passengers, taking into account the driver’s preferences to reach a specific destination at a specific time. For our tests, we generated instances derived from standard DARP instances. A solution approach based on the ILS algorithm is presented and applied to solve these instances.","PeriodicalId":352572,"journal":{"name":"2021 7th International Conference on Optimization and Applications (ICOA)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A dial-a-ride problem with driver preferences\",\"authors\":\"Sana Ouasaid, Mohammed Saddoune\",\"doi\":\"10.1109/ICOA51614.2021.9442667\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The dial-a-ride problem (DARP) is an NP-Hard problem related to transportation on demand, that consists in a set of requests for pick-up and delivery from passengers that need to be served by a limited set of available vehicles. In this paper, We study a static version of DARP with a time window. The goal is to determine an optimized route for taxis in order to serve passengers. Using an objective function that imposes penalties to assess the preferences of passengers, taking into account the driver’s preferences to reach a specific destination at a specific time. For our tests, we generated instances derived from standard DARP instances. A solution approach based on the ILS algorithm is presented and applied to solve these instances.\",\"PeriodicalId\":352572,\"journal\":{\"name\":\"2021 7th International Conference on Optimization and Applications (ICOA)\",\"volume\":\"88 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-05-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 7th International Conference on Optimization and Applications (ICOA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICOA51614.2021.9442667\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 7th International Conference on Optimization and Applications (ICOA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOA51614.2021.9442667","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The dial-a-ride problem (DARP) is an NP-Hard problem related to transportation on demand, that consists in a set of requests for pick-up and delivery from passengers that need to be served by a limited set of available vehicles. In this paper, We study a static version of DARP with a time window. The goal is to determine an optimized route for taxis in order to serve passengers. Using an objective function that imposes penalties to assess the preferences of passengers, taking into account the driver’s preferences to reach a specific destination at a specific time. For our tests, we generated instances derived from standard DARP instances. A solution approach based on the ILS algorithm is presented and applied to solve these instances.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
