We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
A Decomposition Approach to Solve a General Delivery Problem.
- Authors
Lian, L.; Castelain, E.
- Abstract
This paper presents a new distribution and route planning problem, General Delivery Problem (GDP). Such problem is more general than the well-known Vehicle Routing Problem. To solve a GDP, a three-phase framework 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 three-phase 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 Franc e.
- Subjects
MATHEMATICAL decomposition; HEURISTIC algorithms; ALGORITHMS; SIMULATED annealing; COMBINATORIAL optimization
- Publication
Engineering Letters, 2010, Vol 18, Issue 1, p85
- ISSN
1816-093X
- Publication type
Article