BALANCING COMPLETION TIMES FOR MULTI-VEHICLE DELIVERY WITH TIME VARIOUS VEHICLE SPEEDS

摘要

An efficient heuristic to balance two vehicle delivery completion times is developed in this research. Vehicle moving speeds are assumed to be unsymmetrical between two points and time various. Delivery area divisions for each vehicle are made by modified sweep algorithm by adding two-stage reassignment procedure to resolve a possible unbalance of two vehicle delivery completion times. Three different size of common area are examined to determine the optimum size of common area. Vehicle delivery route is constructed by the 4-time-zone heuristic to avoid time various vehicle moving speeds situations efficiently.