題目：A General Multiple Depot Vehicle Scheduling Problem

主講人：秦虎 華中科技大學(xué)教授

時間：11月20號（周五）下午 16：30-18：00

地點(diǎn)： bwin必贏唯一官網(wǎng)311會議室

歡迎廣大師生參加！

報告摘要：

We study a general multiple depot vehicle scheduling problem in this paper. Given a fleet of vehicles based at multiple depots and a set of trips to be served, we aim to find a set of routes such that the total transportation cost is minimized and all trips are fulfilled. We call this problem “general“ because many practical features have been considered, including heterogeneous vehicles, service start time windows, split loads, and the toll-by-weight scheme. These features, on the one hand, greatly increase the applicability of this problem; on the other hand, however, make the problem very challenging to solve. Based on the concept of cover, we formulate a set partitioning model for this problem. To solve the model, we propose two exact algorithms, namely, a branch-and-price algorithm and a branch and Benders decomposition algorithm. Both algorithms are built upon a branch-and-bound framework. Particularly, we design a column generation procedure equipped with an efficient label setting method to solve subproblems involved in algorithms. Computational experiments have been conducted, and the results have substantiated the effectiveness and efficiency of our approaches.

主講人簡介：

秦虎教授于2002年、2005年在華中科技大學(xué)人工智能與自動化學(xué)院獲得學(xué)士、碩士學(xué)位，2011年在香港城市大學(xué)商學(xué)院獲得博士學(xué)位。主要研究領(lǐng)域包括人工智能優(yōu)化算法，網(wǎng)絡(luò)規(guī)劃，車輛路徑優(yōu)化，智能物流，智能倉儲，智能制造，數(shù)據(jù)挖掘及機(jī)器學(xué)習(xí)等。秦教授已完成國家自科基金項(xiàng)目2項(xiàng)，正在主持1項(xiàng)國家自科基金面上項(xiàng)目，在英文SCI/SSCI期刊上共發(fā)表論文40余篇，其中包括INFORMS Journal On Computing（IJOC）1篇, Transportation Science （TS）3篇，European Journal of Operational Research （EJOR） 11篇。2018年10月18日，秦教授獲得京東全球運(yùn)籌優(yōu)化挑戰(zhàn)賽（城市物流運(yùn)輸車輛智能調(diào)度）總冠軍。秦教授積極地將學(xué)術(shù)研究成果應(yīng)用到企業(yè)實(shí)踐中，為企業(yè)創(chuàng)造價值,增強(qiáng)企業(yè)的競爭力，主持和完成了多個企業(yè)項(xiàng)目，合作單位包括華為技術(shù)有限公司，順豐速運(yùn)有限公司，美的集團(tuán)，藍(lán)月亮有限公司，廣州寶潔有限公司，上?？萍浖萍加邢薰镜?。