Browsing by Advisor Minh Hoàng Hà

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
or enter first few letters:  
Showing results [1 - 2] / 2
  • Authors: Thanh Tan Doan;  Advisor: Nathalie Bostel; Minh Hoàng Hà;  Co-Author: - (2021)

    The Vehicle Routing Problem (VRP) is one of the most studied topics in Operations Research. Among the numerous variants of the VRP, this research addresses the VRP with relaxed priority rules (VRP-RPR) in which customers are assigned to several priority groups and customers with the highest priorities typically need to be served before lower priority ones. Additional rules are used to control the trade-off between priority and cost efficiency. We propose a Mixed Integer Linear Programming (MILP) model to formulate the problem and to solve small-sized instances. A metaheuristic based on the Adaptive Large Neighborhood Search (ALNS) algorithm with problem-tailored components is then des...
  • Authors: Ancele, Yannis;  Advisor: Minh Hoàng Hà; Charly Lersteau; Dante Ben Matellini; Trung Thanh Nguyen;  Co-Author: - (2021)

    One important requirement of modern supply chain management is the frequent exchange of containers via multiple cross-docks which requires spatial and time synchronisations between different types of vehicle. Moreover, as collaborations in logistics between several companies become popular, more flexible and extended models must be solved to consider the different needs of the companies. This is of high importance in a new logistics concept, the Physical Internet, which is expected to considerably improve the way logistics are handled in the current supply chain management. To optimise the aforementioned requirements, a rich vehicle routing problem with pickup and delivery includin...