Future paths for integer programming and links to artificial intelligence
Computers and Operations Research - Special issue: Applications of integer programming
Sequencing of insertions in printed circuit board assembly
Operations Research
Bandwidth packing: a tabu search approach
Management Science
Hashing vectors for tabu search
Annals of Operations Research - Special issue on Tabu search
Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
Annals of Operations Research - Special issue on Tabu search
New ideas in optimization
Heuristics for the mixed rural postman problem
Computers and Operations Research
Tabu Search
A Genetic Algorithm for the Capacitated Arc Routing Problem and Its Extensions
Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
A Template for Scatter Search and Path Relinking
AE '97 Selected Papers from the Third European Conference on Artificial Evolution
A Tabu Search Heuristic for the Capacitated Arc Routing Problem
Operations Research
A Hierarchical Relaxations Lower Bound for the Capacitated Arc Routing Problem
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 3 - Volume 3
An algorithm for the hierarchical Chinese postman problem
Operations Research Letters
Lower and upper bounds for the mixed capacitated arc routing problem
Computers and Operations Research
A tabu search algorithm for the min-max k-Chinese postman problem
Computers and Operations Research
A genetic algorithm for a bi-objective capacitated arc routing problem
Computers and Operations Research
A hybrid scatter search for the probabilistic traveling salesman problem
Computers and Operations Research
A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers
Computers and Operations Research
An improved heuristic for the capacitated arc routing problem
Computers and Operations Research
A new hybrid ant colony optimization algorithm for the vehicle routing problem
Pattern Recognition Letters
Computers and Operations Research
A global repair operator for capacitated arc routing problem
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Improved memetic algorithm for capacitated arc routing problem
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Computers and Operations Research
A guided local search procedure for the multi-compartment capacitated arc routing problem
Computers and Operations Research
The open capacitated arc routing problem
Computers and Operations Research
Hybrid metaheuristics in combinatorial optimization: A survey
Applied Soft Computing
Computers and Operations Research
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Development and assessment of the SHARP and RandSHARP algorithms for the arc routing problem
AI Communications - 18th RCRA International Workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”
The double layer optimization problem to express logistics systems and its heuristic algorithm
Expert Systems with Applications: An International Journal
GRASP with evolutionary path-relinking for the capacitated arc routing problem
Computers and Operations Research
| Hi-index | 0.00 |
We consider a special routing problem which has a variety of practical applications. In a graph-theoretic context it is known as the capacitated Chinese postman problem. Given an undirected network in which the demand is located on edges, the goal is to determine a least-cost schedule of routes. The route demands, which must not exceed the vehicle capacity, are serviced by a fleet of vehicles which is located at a single depot node. We present a metaheuristic based on a tabu search procedure that makes use of the scatter search paradigm. The computational results indicate that the algorithms proposed can keep up with other arc routing heuristics.