APPLICATION of HYBRID ANT COLONY OPTIMIZATION ( HACO ) AlGORITHM for SOLVING CAPACITATED VEHICLE ROUTING PROBLEM ( CVRP )

@inproceedings{Babu2012APPLICATIONOH,
  title={APPLICATION of HYBRID ANT COLONY OPTIMIZATION ( HACO ) AlGORITHM for SOLVING CAPACITATED VEHICLE ROUTING PROBLEM ( CVRP )},
  author={B. Ramesh Babu and Manjula Poojary and B G Renuka},
  year={2012}
}
The Capacitated Vehicle Routing problem (CVRP) is a combinatorial optimization and nonlinear problem seeking to service a number of customers with a fleet of vehicles. CVRP isan important problem in the fields of transportation, distribution and logistics . Usually, the goal is delivering goods located at a central depot to customers who have placed orders. This transportation optimization problem is NP-hard ,which means that the computational effort required to solve it increases exponentially… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 17 references

Ant Algorithm for Mobile Adhoc network

NK Cauvery, Dr. KV Viswanatha
Proceedings of the International Conference on Advanced Computing and Communication Technologies for High Performance Applications, • 2008
View 1 Excerpt

Particle Swam Optimization with Simulated Annealing for TSP

L. Fang P. Chen, S. Liu
Proceedings of 6 th WSEAS Int . Conf on Artificial Intelligence , Knowledge Engineering and Databases • 2007

Particle Swam Optimization with Simulated Annealing for TSP, “In

L. Fang P. Chen, S. Liu
Proceedings of 6 WSEAS Int. Conf on Artificial Intelligence, Knowledge Engineering and Databases, • 2007
View 2 Excerpts

The effect of Routing under local information using a Social inspect Metaphor

S Liang, A NZincirHaywood, M IHeywood
IEEE International Congress of Evolutionary Computation • 2002
View 1 Excerpt

Similar Papers

Loading similar papers…