activity
20172021
most citedThe two-echelon routing problem with truck and drones

2 citations · 3 across the 3 of their papers we have counts for

collaborators

8 papers

cs.DS20211 cited

Exact Algorithms for Scheduling Problems on Parallel Identical Machines with Conflict Jobs

Minh Hoàng Hà, Dinh Quy Ta, Trung Thanh Nguyen

Machine scheduling problems involving conflict jobs can be seen as a constrained version of the classical scheduling problem, in which some jobs are conflict in the sense that they…

cs.DS2020

Arc Routing with Time-Dependent Travel Times and Paths

Thibaut Vidal, Rafael Martinelli, Tuan Anh Pham +1

Vehicle routing algorithms usually reformulate the road network into a complete graph in which each arc represents the shortest path between two locations. Studies on time-dependen…

cs.AI20202 cited

The two-echelon routing problem with truck and drones

Minh Hoàng Hà, Lam Vu, Duy Manh Vu

In this paper, we study novel variants of the well-known two-echelon vehicle routing problem in which a truck works on the first echelon to transport parcels and a fleet of drones…

cs.AI2019

A new constraint programming model and a linear programming-based adaptive large neighborhood search for the vehicle routing problem with synchronization constraints

Minh Hoàng Hà, Tat Dat Nguyen, Thinh Nguyen Duy +3

We consider a vehicle routing problem which seeks to minimize cost subject to time window and synchronization constraints. In this problem, the fleet of vehicles is categorized int…

cs.AI2018

A Hybrid Genetic Algorithm for the Traveling Salesman Problem with Drone

Quang Minh Ha, Yves Deville, Quang Dung Pham +1

This paper addresses the Traveling Salesman Problem with Drone (TSP-D), in which a truck and drone are used to deliver parcels to customers. The objective of this problem is to eit…

cs.AI2018

Solving the clustered traveling salesman problem with d-relaxed priority rule

Hoa Nguyen Phuong, Huyen Tran Ngoc Nhat, Minh Hoàng Hà +2

The Clustered Traveling Salesman Problem with a Prespecified Order on the Clusters, a variant of the well-known traveling salesman problem is studied in literature. In this problem…