Research Article
A Traffic Restriction Scheme for Enhancing Carpooling
Table 4
Algorithms of network design problem.
| Approach | Proposer/user | Case | Superiorities | Drawbacks |
| Ant system | Poorzahedy and Abulghasemi [16] | Discrete network design | Less computational demand and simple implementation | No guarantee of global optimal solution | Genetic algorithm | Drezner and Wesolowsky [17] | Discrete network design | Less computational demand and simple implementation | No guarantee of global optimal solution | Hybrid meta-heuristic algorithm | Poorzahed and Rouhani [18] | Discrete network design | Less computational demand and simple implementation | No guarantee of global optimal solution | Support fuction | Gao et al. [19] | Discrete network design | Global optimal solution | Expensive computation | Branch and Bound algorithm | Farvaresh and Sepehri [20] | Discrete network design | Global optimal solution | Expensive computation | Simulation | Friesz et al. (1992) | Continuous network design | Global optimal solution or being very close to global optimal solution | Expensive computation | SO-relaxation based method and UE-reduction based method | Wang et al. [21] | Discrete network design | Global optimal solution | Expensive computation | Global optimal approach | Wang and Lo [22] | Mixed network design | Global optimal solution | More restraints and expensive computation | MILP formulation approach | Luathep et al. [23] | Mixed network design | Global optimal solution | Expensive computation |
|
|