Search Results for author:
Found 6 papers, 2 papers with code
The two-echelon routing problem with truck and drones
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 to intermediate depots while in the second echelon, the drones are used to deliver parcels from intermediate depots to customers.
A new constraint programming model and a linear programming-based adaptive large neighborhood search for the vehicle routing problem with synchronization constraints
We consider a vehicle routing problem which seeks to minimize cost subject to time window and synchronization constraints.
A Hybrid Genetic Algorithm for the Traveling Salesman Problem with Drone
This paper addresses the Traveling Salesman Problem with Drone (TSP-D), in which a truck and drone are used to deliver parcels to customers.
Solving the clustered traveling salesman problem with d-relaxed priority rule
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.
On the Min-cost Traveling Salesman Problem with Drone
We solve a TSP to generate route for truck and propose a mixed integer programming (MIP) formulation with different profit functions to build route for drone.
On the Min-cost Traveling Salesman Problem with Drone
The first algorithm (TSP-LS) was adapted from the approach proposed by Murray and Chu (2015), in which an optimal TSP solution is converted to a feasible TSP-D solution by local searches.
