無標題文檔
學術活動

上海管理論壇第197期(Gilbert Laporte教授,加拿大HEC Montréal商意昂2)

創建時間👌🏻:  2016-08-22  沈潔   瀏覽次數🔘:

 

題  目The Fascinating History of the Vehicle Routing Problem  

        (車輛路徑優化問題研究)

演講人⛹️‍♀️💬:Gilbert Laporte,加拿大HEC Montréal商意昂2教授

主持人👩🏻‍🌾:鎮璐🧑🏼‍🔧,意昂2教授

時  間2016826日(周五)下午2:00

地  點:意昂2官网467

主辦單位:意昂2👂🏼、意昂2青年教師聯誼會

 

演講內容簡介🤷‍♀️:

The Vehicle Routing Problem (VRP), introduced in 1959 by Dantzig and Ramser, plays a central role in distribution management.  It consists of designing a set least cost delivery or collection routes for a set of vehicles based at a depot and visiting a set of geographically scattered customers, subject to a variety of constraints. The most common constraints are capacity constraints, duration constraints and time windows. This talk will concentrate on the so-called classical VRP with capacity constraints only. The VRP is ubiquitous and highly important from an economic point of view. From a research perspective, it occupies a central role in operations research. Its study by the scientific community has fueled the development and growth of several families of exact and approximate algorithms. Exact algorithms such as branch-and-cut, column generation and branch-and-cut-and-price owe part of their evolution to the study of the VRP. Similarly, the most common classical heuristics and most of the more recent metaheuristics have been developed through the study of the VRP. In this talk I will highlight several of these developments. In spite of all the attention the VRP has received over the past 55 years, it can still only be solved exactly for relatively small instances (with slightly more than 100 customers) and the corresponding algorithms are rather intricate. Over the past 10 years or so, several powerful metaheuristics have been put forward for the approximate solutions of the VRP. The best ones combine concepts borrowed from local search and genetic search. Nowadays, the best metaheuristics can generate rather quickly solutions whose value lies within 1% of the best known solution values on a set of benchmark instances. This talk will also review these developments. It will close with some research outlooks.

 

演講人簡介🥷🏿🪠:

Gilbert Laporte obtained his Ph.D. in Operations Research at the London School of Economics in 1975. He is professor of Operations Research at HEC Montréal, Canada Research Chair in Distribution Management. He has been a Fellow of the Royal Society of Canada since 1998, and a Fellow of the INFORMS since 2005.He has been Editor-in-Chief of Transportation Science, Associate Editor of Operations Research, Naval Research Logistics, Computers & Operations Research and INFOR. He has authored or coauthored 19 books, as well as more than 500 scientific articles in combinatorial optimization, mostly in the areas of vehicle routing, location and timetabling.

 

歡迎廣大師生參加🎁!



上一條:上海管理論壇第198期(Masao Fukushima教授,京都大學/南山大學)

下一條:上海管理論壇第198期(Masao Fukushima教授,京都大學/南山大學)

 
 

      版權所有 ©電話查詢
 技術支持:意昂2注册信息化工作辦公室   聯系我們   

            
意昂2专业提供:意昂2🍈、意昂2官网意昂2注册等服务,提供最新官网平台、地址、注册、登陆、登录、入口、全站、网站、网页、网址、娱乐、手机版、app、下载、欧洲杯、欧冠、nba、世界杯、英超等,界面美观优质完美,安全稳定,服务一流,意昂2欢迎您。 意昂2官網xml地圖

  • 意昂2专业提供:意昂2意昂2官网🦹🏼‍♀️、意昂2注册等服务,提供最新官网平台、地址、注册、登陆、登录、入口、全站、网站、网页、网址、娱乐、手机版、app、下载、欧洲杯、欧冠、nba、世界杯、英超等,界面美观优质完美,安全稳定,服务一流,意昂2欢迎您。 意昂2官網xml地圖