This paper describes a greedy heuristic for a class of combinatorial optimization problems; a central feature of the method being a look-ahead capability. The power of the heuristic is demonstrated ...
An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints
The Vehicle Routing and Scheduling Problem with Time Window constraints is formulated as a mixed integer program, and optimization-based heuristics which extend the cluster-first, route-second ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback