A genetic approach for two-dimensional loading capacitated vehicle routing problems
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
Original language | English |
---|---|
Pages (from-to) | 727-740 |
Journal / Publication | Dynamics of Continuous, Discrete and Impulsive Systems Series B: Applications and Algorithms |
Volume | 16 |
Issue number | 5 |
Publication status | Published - Oct 2009 |
Link(s)
Abstract
In this paper, a genetic approach is proposed to solve the two-dimensional loading capacitated vehicle routing problem (2DL-CVRP), for meeting the customer requirements in the logistics industry. A 2DL-CVRP consists of two sub-problems, namely the two-dimensional packing problem and the routing problem, which are both NP-hard. In our proposed approach, the packing problem, which is also known as the bin-packing problem, is tackled with a hybrid genetic approach while the vehicle routing is achieved by the branch-and-bound method. By combining these two approaches with an order-based genetic algorithm, it is demonstrated that better solutions for 2DL-CVRP can be duly obtained as compared with the existing ones. Copyright © 2009 Watam Press.
Research Area(s)
- Branch-and-bound, Genetic algorithm, Logistics, Optimization, Vehicle routing problem
Citation Format(s)
A genetic approach for two-dimensional loading capacitated vehicle routing problems. / Yin, J. J.; Tang, Wallace K. S.
In: Dynamics of Continuous, Discrete and Impulsive Systems Series B: Applications and Algorithms, Vol. 16, No. 5, 10.2009, p. 727-740.
In: Dynamics of Continuous, Discrete and Impulsive Systems Series B: Applications and Algorithms, Vol. 16, No. 5, 10.2009, p. 727-740.
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review