Ant Colony Algorithm Based on Vehicle Scheduling Problem with Time Windows under Emergency Conditions
by Tao Qiao, (School of Transportation and. Logistics, Southwest Jiaotong University, Dr., Chengdu, Sichuan, 610031, China. E-mail: xiaoqiaoer1022@163.com.) and Gangtie Chen, (School of Transportation and. Logistics, Southwest Jiaotong University, Dr., Chengdu, Sichuan, 610031, China. E-mail: chengangtie@163.com.)
Section: Environment, Security, Safety, and Education, pp. 3207-3212, (doi: http://dx.doi.org/10.1061/41184(419)529)
Access full text
Purchase Subscription
Permissions for Reuse 
| Document type: |
Conference Proceeding Paper |
| Part of: |
ICTE 2011 |
| Abstract: |
Under emergency conditions, the demand for emergency supplies have time constraints, It is with great significance under conditions of the time window to study vehicle scheduling problem to reduce the loss. With time windows constraints for the distribution center vehicle scheduling problem, ant colony algorithm using the time window into the form of penalty function, be incorporated into the objective function, the established time to meet customer delivery requirements of the minimum cost of transport under the conditions of the vehicle scheduling model, solution of the model be proposed, Simulation analysis is taking with an example. |
|
