Heuristics for the traveling salesman problem with pickup and delivery
Computers and Operations Research
Swarm intelligence: from natural to artificial systems
Swarm intelligence: from natural to artificial systems
MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows
New ideas in optimization
Ant algorithms for discrete optimization
Artificial Life
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Ant System Applied to the Quadratic Assignment Problem
IEEE Transactions on Knowledge and Data Engineering
Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem
INFORMS Journal on Computing
An Exact Method for the Vehicle Routing Problem with Backhauls
Transportation Science
HAS-SOP: Hybrid Ant System for the Sequential Ordering Problem
HAS-SOP: Hybrid Ant System for the Sequential Ordering Problem
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
An agent based evolutionary approach to path detection for off-road vehicle guidance
Pattern Recognition Letters - Special issue: Evolutionary computer vision and image understanding
A heuristic method for the vehicle routing problem with mixed deliveries and pickups
Journal of Scheduling
Mining software repositories for comprehensible software fault prediction models
Journal of Systems and Software
An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup
Computers and Operations Research
Expert Systems with Applications: An International Journal
Building comprehensible customer churn prediction models with advanced rule induction techniques
Expert Systems with Applications: An International Journal
A multi-level ant-colony mining algorithm for membership functions
Information Sciences: an International Journal
The vehicle routing problem with restricted mixing of deliveries and pickups
Journal of Scheduling
Hi-index | 0.00 |
Ant system algorithms have been used successfully to solve many hard combinatorial problems. In this paper we introduce an ant system method to solve the mixed vehicle routing problem with backhauls. Some enhancements to the general characteristics of ant system algorithms are proposed. We concentrate on the way the candidate list is constructed, a look ahead scheme to incorporate into the visibility function and efficient rules to deal with local as well as global updating. Computational results on test problems are reported and compared to known results.