Search Results for author:
Found 4 papers, 1 papers with code
Enhanced Methods for the Weight Constrained Shortest Path Problem
This paper leverages the recent state-of-the-art techniques in both constrained pathfinding and bi-objective search and presents two new solution approaches to the WCSPP on the basis of A* search, both capable of solving hard WCSPP instances on very large graphs.
Bi-objective Search with Bi-directional A*
Bi-objective search is a well-known algorithmic problem, concerned with finding a set of optimal solutions in a two-dimensional domain.
Fleet Size and Mix Split-Delivery Vehicle Routing
To do so, we split the problem into two interdependent components: a fleet design component and a routing component.
Benders Decomposition for the Design of a Hub and Shuttle Public Transit System
The BusPlus project aims at improving the off-peak hours public transit service in Canberra, Australia.
