AdvOL Student Seminars and Defences
Adrian Burlacu,September 19, 2017, 15:30-16:00, ITB 201
Speaker:   Adrian Burlacu

Title:  Minimized asynchronous scalable domain transactions
AdvOL Optimization Seminars
Reza Samavi, September 19, 2017, 16:30-17:30, ITB 201
Speaker:   Reza Samavi
Department of Computing and Software
McMaster University

Title:  Optimizing data utility with privacy constraints
Fields Institute Industrial Optimization Seminar, June 6, 2017
Speakers:   Yuriy Zinchenko (University of Calgarys)
Pooyan Shirvani (TD Bank)

On the first Tuesday of each month, the Industrial Optimization Seminar is held at the Fields Institute. See the seminar series website for further information.
Home arrow Seminars arrow Invited seminars arrow Kai Huang, January 24, 2017, 16:30-17:30, ITB 201
Sunday, 24 September 2017
Main Menu
Internal pages
Latest Theses
File Icon Computational Determination of the Largest Lattice Polytope Diameter
File Icon Computational Framework for the Generalized Berge Sorting Conjecture
File Icon Structural Factorization of Squares in Strings
Latest Reports
Visitors by region
Totals Top 20
 61 % Unknown
 14 % Commercial
 8 % networks
 6 % Canada
 3 % Germany
 2 % China
 2 % Russia
 < 1.0 % Educational
 < 1.0 % Brazil
 < 1.0 % United Kingdom
 < 1.0 % Ukraine
 < 1.0 % Poland
 < 1.0 % 
 < 1.0 % Italy
 < 1.0 % France
 < 1.0 % Netherlands
 < 1.0 % Japan
 < 1.0 % India
 < 1.0 % Australia
 < 1.0 % Organization

Visitors: 5142815
Kai Huang, January 24, 2017, 16:30-17:30, ITB 201
Speaker:   Kai Huang
DeGroote School of Business
McMaster University

Title:   Vehicle Routing Problem with Interdiction

We study the role of interdiction in the Vehicle Routing Problem (VRP), which naturally arises in humanitarian logistics and military applications. We assume that in a general network, each edge has a chance to be interdicted. When interdiction happens, the vehicle traveling on this edge is lost, thus unable to continue the trip. Our objective is to minimize the total travel cost or to maximize the demand fulfillment, depending on the supply quantity. This problem is called the Vehicle Routing Problem with Interdiction (VRPI). We first prove that the proposed VRPI problems are NP-hard. Then we show some key analytical properties pertaining to the optimal solutions of these problems. Importantly, the original Dror and Trudeau's property does not hold for these problems. However, a generalization of the Dror and Trudeau's property holds. We also present efficient heuristic algorithms to solve these problems. Finally, our numerical studies demonstrate the effectiveness of the proposed models and algorithms.
< Prev   Next >
McMaster University
McMaster University
Faculty of Engineering
Faculty of Engineering
Faculty of Science
Faculty of Science
Computing & Software
Computing & Software
Comput. Eng. & Sci.

School Website >>>

Latest Publications
Publication Downloads
Error cannot find GD extension