Vehicle Routing Problem for Multiple Product Types, Compartments, and Trips with Soft Time Windows
Conclusion
In this paper, we present a mathematical model for
the vehicle routing problem for multiple product types, compartments,
and trips with soft time windows. We have verified our feasibilities and
attended the optimal solution for the problems. We use the software
package AIMMS to solve the problems on a personal computer. The run
times are acceptable. Numerical results show the effectiveness of our
model.