A Hybrid Algorithm for the Multi-Objective Time Dependent Vehicle Routing Problem

Yi Sun; Yue Chen; Chang Chun Pan; Gen Ke Yang

doi:10.4028/www.scientific.net/AMM.505-506.1071

Paper Titles

Development and Evaluation of a Green Wave Control Algorithm Based on Two-Way Bandwidth Maximization for Transit Signal Priority
p.1046

Video Analysis of Conflict Situations and Parking Problem
p.1055

LOSS Evaluation for Continuous Downgrades Segments Based on Accident Frequency Prediction
p.1061

Reach on Value of Crash Reduction Factor (CRF) in Safeguard Technology of Mountainous Rural Highway
p.1067

A Hybrid Algorithm for the Multi-Objective Time Dependent Vehicle Routing Problem
p.1071

Research on Traffic Organization at the Access of Urban Tunnels
p.1076

The Analysis of Emergency Rescue System for Urban Road Traffic Accidents
p.1080

Optimization Model of Airplane Data Communication Network for Air Traffic Management
p.1084

Optical Research on Delivery of Departure Aircraft in Airspace Class D
p.1089

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 505-506A Hybrid Algorithm for the Multi-Objective Time...

A Hybrid Algorithm for the Multi-Objective Time Dependent Vehicle Routing Problem

Abstract:

This paper presents a real road network case based on the time dependent vehicle routing problem with time windows (TDVRPTW), which involves optimally routing a fleet of vehicles with fixed capacity when traffic conditions are time dependent and services at customers are only available in their own time tables. A hybrid algorithm based on the Genetic Algorithm (GA) and the Multi Ant Colony System (MACS) is introduced in order to find optimal solutions that minimize two hierarchical objectives: the number of tours and the total travel cost. The test results show that the integrated algorithm outperforms both of its traditional ones in terms of the convergence speed towards optimal solutions.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 505-506)

Pages:

1071-1075

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.505-506.1071

Citation:

Cite this paper

Online since:

January 2014

Authors:

Yi Sun*, Yue Chen, Chang Chun Pan, Gen Ke Yang

Keywords:

Genetic Algorithm (GA), Multi Ant Colony, Time Dependent, Vehicle Routing

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] L.M. Gambardella, E. Taillard, G. Agazzi. MACS-VRPTW Vehicle Routing Problem with Time Windows. New Ideas in Optimization, 1999. 63-76.

Google Scholar

[2] A.V. Donati, R. Montemanni, N. Casagrande, A.E. Rizzoli, L.M. Gambardella. Time dependent vehicle routing problem with a multi ant colony system. European Journal of Operational Research, 2008(185) 1174-1191.

DOI: 10.1016/j.ejor.2006.06.047

Google Scholar

[3] M. Dorigo, L.M. Gambardella. Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Transactions on Evolutionary Computation, 1997(1) 53-66.

DOI: 10.1109/4235.585892

Google Scholar

[4] D. j. Rosenkrantz, R. e. Stearns, P.M. Lewis. An Analysis of Several Heuristics for the Traveling Salesman Problem. SIAM J. Comput., vol. 6, 563-581, (1977).

DOI: 10.1137/0206041

Google Scholar

[5] G. Rinaldi, L.A. Yarrow. Optimizing a 48-city Traveling Salesman Problem: A Case Study in Combinatorial Problem Solving, (1985).

Google Scholar