Tobacco distribution vehicle routing program and the resolving method

Authors:
Weimin Liu;Sujian Li;Aiyun Zheng;Fanggeng Zhao
Affiliations:
School of Mechanical Engineering, University of Science and Technology Beijing, Beijing and Hebei Polytechnic University, Tangshan, China;School of Mechanical Engineering, University of Science and Technology Beijing, Beijing;Hebei Polytechnic University, Tangshan, China;Vehicle Management Institute, Bengbu, China
Venue:
CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
Year:
2009

Citing 9
Cited 0

Cyclic transfer algorithms for multivehicle routing and scheduling problems

Operations Research
Reactive tabu search in unmanned aerial reconnaissance simulations

Proceedings of the 30th conference on Winter simulation
Competition-based neural network for the multiple travelling salesmen problem with minmax objective

Computers and Operations Research - Special issue on the traveling salesman problem
MAX-MIN Ant system

Future Generation Computer Systems
Metaheuristics in combinatorial optimization: Overview and conceptual comparison

ACM Computing Surveys (CSUR)
An Ant Colony Optimization Algorithm for Multiple Travelling Salesman Problem

ICICIC '06 Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1
A Team ant colony optimization algorithm for the multiple travelling salesmen problem with MinMax objective

MIC '08 Proceedings of the 27th IASTED International Conference on Modelling, Identification and Control
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation
Optimal search strategies using simultaneous generalized hill climbing algorithms

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of tobacco distribution was resolved as two phases: static delivery routing programming phase and dynamic vehicle routing daily schedule phase. The static phase was modeled as the multiple traveling salesmen problem (MTSP) with workload balance. A hybrid ant colony optimization algorithm (HACO) was developed for this MTSP. The proposed HACO was tested on some benchmark instances in literatures with the objective of minimizing the maximum distance traveled by each salesman, which is related with balancing the workload among salesmen. Computational results show that the HACO is competitive. One real tobacco distribution instance was resolved by proposed method which result in distribution cost reducing and efficiency improving.