Scribd
Upload
25 views

Vehicle

The document announces a lecture on the fascinating history of the Vehicle Routing Problem (VRP), which was introduced in 1959 and plays a central role in distribution management. The lecture will focus on the classical VRP with capacity constraints only, and will highlight how exact algorithms like branch-and-cut and heuristics have been developed through the study of the VRP. It will also review powerful metaheuristics developed in recent decades that combine concepts from local search and genetic search. The speaker, Professor Gilbert Laporte, is an expert in combinatorial optimization, mostly in vehicle routing, location and timetabling.

Uploaded by

Brett Head
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
25 views

Vehicle

The document announces a lecture on the fascinating history of the Vehicle Routing Problem (VRP), which was introduced in 1959 and plays a central role in distribution management. The lecture will focus on the classical VRP with capacity constraints only, and will highlight how exact algorithms like branch-and-cut and heuristics have been developed through the study of the VRP. It will also review powerful metaheuristics developed in recent decades that combine concepts from local search and genetic search. The speaker, Professor Gilbert Laporte, is an expert in combinatorial optimization, mostly in vehicle routing, location and timetabling.

Uploaded by

Brett Head
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Distinguished Transport Lecture Series 2014: The Fascinating History of the Vehicle

Routing Problem
Organized by Institute of Transport Studies of HKU and supported by HKIE Civil Division

Date, Time & Venue
22 August 2014 (Friday); 7:00-8:00 p.m.; Wang Gungwu Theatre, Graduate House, The University of
Hong Kong

Programme Highlights
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.

Speaker
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.

Enquiries
Ir Prof. S.C. Wong (T)2859-1964 (E) [email protected]

Limit
The number of participants is limited to 200.

You might also like