4 Presentations

• 
  03:30 PM - 03:55 PM

  The Minimum Flow Cost Hamiltonian Tour Problem

  • Ivan Contreras, presenter, Concordia University
  • Gilbert Laporte, HEC Montréal
  • Camilo Ortiz, Concordia University

  This talk introduces the Minimum Flow Cost Hamiltonian Tour Problem (HTP), which consist of finding a Hamiltonian Circuit that minimizes the total flow cost for sending commodities between pair of nodes. The HTP is closely related to the Traveling Salesman Problem. We present several formulations and compare them theoretically and computationally.

• 
  03:55 PM - 04:20 PM

  A Dual Local Search Algorithm for The Traveling Salesman Problem

  • Jamal Ouenniche, University of Edinburgh
  • Prasanna Kumar Ramaswamy, presenter, University of Edinburgh

  In this research, we design a dual local search algorithm to solve the travelling salesman problem (TSP). The proposed design aims to replicate the designs of optimal solution methodologies such as Branch-and-Bound. To be more specific, we solve a combinatorial relaxation of a TSP formulation and design neighbourhood structures to repair such an infeasible starting solution. Computational results suggest that this dual design is competitive.

• 
  04:20 PM - 04:45 PM

  Skewed Variable Neighborhood Search for Maximum Diversity Grouping Problem

  • Jack Brimberg, presenter, GERAD, The Royal Military College of Canada
  • Nenad Mladenovic, Mathematical Institute SANU
  • Dragan Urosevic, Mathematical Institute SANU

  Given a set of entities and distances (dissimilarities) between any two of them. Maximum Diversity Grouping problem consists of dividing a given entities into groups (clusters) such that the sum of distances between all pairs of entities that belong to the same group is maximal. We propose Skewed Variable Neighborhood Search for solving it. Computational experience is reported.

• 
  04:45 PM - 05:10 PM

  Mathématiques tropicales et optimisation

  • Edouard Wagneur, presenter, GERAD - Polytechnique Montréal

  Les mathématiques tropicales sont nées des applications : informatique (théorie des langages) automatique (commande), télécommunications (optimisation de réseaux) ordonnancements,... Développées de manière relativement indépendantes, mais restant relativement proches des applications. Nous présenterons une sélection de problèmes où elles apportent une vision renouvelée des problèmes et suggère des méthodes originales de solution.