مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Verion

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

video

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

sound

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Version

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View:

1,692
Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Download:

0
Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Cites:

2

Information Journal Paper

Title

AN IMPROVED ANT COLONY SYSTEM FOR SOLVING THE VEHICLE ROUTING PROBLEM WITH SIMULTANEOUS PICKUP AND DELIVERY

Pages

  183-198

Abstract

 The classical VEHICLE ROUTING PROBLEM (VRP) is one of the most important combinatorial optimisation problems, and has received much attention from researchers and scientists. This problem involves routing a fleet of vehicles, each visiting a set of customers such that every customer is visited exactly once and by exactly one vehicle, with the objective of minimizing the total distance travelled by all the vehicles. The VEHICLE ROUTING PROBLEM with simultaneous pickups and deliveries (VRP_SPD) is an extension to the VRP, where the vehicles are not only required to deliver goods to customers, but also to collect some goods from the customer locations.Ant Colony Optimisation (ACO) is a probabilistic technique that simulates the ants’ food-hunting behaviour, which is used for solving problems that do not have a known efficient algorithm. The ANT COLONY SYSTEM (ACS) is one of the most famous metaheuristic algorithms, which differs from the other ACO methods due to its transition rule and updating pheromone.This paper proposes an improved ACS, mixed with a 3-opt local search for solving the VRP_SPD. The proposed method is different to the common ACS with regards to the coefficient pheromone and HEURISTIC INFORMATION for the ant visibility measure. This process will avoid the premature convergence and generate better solutions. The proposed algorithm is tested on 34 standard instances available in the literature. The computational result shows that the proposed algorithm improves the four best-known solutions of the benchmark problem, and it is competitive with other metaheuristic algorithms for solving the VRP_SPD.

Cites

References

Cite

APA: Copy

YOUSEFI KHOSHBAKHT, M., & RAHMATI, F.. (2011). AN IMPROVED ANT COLONY SYSTEM FOR SOLVING THE VEHICLE ROUTING PROBLEM WITH SIMULTANEOUS PICKUP AND DELIVERY. JOURNAL OF TRANSPORTATION RESEARCH, 8(2 (27)), 183-198. SID. https://sid.ir/paper/83989/en

Vancouver: Copy

YOUSEFI KHOSHBAKHT M., RAHMATI F.. AN IMPROVED ANT COLONY SYSTEM FOR SOLVING THE VEHICLE ROUTING PROBLEM WITH SIMULTANEOUS PICKUP AND DELIVERY. JOURNAL OF TRANSPORTATION RESEARCH[Internet]. 2011;8(2 (27)):183-198. Available from: https://sid.ir/paper/83989/en

IEEE: Copy

M. YOUSEFI KHOSHBAKHT, and F. RAHMATI, “AN IMPROVED ANT COLONY SYSTEM FOR SOLVING THE VEHICLE ROUTING PROBLEM WITH SIMULTANEOUS PICKUP AND DELIVERY,” JOURNAL OF TRANSPORTATION RESEARCH, vol. 8, no. 2 (27), pp. 183–198, 2011, [Online]. Available: https://sid.ir/paper/83989/en

Related Journal Papers

Related Seminar Papers

  • No record.
  • Related Plans

  • No record.
  • Recommended Workshops






    Move to top