{"id":11036,"date":"2023-12-09T22:51:58","date_gmt":"2023-12-09T21:51:58","guid":{"rendered":"https:\/\/www.ibisc.univ-evry.fr\/liping-gao-defends-his-doctoral-thesis-on-monday-december-18-2023-efficient-approaches-for-large-scale-time-dependent-route-planning-problems-with-travelers-preference\/"},"modified":"2024-06-25T22:53:47","modified_gmt":"2024-06-25T20:53:47","slug":"liping-gao-defends-his-doctoral-thesis-on-monday-december-18-2023-efficient-approaches-for-large-scale-time-dependent-route-planning-problems-with-travelers-preference","status":"publish","type":"post","link":"https:\/\/www.ibisc.univ-evry.fr\/en\/liping-gao-defends-his-doctoral-thesis-on-monday-december-18-2023-efficient-approaches-for-large-scale-time-dependent-route-planning-problems-with-travelers-preference\/","title":{"rendered":"Liping GAO defends his doctoral thesis on Monday, December 18, 2023: “Efficient approaches for large-scale time-dependent route planning problems with traveler\u2019s preference”"},"content":{"rendered":"
\n\t\t\t\t\t
\n\t\t\t\t\t\t

Liping GAO defends his doctoral thesis on Monday, December 18, 2023 at 10:00 a.m. The defense takes place in room 334 of the IBGBI site. It is also possible to attend the defense via Zoom:\u00a0https:\/\/univ-evry-fr.zoom.us\/j\/93676270202?pwd=UU9FaytzbWpIWlZ2cHB2dmNYUlY0QT09<\/a><\/p>\n

Abstract<\/strong>:<\/h2>\n

Traveler’s preference-driven route planning is one of the most complicated and important tourism preparing activities. In reality, travelers may have multi-preferences such as travel time, beautiful scenery, safety, and low carbon, simultaneously.\u00a0\u00a0\u00a0Moreover, the preference and travel time are both time-dependent. Considering that real-world road networks are typically large-scale and include hundreds of thousands of road segments and intersections, the routing planning process can be extremely time-consuming. Developing an efficient decision support platform that can be able to propose the best route planning to satisfy various traveler\u2019s preferences in such diverse contexts is necessary. In this thesis, three new time-dependent route planning problems with traveler\u2019s preference (TRPPs-TP) are investigated.<\/p>\n

Firstly, a single-objective TRPP-TP is investigated in that the preference score on road segments is assumed to be time-dependent. The objective is to maximize the total preference score. For the problem, an integer linear programming model is proposed, and the NP-hard complexity of the problem is analyzed. To address the problem efficiently, a novel two-phase method is developed. Numerical experiments on randomly generated road networks and real-world road networks demonstrate the superiority of the developed method.<\/p>\n

Secondly, a bi-objective TRPP-TP with the time-dependent preference score is studied. The first objective is to maximize the total preference score, and the second one is to minimize the total travel time. For the problem, an integer linear programming model is formulated. For the problem, an exact\u00a0epsilon-constraint method is applied to find the Pareto front on small-sized instances. To handle large-sized instances, an efficient problem-specific non-dominated sorting genetic algorithm-II (NSGA-II) is developed. Especially, a new region-based coding is designed and a feasible route condition is provided to find near-optimal solutions in a reasonable computation time. Experiments on randomly generated road networks and real-world road networks demonstrate the performance of the proposed NSGA-II.<\/p>\n

Finally, a bi-objective eco-friendly group-oriented TRPP-TP is addressed. The first objective is to maximize the total traveler preference score and the second one is to minimize the total carbon emissions. For this problem, a new integer linear programming model is proposed, and an\u00a0epsilon-constraint method is used. Numerical experiments on randomly generated road networks are conducted to find the best balancing solutions.<\/p>\n

Keywords:<\/strong>\u00a0<\/em><\/strong>route planning, time-dependent preference, time-dependent travel time, mathematical model, epsilon-constraint method, NSGA-II<\/strong><\/p>\n<\/div>

<\/div>
<\/div>

Composition of the doctoral thesis jury<\/span><\/h3>\n<\/div>\n
\n\n\n\n\n\n\n\n\n\n\n\n
Jury member<\/th>\nTitle<\/th>\nInstitution<\/th>\nFunction in the jury<\/th>\n<\/tr>\n<\/thead>\n
\u00c9ric ANGEL<\/td>\nProfessor<\/td>\nUniversity of Paris-Saclay (Univ. \u00c9vry)<\/td>\nExaminer<\/td>\n<\/tr>\n
Lyes BENYOUCEF<\/td>\nProfessor<\/td>\nAix-Marseille University<\/td>\nReviewer<\/td>\n<\/tr>\n
Chao CHEN<\/td>\nProfessor<\/td>\nChongqing University<\/td>\nInvited member<\/td>\n<\/tr>\n
Feng CHU<\/td>\nProfessor<\/td>\nUniversit\u00e9 Paris-Saclay (Univ.\u00a0\u00c9vry)<\/td>\nThesis Director<\/td>\n<\/tr>\n
David DUVIVIER<\/td>\n\u00a0Professor<\/td>\nPolytechnic University of Hauts-de-France<\/td>\nReviewer<\/td>\n<\/tr>\n
Issam NOUAOURI<\/td>\nAssociate Professor<\/td>\nUniversity of Artois<\/td>\nExaminer<\/td>\n<\/tr>\n
Lydie NOUVELI\u00c8RE<\/td>\nAssociate Professor<\/td>\nUniversit\u00e9 Paris-Saclay (Univ.\u00a0\u00c9vry)<\/td>\nExaminer<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n
<\/div>
<\/div>