| Autor: |
Lian, Lian, Castelain, Emmanuel |
| Předmět: |
|
| Zdroj: |
AIP Conference Proceedings; 6/17/2010, Vol. 1247 Issue 1, p457-471, 15p, 10 Diagrams, 3 Graphs |
| Abstrakt: |
This paper presents a new distribution and route planning problem, General Delivery Problem (GDP) which is more general than the well-known Vehicle Routing Problem. To solve a GDP, a three-phase framework heuristic approach based on decomposition techniques is introduced. The decomposition techniques are employed to divide an original problem into a set of sub-problems, which can reduce the problem size. A kind of decomposition technique, Capacity Clustering Algorithm (CCA), is embedded into the framework with Simulated Annealing (SA) to solve a special GDP. The proposed three-phase framework with the above two algorithms is compared with five other decomposition methods in a distribution instance of the Regional Fire and Emergency Center in the north of France. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
