Date, time & venue
Organized by Institute of Transport Studies of HKU and supported by HKIE Civil Division
The Vehicle Routing Problem (VRP), introduced in 1959 by Dantzig and Ramser, plays a central role in distribution management. This talk will concentrate on the so-called classical VRP with capacity constraints only. 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. 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. This talk will also review these developments. For details, see http://www.hkuits.hku.hk/DTLS2014.htm.
Professor 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 Montreal, Canada Research Chair in Distribution Management. He has been Editor of Transportation Science, Computers & Operations Research and INFOR. He has authored or coauthored 15 books, as well as more than 400 scientific articles in combinatorial optimization, mostly in the areas of vehicle routing, location and timetabling.
Ir Prof. S.C. Wong (T)2859-1964 (E) firstname.lastname@example.org
The number of participants is limited to 200.
Copyright ©2018 The Hong Kong Institution of Engineers. All rights reserved.