Journal ArticleDOI
A guided local search heuristic for the capacitated arc routing problem
Reads0
Chats0
TLDR
A new local search algorithm for the capacitated arc routing problem (CARP) is presented that outperforms the existing heuristics for the CARP and often detects an optimal solution within limited computation time.About:
This article is published in European Journal of Operational Research.The article was published on 2003-06-16. It has received 184 citations till now. The article focuses on the topics: Arc routing & Guided Local Search.read more
Citations
More filters
Journal ArticleDOI
Competitive Memetic Algorithms for Arc Routing Problems
TL;DR: Basic components that can be combined into powerful memetic algorithms (MAs) for solving an extended version of the Capacitated Arc Routing Problem (ECARP) are presented.
Journal ArticleDOI
Combinatorial optimization and Green Logistics
TL;DR: The purpose of this paper is to introduce the area of Green Logistics and to describe some of the problems that arise in this subject which can be formulated as combinatorial optimization problems.
Posted Content
Combinatorial optimization and Green Logistics
TL;DR: In this paper, the authors introduce the area of green logistics and describe some of the problems that arise in this subject which can be formulated as combinatorial optimization problems, particularly considering the topics of reverse logistics, waste management and vehicle routing and scheduling.
Book ChapterDOI
Guided Local Search
TL;DR: In this paper, the principles of Guided Local Search and Fast Local Search (FLS) are described and a survey of their applications is presented. And guidance for implementing and using GLS and FLS is provided.
Journal ArticleDOI
A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems
TL;DR: It has been shown that the HMOEA is effective in solving multi-objective combinatorial optimization problems, such as finding useful trade-off solutions for the TTVRP routing problem.
References
More filters
Journal ArticleDOI
Computer solutions of the traveling salesman problem
TL;DR: Two algorithms for solving the (symmetric distance) traveling salesman problem have been programmed for a high-speed digital computer and are based on a general heuristic approach believed to be of general applicability to various optimization problems.
Book
Local Search in Combinatorial Optimization
TL;DR: Local search is still the method of choice for NP-hard problems as it provides a robust approach for obtaining high-quality solutions to problems of a realistic size in a reasonable time.
Journal ArticleDOI
A Method for Solving Traveling-Salesman Problems
TL;DR: A method of solution for the traveling-salesman problem that is applicable to both symmetric and asymmetric problems with random elements, and does not use subjective decisions, so that it can be completely mechanized.
A tabu search heuristic for the vehicle routing problem
TL;DR: Taburoute as mentioned in this paper is a new tabu search heuristic for the vehicle routing problem with capacity and route length restrictions, which considers a sequence of adjacent solutions obtained by repeatedly removing a vertex from its current route, and reinserting it into another route.
Journal ArticleDOI
A tabu search heuristic for the vehicle routing problem
TL;DR: Numerical tests on a set of benchmark problems indicate that tabu search outperforms the best existing heuristics, and TABUROUTE often produces the bes known solutions.