DHDarren D. Hang

Darren D. Hang

*This is an algorithmically generated author record based on publicly available information.

Darren D. Hang has a total of 1 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • A time-window sliding procedure for driver-task assignment with random service times

    by Raymond K. Cheung, Darren D. Hang

    This paper addresses the problem of assigning drivers to cover tasks when the tasks are the movements of containers. The tasks must be started within certain time windows and their servicing times are uncertain while the decisions are made over time. These decisions can be changed if new information is received. The problem is formulated in a stochastic optimization framework with the objective of minimizing the costs of current driver-task assignment and the expected future costs. A time-window sliding solution procedure is developed to estimate the expected future costs by solving the minimum cost flow problems iteratively. Furthermore, the results of the numerical experiments that assess the efficiency of the algorithm and the benefits of considering uncertainty in the model are reported.


  • Multi-attribute label matching algorithms for vehicle routing problems with time windows and backhauls

    by Raymond K. Cheung, Darren D. Hang

    We consider the class of vehicle routing problems with backhauls and time window constraints. Our motivating application is the land transportation of air-cargo freight forwarders, which requires fast solution times and the ability to handle various operational issues such as heterogeneous vehicles, multiple trips per vehicle, and penalty for early arrival at customer sites. We formulate the problem in the framework of label matching where the labels have multiple attributes representing the states of vehicles at customer locations or possible routes that vehicles may continue to cover. Two optimization-based heuristics are developed. Experimental tests on random problems and real data show that the methods can produce quality solutions quickly and are flexible in incorporating complex constraints.