Combinatorial Prob.

Real-world Problem in Transportation System 
(Based on the data: 2010)

This is an interesting benchmark for combinatorial problem and it is applied for Vehicle Routing Problem.

All the data based on the real world problem and its collected in 2010 from shipping company.

Each vehicle has different in specification i.e. size, capacity, speed and maximum travel distance allowed.

Some constraints:

1. Total travel time of each route not exceed the maximum travel time allowed.

2. Total travel distance of each route not exceed the maximum travel distance allowed.

3. There are a condition where not every ship can be serve of ports (site-dependent problem).

4. A route has at least one fuel port (multi-depot VRP).

The results using "set partitioning heuristic" to solve the problem could be seen in Table below:

We have data:

1. The size, capacity and speed of each ship.

2. The distance between each port.

3. The number of passenger between each port.

We have result when the problem solved by:

1. Heuristic: Nearest Neighboor

2. General Genetic Algorithm

3. Hybrid Genetic Algorithm

Please send email for more information.

.