lecture: data-凯发游戏

 lecture: data-凯发游戏
english > events > content
lecture: data-driven robust vehicle path optimization

hits: date:2020-10-28 17:14

time: 14:30 on november 2, 2020
venue: room 0411, teaching building 0#, jiuli campus



event details:

lecturer: assistant professor zhang, yu from southwestern university of finance and economics


about the lecturer:

zhang, yu is currently an associate professor and doctoral supervisor of southwestern university of finance and economics. he is also the doctor of northeastern university, the ph.d. jointly cultivated by national university of singapore. he was invited to visit the national university of singapore as a researcher many times. he mainly engages in robust optimization and its application research in logistics, supply chain, transportation, and medical operation management. he presides over one project of the national natural science foundation of china and participates in many other projects. as the first author, he has published many academic papers in operations research, mathematical programming, european journal of operational research, omega and other journals. he won the "excellent doctoral dissertation" award from the society of management science and engineering (10 nationally) in 2019.

about the lecture:

for the vehicle routing problem with time windows, the lecturer considers the uncertain travel time, generates its empirical distribution through historical data, assumes that the real but unobservable distribution which is in a wasserstein sphere with the empirical distribution as the center of the sphere, and plans the worst distribution of the robust vehicle routing scheme, in order to avoid the risk of late arrival as much as possible under the premise of a given cost budget. in this regard, the lecturer proposes a decision criterion called the service satisfaction risk index, which can simultaneously consider the probability of being late and the duration, characterize the risk and ambiguity of travel time, and can be evaluated analytically. in order to solve this problem, the lecturer proposes an accurate branch & cut method, and a variable neighborhood search meta-heuristic algorithm, and explores its acceleration calculation strategy. a large number of calculation experiments show that this method greatly improves the on-time arrival rate under the premise of slightly higher cost. in terms of solving efficiency, this method is superior to the traditional methods of minimizing the probability of late arrival and minimizing the length of late arrival.